./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH --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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:19:58,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:19:58,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:19:58,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:19:58,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:19:58,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:19:58,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:19:58,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:19:58,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:19:58,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:19:58,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:19:58,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:19:58,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:19:58,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:19:58,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:19:58,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:19:58,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:19:58,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:19:58,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:19:58,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:19:58,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:19:58,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:19:58,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:19:58,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:19:58,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:19:58,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:19:58,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:19:58,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:19:58,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:19:58,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:19:58,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:19:58,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:19:58,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:19:58,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:19:58,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:19:58,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:19:58,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:19:58,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:19:58,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:19:58,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:19:58,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:19:58,359 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-03 05:19:58,411 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:19:58,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:19:58,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:19:58,413 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:19:58,413 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:19:58,413 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:19:58,414 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:19:58,414 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:19:58,414 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:19:58,414 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:19:58,415 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:19:58,416 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:19:58,416 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:19:58,416 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:19:58,416 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:19:58,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 05:19:58,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 05:19:58,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:19:58,418 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:19:58,418 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 05:19:58,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:19:58,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:19:58,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:19:58,419 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 05:19:58,419 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 05:19:58,419 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-03 05:19:58,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:19:58,421 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:19:58,422 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:19:58,422 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:19:58,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:19:58,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:19:58,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:19:58,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:19:58,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:19:58,423 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:19:58,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:19:58,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:19:58,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:19:58,424 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a [2021-11-03 05:19:58,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:19:58,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:19:58,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:19:58,767 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:19:58,768 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:19:58,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/verifythis/elimination_max_rec.c [2021-11-03 05:19:58,824 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/data/c3f3ec04f/12ed7a46edc442c1a966aaaf0cfc1cf0/FLAGd30c36d9f [2021-11-03 05:19:59,282 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:19:59,283 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/sv-benchmarks/c/verifythis/elimination_max_rec.c [2021-11-03 05:19:59,291 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/data/c3f3ec04f/12ed7a46edc442c1a966aaaf0cfc1cf0/FLAGd30c36d9f [2021-11-03 05:19:59,311 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/data/c3f3ec04f/12ed7a46edc442c1a966aaaf0cfc1cf0 [2021-11-03 05:19:59,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:19:59,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:19:59,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:19:59,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:19:59,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:19:59,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469c995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59, skipping insertion in model container [2021-11-03 05:19:59,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:19:59,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:19:59,500 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2021-11-03 05:19:59,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:19:59,543 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:19:59,558 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2021-11-03 05:19:59,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:19:59,596 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:19:59,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59 WrapperNode [2021-11-03 05:19:59,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:19:59,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:19:59,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:19:59,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:19:59,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:19:59,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:19:59,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:19:59,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:19:59,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:19:59,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:19:59,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:19:59,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:19:59,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (1/1) ... [2021-11-03 05:19:59,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:19:59,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:19:59,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:19:59,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:19:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:19:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-11-03 05:19:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-11-03 05:19:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:19:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 05:19:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:19:59,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:19:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 05:19:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:20:00,283 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:20:00,283 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-11-03 05:20:00,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:20:00 BoogieIcfgContainer [2021-11-03 05:20:00,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:20:00,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:20:00,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:20:00,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:20:00,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:19:59" (1/3) ... [2021-11-03 05:20:00,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1dea0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:20:00, skipping insertion in model container [2021-11-03 05:20:00,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:19:59" (2/3) ... [2021-11-03 05:20:00,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1dea0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:20:00, skipping insertion in model container [2021-11-03 05:20:00,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:20:00" (3/3) ... [2021-11-03 05:20:00,293 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2021-11-03 05:20:00,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:20:00,305 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-03 05:20:00,364 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:20:00,378 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:20:00,378 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-03 05:20:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.85) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:20:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:20:00,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:00,404 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:20:00,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:00,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash -731280393, now seen corresponding path program 1 times [2021-11-03 05:20:00,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:00,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371733448] [2021-11-03 05:20:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:00,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:00,735 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:00,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371733448] [2021-11-03 05:20:00,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371733448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:20:00,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:20:00,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:20:00,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734506620] [2021-11-03 05:20:00,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:20:00,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:00,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:20:00,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:20:00,772 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.85) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:00,944 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-11-03 05:20:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:20:00,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-03 05:20:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:00,955 INFO L225 Difference]: With dead ends: 66 [2021-11-03 05:20:00,956 INFO L226 Difference]: Without dead ends: 65 [2021-11-03 05:20:00,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:20:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-03 05:20:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2021-11-03 05:20:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.75) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2021-11-03 05:20:01,000 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 6 [2021-11-03 05:20:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:01,001 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-11-03 05:20:01,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2021-11-03 05:20:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 05:20:01,002 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:01,002 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:01,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:20:01,003 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1194851665, now seen corresponding path program 1 times [2021-11-03 05:20:01,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:01,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48544579] [2021-11-03 05:20:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:01,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:01,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:01,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48544579] [2021-11-03 05:20:01,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48544579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:20:01,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:20:01,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:20:01,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693898501] [2021-11-03 05:20:01,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:20:01,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:01,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:20:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:20:01,062 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:01,118 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-11-03 05:20:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:20:01,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 05:20:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:01,120 INFO L225 Difference]: With dead ends: 46 [2021-11-03 05:20:01,120 INFO L226 Difference]: Without dead ends: 46 [2021-11-03 05:20:01,121 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:20:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-03 05:20:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-11-03 05:20:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.46875) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-11-03 05:20:01,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 7 [2021-11-03 05:20:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:01,128 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-11-03 05:20:01,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-11-03 05:20:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 05:20:01,129 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:01,129 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:01,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:20:01,130 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1194851664, now seen corresponding path program 1 times [2021-11-03 05:20:01,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:01,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130537503] [2021-11-03 05:20:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:01,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:01,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:01,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130537503] [2021-11-03 05:20:01,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130537503] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:20:01,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:20:01,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:20:01,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034370970] [2021-11-03 05:20:01,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:20:01,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:20:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:20:01,245 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:01,375 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2021-11-03 05:20:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:20:01,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 05:20:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:01,377 INFO L225 Difference]: With dead ends: 52 [2021-11-03 05:20:01,377 INFO L226 Difference]: Without dead ends: 52 [2021-11-03 05:20:01,378 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:20:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-03 05:20:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2021-11-03 05:20:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.40625) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2021-11-03 05:20:01,384 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 7 [2021-11-03 05:20:01,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:01,384 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2021-11-03 05:20:01,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2021-11-03 05:20:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 05:20:01,386 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:01,386 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:01,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:20:01,386 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1614304061, now seen corresponding path program 1 times [2021-11-03 05:20:01,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:01,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643664090] [2021-11-03 05:20:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:01,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:01,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:01,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643664090] [2021-11-03 05:20:01,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643664090] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:20:01,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:20:01,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:20:01,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774268163] [2021-11-03 05:20:01,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:20:01,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:01,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:20:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:20:01,596 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:01,753 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2021-11-03 05:20:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:20:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-03 05:20:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:01,755 INFO L225 Difference]: With dead ends: 51 [2021-11-03 05:20:01,756 INFO L226 Difference]: Without dead ends: 51 [2021-11-03 05:20:01,757 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-03 05:20:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-11-03 05:20:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-11-03 05:20:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.375) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2021-11-03 05:20:01,775 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 8 [2021-11-03 05:20:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:01,775 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2021-11-03 05:20:01,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-11-03 05:20:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 05:20:01,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:01,777 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:01,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:20:01,777 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1486703209, now seen corresponding path program 1 times [2021-11-03 05:20:01,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:01,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46948638] [2021-11-03 05:20:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:01,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:01,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:01,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46948638] [2021-11-03 05:20:01,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46948638] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:20:01,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:20:01,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:20:01,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295518920] [2021-11-03 05:20:01,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:20:01,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:20:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:20:01,845 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:20:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:01,858 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-11-03 05:20:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:20:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-03 05:20:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:01,862 INFO L225 Difference]: With dead ends: 44 [2021-11-03 05:20:01,862 INFO L226 Difference]: Without dead ends: 44 [2021-11-03 05:20:01,863 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:20:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-03 05:20:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-11-03 05:20:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.34375) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2021-11-03 05:20:01,878 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 9 [2021-11-03 05:20:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:01,879 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2021-11-03 05:20:01,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:20:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-11-03 05:20:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:20:01,880 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:01,881 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:01,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:20:01,881 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:01,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1502327290, now seen corresponding path program 1 times [2021-11-03 05:20:01,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:01,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343835771] [2021-11-03 05:20:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:01,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:01,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:01,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343835771] [2021-11-03 05:20:01,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343835771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:20:01,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:20:01,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 05:20:01,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138690597] [2021-11-03 05:20:01,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:20:01,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:01,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:20:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:20:01,991 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:20:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:02,015 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-11-03 05:20:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:20:02,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-11-03 05:20:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:02,017 INFO L225 Difference]: With dead ends: 43 [2021-11-03 05:20:02,017 INFO L226 Difference]: Without dead ends: 35 [2021-11-03 05:20:02,017 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:20:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-03 05:20:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-11-03 05:20:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.36) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:20:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-11-03 05:20:02,021 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2021-11-03 05:20:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:02,021 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-11-03 05:20:02,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-03 05:20:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-11-03 05:20:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:20:02,023 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:02,023 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:02,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:20:02,023 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:02,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1523715275, now seen corresponding path program 1 times [2021-11-03 05:20:02,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:02,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795022982] [2021-11-03 05:20:02,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:02,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:02,222 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:02,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795022982] [2021-11-03 05:20:02,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795022982] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:02,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731383697] [2021-11-03 05:20:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:02,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:02,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:02,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 05:20:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:02,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-03 05:20:02,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:02,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-03 05:20:02,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 73 treesize of output 65 [2021-11-03 05:20:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:02,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:05,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731383697] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:05,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1350535301] [2021-11-03 05:20:05,567 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2021-11-03 05:20:05,567 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:05,572 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:05,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:05,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2021-11-03 05:20:05,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319773055] [2021-11-03 05:20:05,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-03 05:20:05,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:05,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-03 05:20:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=245, Unknown=1, NotChecked=0, Total=306 [2021-11-03 05:20:05,576 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:06,070 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-11-03 05:20:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 05:20:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 05:20:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:06,071 INFO L225 Difference]: With dead ends: 39 [2021-11-03 05:20:06,071 INFO L226 Difference]: Without dead ends: 39 [2021-11-03 05:20:06,072 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=193, Invalid=562, Unknown=1, NotChecked=0, Total=756 [2021-11-03 05:20:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-03 05:20:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2021-11-03 05:20:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:20:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-11-03 05:20:06,075 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2021-11-03 05:20:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:06,076 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-11-03 05:20:06,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-11-03 05:20:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:20:06,077 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:06,077 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:06,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:20:06,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-03 05:20:06,288 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash -9462692, now seen corresponding path program 1 times [2021-11-03 05:20:06,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:06,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479254073] [2021-11-03 05:20:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:06,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:06,527 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:06,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479254073] [2021-11-03 05:20:06,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479254073] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:06,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710158511] [2021-11-03 05:20:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:06,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:06,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:06,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:06,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 05:20:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:06,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-03 05:20:06,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:06,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-03 05:20:06,740 INFO L354 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2021-11-03 05:20:06,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2021-11-03 05:20:07,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 77 treesize of output 69 [2021-11-03 05:20:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:07,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:08,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710158511] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:08,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [411916827] [2021-11-03 05:20:08,482 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-03 05:20:08,482 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:08,483 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:08,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:08,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2021-11-03 05:20:08,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078700861] [2021-11-03 05:20:08,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-03 05:20:08,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-03 05:20:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-11-03 05:20:08,490 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:09,315 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-11-03 05:20:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:20:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-03 05:20:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:09,316 INFO L225 Difference]: With dead ends: 38 [2021-11-03 05:20:09,316 INFO L226 Difference]: Without dead ends: 38 [2021-11-03 05:20:09,317 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2021-11-03 05:20:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-03 05:20:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-11-03 05:20:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:20:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-11-03 05:20:09,319 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2021-11-03 05:20:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:09,320 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-11-03 05:20:09,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-11-03 05:20:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 05:20:09,321 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:09,321 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:09,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 05:20:09,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-03 05:20:09,536 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -293033423, now seen corresponding path program 1 times [2021-11-03 05:20:09,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:09,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518048241] [2021-11-03 05:20:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:09,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:09,636 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:09,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518048241] [2021-11-03 05:20:09,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518048241] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:09,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108823551] [2021-11-03 05:20:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:09,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:09,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:09,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:09,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 05:20:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:09,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-03 05:20:09,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:09,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:10,180 INFO L388 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 37 treesize of output 33 [2021-11-03 05:20:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:10,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108823551] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:10,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1761284049] [2021-11-03 05:20:10,389 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-03 05:20:10,389 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:10,390 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:10,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:10,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2021-11-03 05:20:10,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236050025] [2021-11-03 05:20:10,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-03 05:20:10,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:10,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-03 05:20:10,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-03 05:20:10,395 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 19 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 5 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:10,698 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2021-11-03 05:20:10,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 05:20:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 5 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 15 [2021-11-03 05:20:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:10,700 INFO L225 Difference]: With dead ends: 36 [2021-11-03 05:20:10,700 INFO L226 Difference]: Without dead ends: 36 [2021-11-03 05:20:10,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2021-11-03 05:20:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-11-03 05:20:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2021-11-03 05:20:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:20:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2021-11-03 05:20:10,704 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 15 [2021-11-03 05:20:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:10,704 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2021-11-03 05:20:10,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 5 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2021-11-03 05:20:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 05:20:10,705 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:10,706 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-11-03 05:20:10,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-03 05:20:10,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:10,920 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:10,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash -293343471, now seen corresponding path program 1 times [2021-11-03 05:20:10,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:10,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010500808] [2021-11-03 05:20:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:10,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:11,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:11,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010500808] [2021-11-03 05:20:11,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010500808] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:11,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273735713] [2021-11-03 05:20:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:11,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:11,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:11,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:11,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-03 05:20:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:11,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-03 05:20:11,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:11,328 INFO L354 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2021-11-03 05:20:11,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2021-11-03 05:20:11,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 37 [2021-11-03 05:20:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 05:20:11,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:12,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 75 treesize of output 59 [2021-11-03 05:20:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:20:12,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273735713] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:12,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1737840217] [2021-11-03 05:20:12,278 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-03 05:20:12,279 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:12,279 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:12,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:12,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 18 [2021-11-03 05:20:12,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093959891] [2021-11-03 05:20:12,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-03 05:20:12,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-03 05:20:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-11-03 05:20:12,282 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 20 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:12,984 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2021-11-03 05:20:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:20:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-03 05:20:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:12,985 INFO L225 Difference]: With dead ends: 35 [2021-11-03 05:20:12,985 INFO L226 Difference]: Without dead ends: 35 [2021-11-03 05:20:12,986 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2021-11-03 05:20:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-03 05:20:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2021-11-03 05:20:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-03 05:20:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-11-03 05:20:12,989 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2021-11-03 05:20:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:12,989 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-11-03 05:20:12,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:20:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-11-03 05:20:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:20:12,990 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:12,990 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:13,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-03 05:20:13,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:13,197 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:13,198 INFO L85 PathProgramCache]: Analyzing trace with hash -494100806, now seen corresponding path program 1 times [2021-11-03 05:20:13,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:13,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266408140] [2021-11-03 05:20:13,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:13,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:13,452 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:13,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266408140] [2021-11-03 05:20:13,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266408140] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:13,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304411580] [2021-11-03 05:20:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:13,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:13,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:13,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-03 05:20:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:13,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-03 05:20:13,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:13,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-03 05:20:13,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 81 treesize of output 73 [2021-11-03 05:20:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:14,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:14,680 INFO L388 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 85 treesize of output 81 [2021-11-03 05:20:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:17,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304411580] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:17,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1532740867] [2021-11-03 05:20:17,677 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-11-03 05:20:17,677 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:17,677 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:17,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:17,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2021-11-03 05:20:17,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318336136] [2021-11-03 05:20:17,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-03 05:20:17,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:17,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-03 05:20:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=938, Unknown=1, NotChecked=0, Total=1056 [2021-11-03 05:20:17,681 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 33 states, 26 states have (on average 1.5) internal successors, (39), 25 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:18,806 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-11-03 05:20:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-03 05:20:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.5) internal successors, (39), 25 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 16 [2021-11-03 05:20:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:18,807 INFO L225 Difference]: With dead ends: 50 [2021-11-03 05:20:18,808 INFO L226 Difference]: Without dead ends: 50 [2021-11-03 05:20:18,809 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=379, Invalid=2170, Unknown=1, NotChecked=0, Total=2550 [2021-11-03 05:20:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-11-03 05:20:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2021-11-03 05:20:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-03 05:20:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-11-03 05:20:18,813 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 16 [2021-11-03 05:20:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:18,813 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-11-03 05:20:18,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.5) internal successors, (39), 25 states have internal predecessors, (39), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-03 05:20:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-11-03 05:20:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:20:18,814 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:18,815 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:18,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-03 05:20:19,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-03 05:20:19,031 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:19,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1910512843, now seen corresponding path program 1 times [2021-11-03 05:20:19,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:19,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771650973] [2021-11-03 05:20:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:19,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:19,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:19,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771650973] [2021-11-03 05:20:19,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771650973] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:19,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234977504] [2021-11-03 05:20:19,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:19,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:19,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:19,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-03 05:20:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:19,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-03 05:20:19,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:19,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-11-03 05:20:21,426 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_7 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_7))) is different from true [2021-11-03 05:20:21,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 47 treesize of output 41 [2021-11-03 05:20:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-03 05:20:21,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:20:29,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234977504] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:29,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1577231932] [2021-11-03 05:20:29,733 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:20:29,733 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:29,733 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:29,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:29,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2021-11-03 05:20:29,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946914478] [2021-11-03 05:20:29,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-03 05:20:29,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:29,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-03 05:20:29,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=4, NotChecked=24, Total=210 [2021-11-03 05:20:29,736 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:20:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:20:29,854 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2021-11-03 05:20:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:20:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2021-11-03 05:20:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:20:29,855 INFO L225 Difference]: With dead ends: 36 [2021-11-03 05:20:29,855 INFO L226 Difference]: Without dead ends: 32 [2021-11-03 05:20:29,855 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=4, NotChecked=32, Total=342 [2021-11-03 05:20:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-03 05:20:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-03 05:20:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:20:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-11-03 05:20:29,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2021-11-03 05:20:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:20:29,860 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-11-03 05:20:29,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-03 05:20:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-11-03 05:20:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-03 05:20:29,862 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:20:29,862 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:20:29,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-03 05:20:30,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:30,068 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 11 more)] === [2021-11-03 05:20:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:20:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1927859101, now seen corresponding path program 1 times [2021-11-03 05:20:30,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:20:30,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260054458] [2021-11-03 05:20:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:30,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:20:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 05:20:30,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:20:30,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260054458] [2021-11-03 05:20:30,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260054458] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:20:30,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819659356] [2021-11-03 05:20:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:20:30,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:20:30,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:20:30,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:20:30,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-03 05:20:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:20:30,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-03 05:20:30,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:20:30,837 INFO L354 Elim1Store]: treesize reduction 78, result has 32.2 percent of original size [2021-11-03 05:20:30,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 44 [2021-11-03 05:20:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-03 05:20:38,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:20:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 05:20:38,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819659356] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:20:38,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1861908185] [2021-11-03 05:20:38,798 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-03 05:20:38,798 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:20:38,799 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:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-03 05:20:38,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:20:38,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 6] total 33 [2021-11-03 05:20:38,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858094658] [2021-11-03 05:20:38,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-03 05:20:38,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:20:38,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-03 05:20:38,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1037, Unknown=3, NotChecked=0, Total=1122 [2021-11-03 05:20:38,805 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 34 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 8 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-03 05:21:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:21:26,822 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2021-11-03 05:21:26,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-03 05:21:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 8 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2021-11-03 05:21:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:21:26,823 INFO L225 Difference]: With dead ends: 50 [2021-11-03 05:21:26,823 INFO L226 Difference]: Without dead ends: 0 [2021-11-03 05:21:26,824 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=483, Invalid=3408, Unknown=15, NotChecked=0, Total=3906 [2021-11-03 05:21:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-03 05:21:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-03 05:21:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:21:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-03 05:21:26,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-11-03 05:21:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:21:26,825 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-03 05:21:26,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 2.642857142857143) internal successors, (74), 28 states have internal predecessors, (74), 8 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-03 05:21:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-03 05:21:26,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-03 05:21:26,828 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:21:26,828 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:21:26,829 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:21:26,829 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:26,829 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:26,829 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr1REQUIRES_VIOLATION [2021-11-03 05:21:26,829 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr2REQUIRES_VIOLATION [2021-11-03 05:21:26,830 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr3REQUIRES_VIOLATION [2021-11-03 05:21:26,830 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr4REQUIRES_VIOLATION [2021-11-03 05:21:26,830 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr5REQUIRES_VIOLATION [2021-11-03 05:21:26,830 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr6REQUIRES_VIOLATION [2021-11-03 05:21:26,830 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr7REQUIRES_VIOLATION [2021-11-03 05:21:26,831 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr8REQUIRES_VIOLATION [2021-11-03 05:21:26,831 INFO L764 garLoopResultBuilder]: Registering result SAFE for location checkErr9ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:21:26,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-03 05:21:27,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-03 05:21:27,058 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:21:27,059 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:21:27,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:21:27 BoogieIcfgContainer [2021-11-03 05:21:27,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:21:27,061 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:21:27,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:21:27,062 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:21:27,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:20:00" (3/4) ... [2021-11-03 05:21:27,064 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-03 05:21:27,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2021-11-03 05:21:27,077 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-11-03 05:21:27,077 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-11-03 05:21:27,078 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-03 05:21:27,078 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:21:27,111 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 05:21:27,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:21:27,116 INFO L168 Benchmark]: Toolchain (without parser) took 87800.46 ms. Allocated memory was 107.0 MB in the beginning and 176.2 MB in the end (delta: 69.2 MB). Free memory was 69.9 MB in the beginning and 135.8 MB in the end (delta: -65.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:27,117 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 107.0 MB. Free memory is still 86.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:21:27,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.56 ms. Allocated memory is still 107.0 MB. Free memory was 69.7 MB in the beginning and 81.9 MB in the end (delta: -12.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:27,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.06 ms. Allocated memory is still 107.0 MB. Free memory was 81.9 MB in the beginning and 80.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:21:27,118 INFO L168 Benchmark]: Boogie Preprocessor took 40.50 ms. Allocated memory is still 107.0 MB. Free memory was 80.3 MB in the beginning and 78.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:27,119 INFO L168 Benchmark]: RCFGBuilder took 588.71 ms. Allocated memory is still 107.0 MB. Free memory was 78.9 MB in the beginning and 61.6 MB in the end (delta: 17.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:27,119 INFO L168 Benchmark]: TraceAbstraction took 86773.77 ms. Allocated memory was 107.0 MB in the beginning and 176.2 MB in the end (delta: 69.2 MB). Free memory was 61.4 MB in the beginning and 140.0 MB in the end (delta: -78.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:21:27,120 INFO L168 Benchmark]: Witness Printer took 53.70 ms. Allocated memory is still 176.2 MB. Free memory was 140.0 MB in the beginning and 135.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:21:27,122 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 107.0 MB. Free memory is still 86.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 279.56 ms. Allocated memory is still 107.0 MB. Free memory was 69.7 MB in the beginning and 81.9 MB in the end (delta: -12.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.06 ms. Allocated memory is still 107.0 MB. Free memory was 81.9 MB in the beginning and 80.3 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.50 ms. Allocated memory is still 107.0 MB. Free memory was 80.3 MB in the beginning and 78.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 588.71 ms. Allocated memory is still 107.0 MB. Free memory was 78.9 MB in the beginning and 61.6 MB in the end (delta: 17.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 86773.77 ms. Allocated memory was 107.0 MB in the beginning and 176.2 MB in the end (delta: 69.2 MB). Free memory was 61.4 MB in the beginning and 140.0 MB in the end (delta: -78.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 53.70 ms. Allocated memory is still 176.2 MB. Free memory was 140.0 MB in the beginning and 135.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 48]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 86.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 52.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 228 SDtfs, 1182 SDslu, 793 SDs, 0 SdLazy, 1935 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 263 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 73.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=1, InterpolantAutomatonStates: 143, 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, 13 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.0s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 384 ConstructedInterpolants, 51 QuantifiedInterpolants, 7243 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 190 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 23/108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-03 05:21:27,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b32839c3-826b-4aed-952b-a3396f1a5104/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE