./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG --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 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG --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 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:43:19,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:43:19,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:43:19,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:43:19,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:43:19,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:43:19,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:43:19,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:43:19,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:43:19,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:43:19,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:43:19,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:43:19,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:43:19,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:43:19,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:43:19,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:43:19,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:43:19,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:43:19,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:43:19,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:43:19,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:43:19,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:43:19,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:43:19,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:43:19,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:43:19,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:43:19,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:43:19,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:43:19,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:43:19,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:43:19,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:43:19,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:43:19,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:43:19,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:43:19,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:43:19,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:43:19,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:43:19,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:43:19,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:43:19,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:43:19,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:43:19,470 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-29 04:43:19,525 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:43:19,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:43:19,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:43:19,535 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:43:19,536 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:43:19,536 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:43:19,537 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:43:19,537 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:43:19,537 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:43:19,538 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:43:19,539 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:43:19,539 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:43:19,540 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:43:19,540 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:43:19,540 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:43:19,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 04:43:19,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 04:43:19,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:43:19,542 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:43:19,543 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 04:43:19,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:43:19,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:43:19,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:43:19,544 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 04:43:19,544 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 04:43:19,544 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-29 04:43:19,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:43:19,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:43:19,547 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:43:19,547 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:43:19,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:43:19,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:43:19,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:43:19,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:43:19,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:43:19,550 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:43:19,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:43:19,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:43:19,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:43:19,551 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_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/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_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2021-10-29 04:43:19,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:43:19,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:43:19,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:43:19,932 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:43:19,933 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:43:19,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-29 04:43:20,051 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/660b29c04/3db381b31b344c07810b88fe9020a7a6/FLAGb13e38e0d [2021-10-29 04:43:20,814 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:43:20,819 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-29 04:43:20,852 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/660b29c04/3db381b31b344c07810b88fe9020a7a6/FLAGb13e38e0d [2021-10-29 04:43:21,080 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/660b29c04/3db381b31b344c07810b88fe9020a7a6 [2021-10-29 04:43:21,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:43:21,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:43:21,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:43:21,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:43:21,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:43:21,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2908204a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21, skipping insertion in model container [2021-10-29 04:43:21,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:43:21,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:43:21,557 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-29 04:43:21,567 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-29 04:43:21,572 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-29 04:43:21,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:43:21,600 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:43:21,646 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-29 04:43:21,647 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-29 04:43:21,649 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-29 04:43:21,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:43:21,693 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:43:21,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21 WrapperNode [2021-10-29 04:43:21,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:43:21,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:43:21,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:43:21,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:43:21,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:43:21,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:43:21,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:43:21,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:43:21,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:43:21,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:43:21,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:43:21,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:43:21,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (1/1) ... [2021-10-29 04:43:21,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:43:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:43:21,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:43:21,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:43:21,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-29 04:43:21,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-29 04:43:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-29 04:43:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-29 04:43:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:43:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-29 04:43:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 04:43:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:43:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:43:21,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:43:22,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:43:22,810 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-10-29 04:43:22,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:22 BoogieIcfgContainer [2021-10-29 04:43:22,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:43:22,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:43:22,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:43:22,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:43:22,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:43:21" (1/3) ... [2021-10-29 04:43:22,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c80fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:43:22, skipping insertion in model container [2021-10-29 04:43:22,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:21" (2/3) ... [2021-10-29 04:43:22,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c80fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:43:22, skipping insertion in model container [2021-10-29 04:43:22,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:22" (3/3) ... [2021-10-29 04:43:22,823 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-10-29 04:43:22,829 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:43:22,829 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-10-29 04:43:22,884 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:43:22,892 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-10-29 04:43:22,892 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-10-29 04:43:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 states have internal predecessors, (135), 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-10-29 04:43:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 04:43:22,950 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:22,951 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 04:43:22,951 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash 8095, now seen corresponding path program 1 times [2021-10-29 04:43:22,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:22,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727104994] [2021-10-29 04:43:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:22,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:23,159 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:23,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727104994] [2021-10-29 04:43:23,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727104994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:23,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:23,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 04:43:23,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397367541] [2021-10-29 04:43:23,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:43:23,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:43:23,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:23,191 INFO L87 Difference]: Start difference. First operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 states have internal predecessors, (135), 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-29 04:43:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:23,365 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2021-10-29 04:43:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:43:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-10-29 04:43:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:23,379 INFO L225 Difference]: With dead ends: 119 [2021-10-29 04:43:23,379 INFO L226 Difference]: Without dead ends: 117 [2021-10-29 04:43:23,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-10-29 04:43:23,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2021-10-29 04:43:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 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-10-29 04:43:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2021-10-29 04:43:23,429 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 2 [2021-10-29 04:43:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:23,430 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2021-10-29 04:43:23,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-29 04:43:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2021-10-29 04:43:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 04:43:23,431 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:23,432 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 04:43:23,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:43:23,432 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash 8096, now seen corresponding path program 1 times [2021-10-29 04:43:23,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:23,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210369170] [2021-10-29 04:43:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:23,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:23,494 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:23,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210369170] [2021-10-29 04:43:23,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210369170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:23,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:23,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 04:43:23,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539411590] [2021-10-29 04:43:23,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:43:23,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:23,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:43:23,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:23,500 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-29 04:43:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:23,705 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2021-10-29 04:43:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:43:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2021-10-29 04:43:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:23,712 INFO L225 Difference]: With dead ends: 127 [2021-10-29 04:43:23,713 INFO L226 Difference]: Without dead ends: 127 [2021-10-29 04:43:23,713 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-29 04:43:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2021-10-29 04:43:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 115 states have internal predecessors, (123), 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-10-29 04:43:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2021-10-29 04:43:23,735 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2021-10-29 04:43:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:23,735 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2021-10-29 04:43:23,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-29 04:43:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2021-10-29 04:43:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 04:43:23,736 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:23,736 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:23,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:43:23,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash -191356527, now seen corresponding path program 1 times [2021-10-29 04:43:23,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:23,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294978735] [2021-10-29 04:43:23,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:23,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:23,866 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:23,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294978735] [2021-10-29 04:43:23,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294978735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:23,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:23,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:43:23,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380670992] [2021-10-29 04:43:23,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:23,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:23,870 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-29 04:43:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:24,085 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2021-10-29 04:43:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:24,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2021-10-29 04:43:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:24,089 INFO L225 Difference]: With dead ends: 117 [2021-10-29 04:43:24,093 INFO L226 Difference]: Without dead ends: 117 [2021-10-29 04:43:24,094 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-10-29 04:43:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-10-29 04:43:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2021-10-29 04:43:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.8125) internal successors, (116), 105 states have internal predecessors, (116), 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-10-29 04:43:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-10-29 04:43:24,113 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 7 [2021-10-29 04:43:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:24,113 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-10-29 04:43:24,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-29 04:43:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-10-29 04:43:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-29 04:43:24,114 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:24,115 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:24,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 04:43:24,115 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:24,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash -191356526, now seen corresponding path program 1 times [2021-10-29 04:43:24,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:24,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916353444] [2021-10-29 04:43:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:24,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:24,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-10-29 04:43:24,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:24,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916353444] [2021-10-29 04:43:24,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916353444] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:24,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:24,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:43:24,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050025805] [2021-10-29 04:43:24,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:24,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:24,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:24,245 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-29 04:43:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:24,544 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2021-10-29 04:43:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:43:24,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2021-10-29 04:43:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:24,548 INFO L225 Difference]: With dead ends: 140 [2021-10-29 04:43:24,551 INFO L226 Difference]: Without dead ends: 140 [2021-10-29 04:43:24,551 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-10-29 04:43:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-10-29 04:43:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2021-10-29 04:43:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 116 states have internal predecessors, (131), 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-10-29 04:43:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2021-10-29 04:43:24,570 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 7 [2021-10-29 04:43:24,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:24,570 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2021-10-29 04:43:24,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-10-29 04:43:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2021-10-29 04:43:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:43:24,571 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:24,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:24,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 04:43:24,572 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash 789967275, now seen corresponding path program 1 times [2021-10-29 04:43:24,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:24,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255901306] [2021-10-29 04:43:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:24,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:24,681 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:24,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255901306] [2021-10-29 04:43:24,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255901306] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:24,682 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:24,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:43:24,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847225230] [2021-10-29 04:43:24,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:24,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:24,684 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-29 04:43:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:24,855 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-10-29 04:43:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:43:24,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2021-10-29 04:43:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:24,857 INFO L225 Difference]: With dead ends: 129 [2021-10-29 04:43:24,857 INFO L226 Difference]: Without dead ends: 129 [2021-10-29 04:43:24,858 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-10-29 04:43:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-10-29 04:43:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2021-10-29 04:43:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 114 states have internal predecessors, (127), 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-10-29 04:43:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2021-10-29 04:43:24,872 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 9 [2021-10-29 04:43:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:24,872 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2021-10-29 04:43:24,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-10-29 04:43:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2021-10-29 04:43:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:43:24,879 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:24,879 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:24,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 04:43:24,881 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash 790171077, now seen corresponding path program 1 times [2021-10-29 04:43:24,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:24,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427850272] [2021-10-29 04:43:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:24,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:25,048 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:25,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427850272] [2021-10-29 04:43:25,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427850272] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:25,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:25,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:43:25,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540510332] [2021-10-29 04:43:25,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:43:25,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:25,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:43:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:25,054 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-29 04:43:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:25,238 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2021-10-29 04:43:25,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:25,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2021-10-29 04:43:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:25,240 INFO L225 Difference]: With dead ends: 114 [2021-10-29 04:43:25,240 INFO L226 Difference]: Without dead ends: 114 [2021-10-29 04:43:25,240 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-29 04:43:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-10-29 04:43:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 113 states have internal predecessors, (125), 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-10-29 04:43:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2021-10-29 04:43:25,264 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 9 [2021-10-29 04:43:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:25,264 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2021-10-29 04:43:25,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-29 04:43:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2021-10-29 04:43:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:43:25,265 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:25,265 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:25,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 04:43:25,266 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash 790171076, now seen corresponding path program 1 times [2021-10-29 04:43:25,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:25,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112437145] [2021-10-29 04:43:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:25,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:25,366 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:25,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112437145] [2021-10-29 04:43:25,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112437145] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:25,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:25,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:43:25,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329796423] [2021-10-29 04:43:25,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:43:25,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:43:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:25,369 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-29 04:43:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:25,539 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-10-29 04:43:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2021-10-29 04:43:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:25,541 INFO L225 Difference]: With dead ends: 113 [2021-10-29 04:43:25,541 INFO L226 Difference]: Without dead ends: 113 [2021-10-29 04:43:25,542 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-29 04:43:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-10-29 04:43:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.64) internal successors, (123), 112 states have internal predecessors, (123), 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-10-29 04:43:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2021-10-29 04:43:25,548 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 9 [2021-10-29 04:43:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:25,549 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2021-10-29 04:43:25,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-10-29 04:43:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2021-10-29 04:43:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:43:25,550 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:25,551 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:25,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 04:43:25,551 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash -854603864, now seen corresponding path program 1 times [2021-10-29 04:43:25,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:25,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149176314] [2021-10-29 04:43:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:25,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:25,658 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:25,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149176314] [2021-10-29 04:43:25,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149176314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:25,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:25,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 04:43:25,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210540380] [2021-10-29 04:43:25,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:43:25,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:25,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:43:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-29 04:43:25,662 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-10-29 04:43:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:25,940 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-10-29 04:43:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 04:43:25,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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) Word has length 11 [2021-10-29 04:43:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:25,942 INFO L225 Difference]: With dead ends: 113 [2021-10-29 04:43:25,942 INFO L226 Difference]: Without dead ends: 113 [2021-10-29 04:43:25,942 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-29 04:43:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-29 04:43:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-10-29 04:43:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 111 states have internal predecessors, (122), 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-10-29 04:43:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2021-10-29 04:43:25,945 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 11 [2021-10-29 04:43:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:25,946 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2021-10-29 04:43:25,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-10-29 04:43:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2021-10-29 04:43:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:43:25,947 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:25,947 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:25,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 04:43:25,947 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -854603863, now seen corresponding path program 1 times [2021-10-29 04:43:25,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:25,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412100447] [2021-10-29 04:43:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:25,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:26,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:26,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412100447] [2021-10-29 04:43:26,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412100447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:26,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:26,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 04:43:26,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770971033] [2021-10-29 04:43:26,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 04:43:26,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:26,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 04:43:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:43:26,131 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-10-29 04:43:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:26,635 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-10-29 04:43:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 04:43:26,636 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) Word has length 11 [2021-10-29 04:43:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:26,637 INFO L225 Difference]: With dead ends: 114 [2021-10-29 04:43:26,637 INFO L226 Difference]: Without dead ends: 114 [2021-10-29 04:43:26,638 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-29 04:43:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-29 04:43:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2021-10-29 04:43:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 105 states have internal predecessors, (116), 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-10-29 04:43:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-10-29 04:43:26,642 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 11 [2021-10-29 04:43:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:26,642 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-10-29 04:43:26,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-10-29 04:43:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-10-29 04:43:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:43:26,643 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:26,643 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:26,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 04:43:26,644 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1793276823, now seen corresponding path program 1 times [2021-10-29 04:43:26,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:26,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875184031] [2021-10-29 04:43:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:26,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:26,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:26,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875184031] [2021-10-29 04:43:26,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875184031] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:26,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:26,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:43:26,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910155958] [2021-10-29 04:43:26,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:43:26,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:43:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:26,720 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-10-29 04:43:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:26,942 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2021-10-29 04:43:26,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:43:26,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 12 [2021-10-29 04:43:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:26,945 INFO L225 Difference]: With dead ends: 161 [2021-10-29 04:43:26,945 INFO L226 Difference]: Without dead ends: 161 [2021-10-29 04:43:26,945 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:43:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-10-29 04:43:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2021-10-29 04:43:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 112 states have internal predecessors, (124), 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-10-29 04:43:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2021-10-29 04:43:26,950 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 12 [2021-10-29 04:43:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:26,951 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2021-10-29 04:43:26,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-10-29 04:43:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2021-10-29 04:43:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 04:43:26,952 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:26,952 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:26,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 04:43:26,953 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:26,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash -50027826, now seen corresponding path program 1 times [2021-10-29 04:43:26,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:26,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857328319] [2021-10-29 04:43:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:26,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:27,010 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:27,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857328319] [2021-10-29 04:43:27,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857328319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:27,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:27,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:43:27,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914691164] [2021-10-29 04:43:27,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:43:27,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:27,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:43:27,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:27,013 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-29 04:43:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:27,175 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2021-10-29 04:43:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2021-10-29 04:43:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:27,176 INFO L225 Difference]: With dead ends: 112 [2021-10-29 04:43:27,177 INFO L226 Difference]: Without dead ends: 112 [2021-10-29 04:43:27,177 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-29 04:43:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-10-29 04:43:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.5) internal successors, (123), 111 states have internal predecessors, (123), 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-10-29 04:43:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2021-10-29 04:43:27,181 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 16 [2021-10-29 04:43:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:27,182 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2021-10-29 04:43:27,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-29 04:43:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2021-10-29 04:43:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 04:43:27,183 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:27,183 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:27,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 04:43:27,184 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash -50027825, now seen corresponding path program 1 times [2021-10-29 04:43:27,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:27,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916956368] [2021-10-29 04:43:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:27,185 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:27,268 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:27,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916956368] [2021-10-29 04:43:27,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916956368] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:27,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:27,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:43:27,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874287974] [2021-10-29 04:43:27,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:43:27,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:27,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:43:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:27,277 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-29 04:43:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:27,426 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2021-10-29 04:43:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:27,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2021-10-29 04:43:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:27,428 INFO L225 Difference]: With dead ends: 111 [2021-10-29 04:43:27,428 INFO L226 Difference]: Without dead ends: 111 [2021-10-29 04:43:27,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-29 04:43:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-10-29 04:43:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 110 states have internal predecessors, (122), 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-10-29 04:43:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2021-10-29 04:43:27,433 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 16 [2021-10-29 04:43:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:27,433 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2021-10-29 04:43:27,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-29 04:43:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2021-10-29 04:43:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 04:43:27,434 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:27,434 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:27,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 04:43:27,435 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2126705211, now seen corresponding path program 1 times [2021-10-29 04:43:27,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:27,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586964509] [2021-10-29 04:43:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:27,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:27,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:43:27,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586964509] [2021-10-29 04:43:27,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586964509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:27,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:27,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:43:27,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523550015] [2021-10-29 04:43:27,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:43:27,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:43:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:43:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:27,594 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10-29 04:43:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:27,730 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2021-10-29 04:43:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:27,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2021-10-29 04:43:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:27,732 INFO L225 Difference]: With dead ends: 112 [2021-10-29 04:43:27,732 INFO L226 Difference]: Without dead ends: 112 [2021-10-29 04:43:27,733 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:43:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-29 04:43:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2021-10-29 04:43:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 109 states have internal predecessors, (120), 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-10-29 04:43:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-10-29 04:43:27,737 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2021-10-29 04:43:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:27,737 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-10-29 04:43:27,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10-29 04:43:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-10-29 04:43:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 04:43:27,738 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:27,739 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:27,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 04:43:27,739 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1503141088, now seen corresponding path program 1 times [2021-10-29 04:43:27,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:43:27,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674082251] [2021-10-29 04:43:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:27,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:43:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:43:27,752 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:43:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:43:27,788 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 04:43:27,788 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 04:43:27,790 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:43:27,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-29 04:43:27,792 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-29 04:43:27,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-29 04:43:27,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-29 04:43:27,793 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-29 04:43:27,794 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-29 04:43:27,794 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-29 04:43:27,794 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-29 04:43:27,794 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-29 04:43:27,795 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-29 04:43:27,795 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-29 04:43:27,795 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-29 04:43:27,796 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-29 04:43:27,796 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-29 04:43:27,796 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-29 04:43:27,796 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-29 04:43:27,796 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-29 04:43:27,797 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-29 04:43:27,797 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-29 04:43:27,797 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-29 04:43:27,797 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-29 04:43:27,797 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-29 04:43:27,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-29 04:43:27,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-29 04:43:27,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-29 04:43:27,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-29 04:43:27,798 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-29 04:43:27,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-29 04:43:27,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-29 04:43:27,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-29 04:43:27,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-29 04:43:27,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-29 04:43:27,799 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:43:27,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-29 04:43:27,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-29 04:43:27,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:43:27,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-29 04:43:27,800 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-29 04:43:27,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-29 04:43:27,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-29 04:43:27,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-29 04:43:27,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-29 04:43:27,801 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-29 04:43:27,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-29 04:43:27,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-29 04:43:27,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-29 04:43:27,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-29 04:43:27,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-29 04:43:27,802 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-29 04:43:27,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-29 04:43:27,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,803 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-29 04:43:27,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-29 04:43:27,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,804 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-29 04:43:27,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-29 04:43:27,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,805 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:43:27,806 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:43:27,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 04:43:27,809 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:27,813 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:43:27,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:43:27 BoogieIcfgContainer [2021-10-29 04:43:27,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:43:27,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:43:27,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:43:27,845 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:43:27,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:22" (3/4) ... [2021-10-29 04:43:27,849 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-29 04:43:27,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:43:27,851 INFO L168 Benchmark]: Toolchain (without parser) took 6763.05 ms. Allocated memory was 81.8 MB in the beginning and 132.1 MB in the end (delta: 50.3 MB). Free memory was 43.5 MB in the beginning and 80.7 MB in the end (delta: -37.2 MB). Peak memory consumption was 12.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:43:27,852 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 81.8 MB. Free memory was 61.3 MB in the beginning and 61.3 MB in the end (delta: 39.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:43:27,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.00 ms. Allocated memory was 81.8 MB in the beginning and 109.1 MB in the end (delta: 27.3 MB). Free memory was 43.3 MB in the beginning and 77.7 MB in the end (delta: -34.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:43:27,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.53 ms. Allocated memory is still 109.1 MB. Free memory was 77.7 MB in the beginning and 75.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:43:27,855 INFO L168 Benchmark]: Boogie Preprocessor took 43.52 ms. Allocated memory is still 109.1 MB. Free memory was 75.7 MB in the beginning and 73.9 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:43:27,856 INFO L168 Benchmark]: RCFGBuilder took 1013.00 ms. Allocated memory is still 109.1 MB. Free memory was 73.6 MB in the beginning and 47.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:43:27,858 INFO L168 Benchmark]: TraceAbstraction took 5028.84 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 47.1 MB in the beginning and 81.8 MB in the end (delta: -34.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:43:27,858 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 132.1 MB. Free memory was 81.8 MB in the beginning and 80.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:43:27,862 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.31 ms. Allocated memory is still 81.8 MB. Free memory was 61.3 MB in the beginning and 61.3 MB in the end (delta: 39.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 605.00 ms. Allocated memory was 81.8 MB in the beginning and 109.1 MB in the end (delta: 27.3 MB). Free memory was 43.3 MB in the beginning and 77.7 MB in the end (delta: -34.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.53 ms. Allocated memory is still 109.1 MB. Free memory was 77.7 MB in the beginning and 75.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.52 ms. Allocated memory is still 109.1 MB. Free memory was 75.7 MB in the beginning and 73.9 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 1013.00 ms. Allocated memory is still 109.1 MB. Free memory was 73.6 MB in the beginning and 47.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5028.84 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 47.1 MB in the beginning and 81.8 MB in the end (delta: -34.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 4.81 ms. Allocated memory is still 132.1 MB. Free memory was 81.8 MB in the beginning and 80.7 MB in the end (delta: 1.1 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 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list [L1040] COND FALSE !(!(((void*)0) != end)) [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] reach_error() - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 817 SDtfs, 1011 SDslu, 1036 SDs, 0 SdLazy, 1956 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-29 04:43:27,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:43:30,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:43:30,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:43:30,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:43:30,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:43:30,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:43:30,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:43:30,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:43:30,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:43:30,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:43:30,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:43:30,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:43:30,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:43:30,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:43:30,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:43:30,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:43:30,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:43:30,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:43:30,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:43:31,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:43:31,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:43:31,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:43:31,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:43:31,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:43:31,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:43:31,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:43:31,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:43:31,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:43:31,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:43:31,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:43:31,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:43:31,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:43:31,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:43:31,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:43:31,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:43:31,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:43:31,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:43:31,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:43:31,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:43:31,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:43:31,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:43:31,072 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-29 04:43:31,129 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:43:31,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:43:31,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:43:31,132 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:43:31,132 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:43:31,132 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:43:31,133 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:43:31,133 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:43:31,133 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:43:31,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 04:43:31,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 04:43:31,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:43:31,138 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:43:31,138 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 04:43:31,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:43:31,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:43:31,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:43:31,139 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 04:43:31,139 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 04:43:31,140 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-29 04:43:31,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:43:31,140 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:43:31,140 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-29 04:43:31,141 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-29 04:43:31,141 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:43:31,141 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:43:31,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:43:31,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-29 04:43:31,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:43:31,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:43:31,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:43:31,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:43:31,143 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-29 04:43:31,144 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-29 04:43:31,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:43:31,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:43:31,144 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/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_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2021-10-29 04:43:31,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:43:31,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:43:31,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:43:31,636 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:43:31,637 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:43:31,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-29 04:43:31,729 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/01af6549c/c104e799ae8c4a42b0ddc44586a71598/FLAGdc746695c [2021-10-29 04:43:32,511 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:43:32,512 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-29 04:43:32,529 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/01af6549c/c104e799ae8c4a42b0ddc44586a71598/FLAGdc746695c [2021-10-29 04:43:32,727 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/data/01af6549c/c104e799ae8c4a42b0ddc44586a71598 [2021-10-29 04:43:32,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:43:32,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:43:32,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:43:32,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:43:32,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:43:32,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:43:32" (1/1) ... [2021-10-29 04:43:32,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fa351c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:32, skipping insertion in model container [2021-10-29 04:43:32,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:43:32" (1/1) ... [2021-10-29 04:43:32,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:43:32,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:43:33,235 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-29 04:43:33,241 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-29 04:43:33,253 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-29 04:43:33,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:43:33,302 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:43:33,375 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-29 04:43:33,380 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-29 04:43:33,384 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_4b765a97-69f8-433b-8e98-4511a772639f/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-29 04:43:33,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:43:33,437 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:43:33,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33 WrapperNode [2021-10-29 04:43:33,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:43:33,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:43:33,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:43:33,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:43:33,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:43:33,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:43:33,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:43:33,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:43:33,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:43:33,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:43:33,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:43:33,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:43:33,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (1/1) ... [2021-10-29 04:43:33,565 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:43:33,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:43:33,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:43:33,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:43:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-29 04:43:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-29 04:43:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-29 04:43:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:43:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-29 04:43:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 04:43:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-29 04:43:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-29 04:43:33,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:43:33,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:43:34,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:43:34,614 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-10-29 04:43:34,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:34 BoogieIcfgContainer [2021-10-29 04:43:34,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:43:34,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:43:34,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:43:34,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:43:34,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:43:32" (1/3) ... [2021-10-29 04:43:34,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd11ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:43:34, skipping insertion in model container [2021-10-29 04:43:34,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:43:33" (2/3) ... [2021-10-29 04:43:34,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdd11ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:43:34, skipping insertion in model container [2021-10-29 04:43:34,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:34" (3/3) ... [2021-10-29 04:43:34,627 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-10-29 04:43:34,633 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:43:34,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-10-29 04:43:34,710 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:43:34,721 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-10-29 04:43:34,721 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-10-29 04:43:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 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-10-29 04:43:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-29 04:43:34,774 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:34,776 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-29 04:43:34,777 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-29 04:43:34,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:43:34,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994970538] [2021-10-29 04:43:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:34,803 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:43:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:43:34,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:43:34,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-29 04:43:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:34,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 04:43:34,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:43:35,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:43:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:35,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:43:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:35,083 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:43:35,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994970538] [2021-10-29 04:43:35,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994970538] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:35,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:35,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-29 04:43:35,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375982775] [2021-10-29 04:43:35,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:43:35,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:43:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:43:35,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:43:35,124 INFO L87 Difference]: Start difference. First operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-29 04:43:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:35,605 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-10-29 04:43:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:43:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) Word has length 3 [2021-10-29 04:43:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:35,620 INFO L225 Difference]: With dead ends: 137 [2021-10-29 04:43:35,620 INFO L226 Difference]: Without dead ends: 133 [2021-10-29 04:43:35,622 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-29 04:43:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-29 04:43:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2021-10-29 04:43:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 states have internal predecessors, (136), 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-10-29 04:43:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2021-10-29 04:43:35,673 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 3 [2021-10-29 04:43:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:35,674 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2021-10-29 04:43:35,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-29 04:43:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2021-10-29 04:43:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-29 04:43:35,675 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:35,675 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-29 04:43:35,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-29 04:43:35,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:43:35,889 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-29 04:43:35,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:43:35,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214460298] [2021-10-29 04:43:35,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:35,891 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:43:35,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:43:35,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:43:35,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-29 04:43:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:35,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-29 04:43:35,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:43:35,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:43:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:36,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:43:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:36,082 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:43:36,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214460298] [2021-10-29 04:43:36,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214460298] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:36,083 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:36,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-29 04:43:36,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272065204] [2021-10-29 04:43:36,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:36,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:43:36,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:36,087 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-10-29 04:43:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:36,574 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2021-10-29 04:43:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:43:36,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) Word has length 3 [2021-10-29 04:43:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:36,578 INFO L225 Difference]: With dead ends: 146 [2021-10-29 04:43:36,579 INFO L226 Difference]: Without dead ends: 146 [2021-10-29 04:43:36,579 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-29 04:43:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2021-10-29 04:43:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.794871794871795) internal successors, (140), 132 states have internal predecessors, (140), 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-10-29 04:43:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2021-10-29 04:43:36,604 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 3 [2021-10-29 04:43:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:36,605 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2021-10-29 04:43:36,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-10-29 04:43:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2021-10-29 04:43:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 04:43:36,607 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:36,608 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:36,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-29 04:43:36,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:43:36,824 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2021-10-29 04:43:36,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:43:36,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663943186] [2021-10-29 04:43:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:36,827 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:43:36,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:43:36,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:43:36,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-29 04:43:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:36,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-29 04:43:36,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:43:36,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:43:37,032 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-29 04:43:37,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2021-10-29 04:43:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:37,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:43:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:37,131 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:43:37,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663943186] [2021-10-29 04:43:37,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663943186] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:37,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:37,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-29 04:43:37,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418789045] [2021-10-29 04:43:37,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:43:37,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:43:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:43:37,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:43:37,135 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10-29 04:43:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:37,700 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2021-10-29 04:43:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:43:37,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2021-10-29 04:43:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:37,702 INFO L225 Difference]: With dead ends: 138 [2021-10-29 04:43:37,703 INFO L226 Difference]: Without dead ends: 138 [2021-10-29 04:43:37,703 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:43:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-10-29 04:43:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2021-10-29 04:43:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 122 states have internal predecessors, (133), 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-10-29 04:43:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-10-29 04:43:37,714 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 8 [2021-10-29 04:43:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:37,715 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-10-29 04:43:37,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10-29 04:43:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-10-29 04:43:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 04:43:37,716 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:37,716 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:43:37,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-29 04:43:37,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:43:37,930 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:43:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:43:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2021-10-29 04:43:37,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:43:37,932 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923505104] [2021-10-29 04:43:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:43:37,941 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:43:37,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:43:37,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:43:37,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-29 04:43:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:43:38,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 04:43:38,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:43:38,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:43:38,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:43:38,295 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-29 04:43:38,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2021-10-29 04:43:38,316 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-29 04:43:38,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2021-10-29 04:43:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:38,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:43:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:43:41,616 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:43:41,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923505104] [2021-10-29 04:43:41,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923505104] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:43:41,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:43:41,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-29 04:43:41,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934581895] [2021-10-29 04:43:41,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:43:41,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:43:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:43:41,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-10-29 04:43:41,619 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-10-29 04:43:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:43:59,974 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2021-10-29 04:43:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 04:43:59,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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) Word has length 8 [2021-10-29 04:43:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:43:59,977 INFO L225 Difference]: With dead ends: 173 [2021-10-29 04:43:59,978 INFO L226 Difference]: Without dead ends: 173 [2021-10-29 04:43:59,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=68, Invalid=112, Unknown=2, NotChecked=0, Total=182 [2021-10-29 04:43:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-29 04:43:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2021-10-29 04:43:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 117 states have internal predecessors, (128), 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-10-29 04:43:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-10-29 04:43:59,994 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 8 [2021-10-29 04:43:59,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:43:59,995 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-10-29 04:43:59,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-10-29 04:43:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-10-29 04:43:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 04:43:59,996 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:43:59,996 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:00,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-29 04:44:00,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:44:00,212 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:44:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1116012804, now seen corresponding path program 1 times [2021-10-29 04:44:00,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:44:00,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47911416] [2021-10-29 04:44:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:00,214 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:44:00,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:44:00,216 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:44:00,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-29 04:44:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:00,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-29 04:44:00,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:44:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:00,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:44:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:00,468 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:44:00,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47911416] [2021-10-29 04:44:00,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47911416] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:00,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:00,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-29 04:44:00,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467995409] [2021-10-29 04:44:00,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:44:00,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:44:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:44:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:44:00,471 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-29 04:44:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:00,973 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-10-29 04:44:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:44:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2021-10-29 04:44:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:00,976 INFO L225 Difference]: With dead ends: 144 [2021-10-29 04:44:00,976 INFO L226 Difference]: Without dead ends: 144 [2021-10-29 04:44:00,976 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-10-29 04:44:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-29 04:44:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2021-10-29 04:44:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 115 states have internal predecessors, (124), 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-10-29 04:44:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-10-29 04:44:00,985 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 10 [2021-10-29 04:44:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:00,986 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-10-29 04:44:00,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-29 04:44:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-10-29 04:44:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:44:00,987 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:00,987 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:01,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-29 04:44:01,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:44:01,204 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:44:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:01,204 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-10-29 04:44:01,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:44:01,205 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796890606] [2021-10-29 04:44:01,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:01,205 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:44:01,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:44:01,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:44:01,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-29 04:44:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:01,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-29 04:44:01,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:44:01,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:44:01,401 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 20 treesize of output 16 [2021-10-29 04:44:01,449 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 21 treesize of output 13 [2021-10-29 04:44:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:01,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:44:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:01,551 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:44:01,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796890606] [2021-10-29 04:44:01,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796890606] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:01,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:01,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-29 04:44:01,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547634969] [2021-10-29 04:44:01,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:44:01,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:44:01,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:44:01,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:01,554 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-10-29 04:44:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:02,225 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-10-29 04:44:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:44:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2021-10-29 04:44:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:02,227 INFO L225 Difference]: With dead ends: 115 [2021-10-29 04:44:02,227 INFO L226 Difference]: Without dead ends: 115 [2021-10-29 04:44:02,227 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:44:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-29 04:44:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-10-29 04:44:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 114 states have internal predecessors, (123), 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-10-29 04:44:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-10-29 04:44:02,234 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 11 [2021-10-29 04:44:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:02,235 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-10-29 04:44:02,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-10-29 04:44:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-10-29 04:44:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:44:02,236 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:02,236 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:02,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-10-29 04:44:02,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:44:02,453 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:44:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-10-29 04:44:02,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:44:02,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306120210] [2021-10-29 04:44:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:02,460 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:44:02,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:44:02,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:44:02,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-29 04:44:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:02,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-29 04:44:02,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:44:02,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:44:02,649 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 17 treesize of output 13 [2021-10-29 04:44:02,661 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 11 treesize of output 7 [2021-10-29 04:44:02,743 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 31 treesize of output 23 [2021-10-29 04:44:02,754 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 20 treesize of output 12 [2021-10-29 04:44:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:02,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:44:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:03,106 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:44:03,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306120210] [2021-10-29 04:44:03,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306120210] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:03,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:03,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-29 04:44:03,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350417959] [2021-10-29 04:44:03,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:44:03,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:44:03,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:44:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-29 04:44:03,108 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-10-29 04:44:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:04,400 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-10-29 04:44:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 04:44:04,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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) Word has length 11 [2021-10-29 04:44:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:04,402 INFO L225 Difference]: With dead ends: 114 [2021-10-29 04:44:04,403 INFO L226 Difference]: Without dead ends: 114 [2021-10-29 04:44:04,403 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-10-29 04:44:04,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-29 04:44:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-10-29 04:44:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 113 states have internal predecessors, (122), 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-10-29 04:44:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-10-29 04:44:04,414 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 11 [2021-10-29 04:44:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:04,415 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-10-29 04:44:04,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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-10-29 04:44:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-10-29 04:44:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:44:04,416 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:04,416 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:04,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-29 04:44:04,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:44:04,633 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:44:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash -200394276, now seen corresponding path program 1 times [2021-10-29 04:44:04,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:44:04,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077293291] [2021-10-29 04:44:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:04,634 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:44:04,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:44:04,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:44:04,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-29 04:44:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:04,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-29 04:44:04,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:44:04,751 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 13 treesize of output 9 [2021-10-29 04:44:04,852 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 19 treesize of output 7 [2021-10-29 04:44:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:04,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:44:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:04,945 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:44:04,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077293291] [2021-10-29 04:44:04,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077293291] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:04,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:04,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-29 04:44:04,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986213816] [2021-10-29 04:44:04,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:44:04,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:44:04,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:44:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:04,948 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-29 04:44:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:05,609 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2021-10-29 04:44:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:44:05,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 13 [2021-10-29 04:44:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:05,611 INFO L225 Difference]: With dead ends: 175 [2021-10-29 04:44:05,611 INFO L226 Difference]: Without dead ends: 175 [2021-10-29 04:44:05,612 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:44:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-10-29 04:44:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 120. [2021-10-29 04:44:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 89 states have (on average 1.449438202247191) internal successors, (129), 119 states have internal predecessors, (129), 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-10-29 04:44:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-10-29 04:44:05,618 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 13 [2021-10-29 04:44:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:05,618 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-10-29 04:44:05,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-10-29 04:44:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-10-29 04:44:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 04:44:05,620 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:05,620 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:05,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-29 04:44:05,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:44:05,822 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:44:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-10-29 04:44:05,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:44:05,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597410325] [2021-10-29 04:44:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:05,823 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:44:05,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:44:05,825 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:44:05,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-29 04:44:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:05,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-29 04:44:05,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:44:05,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:44:06,091 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-29 04:44:06,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-10-29 04:44:06,201 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 24 treesize of output 20 [2021-10-29 04:44:06,483 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-29 04:44:06,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2021-10-29 04:44:06,692 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-29 04:44:06,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 38 [2021-10-29 04:44:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:06,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:44:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:11,229 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:44:11,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597410325] [2021-10-29 04:44:11,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597410325] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:11,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:11,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2021-10-29 04:44:11,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189623177] [2021-10-29 04:44:11,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-29 04:44:11,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:44:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-29 04:44:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-29 04:44:11,231 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-10-29 04:44:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:13,871 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2021-10-29 04:44:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 04:44:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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) Word has length 15 [2021-10-29 04:44:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:13,872 INFO L225 Difference]: With dead ends: 141 [2021-10-29 04:44:13,873 INFO L226 Difference]: Without dead ends: 141 [2021-10-29 04:44:13,873 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-10-29 04:44:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-29 04:44:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2021-10-29 04:44:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 118 states have internal predecessors, (128), 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-10-29 04:44:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2021-10-29 04:44:13,878 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 15 [2021-10-29 04:44:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:13,878 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2021-10-29 04:44:13,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 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-10-29 04:44:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2021-10-29 04:44:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 04:44:13,879 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:13,880 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:13,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-29 04:44:14,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:44:14,080 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:44:14,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-10-29 04:44:14,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:44:14,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738560024] [2021-10-29 04:44:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:14,082 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:44:14,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:44:14,083 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:44:14,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-29 04:44:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:14,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-29 04:44:14,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:44:14,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:44:14,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-10-29 04:44:14,381 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-29 04:44:14,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-10-29 04:44:14,440 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 21 treesize of output 17 [2021-10-29 04:44:14,456 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 11 treesize of output 7 [2021-10-29 04:44:14,665 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-29 04:44:14,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 49 [2021-10-29 04:44:14,698 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-29 04:44:14,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-10-29 04:44:14,880 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-29 04:44:14,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2021-10-29 04:44:14,891 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-29 04:44:14,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2021-10-29 04:44:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:14,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:44:32,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-29 04:44:32,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-29 04:44:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:33,023 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:44:33,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738560024] [2021-10-29 04:44:33,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738560024] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:33,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:33,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-10-29 04:44:33,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666144433] [2021-10-29 04:44:33,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-29 04:44:33,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:44:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-29 04:44:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=194, Unknown=3, NotChecked=0, Total=240 [2021-10-29 04:44:33,026 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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-10-29 04:44:52,504 WARN L207 SmtUtils]: Spent 5.81 s on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2021-10-29 04:45:01,461 WARN L207 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2021-10-29 04:45:03,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (and (= c_ULTIMATE.start_main_~end~0.offset (_ bv0 32)) (= (select |c_#length| c_ULTIMATE.start_main_~end~0.base) (_ bv12 32)) (= (select |c_#length| .cse0) (_ bv12 32)) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) .cse1 c_ULTIMATE.start_main_~end~0.offset)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) .cse1 c_ULTIMATE.start_main_~end~0.base)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))) (not (= .cse0 c_ULTIMATE.start_main_~end~0.base)) (exists ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (.cse3 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (and (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) c_ULTIMATE.start_main_~end~0.base) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) c_ULTIMATE.start_main_~end~0.offset)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~end~0.base))) (_ bv1 1))) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~end~0.offset)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list~0.base))) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset) (_ bv0 32)))) is different from false [2021-10-29 04:45:11,879 WARN L207 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2021-10-29 04:45:18,405 WARN L207 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2021-10-29 04:45:20,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (and (= c_ULTIMATE.start_main_~end~0.offset (_ bv0 32)) (= (select |c_#length| c_ULTIMATE.start_main_~end~0.base) (_ bv12 32)) (= (select |c_#length| .cse0) (_ bv12 32)) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) .cse1 c_ULTIMATE.start_main_~end~0.offset)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6.base|) .cse1 c_ULTIMATE.start_main_~end~0.base)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))) (not (= .cse0 c_ULTIMATE.start_main_~end~0.base)) (exists ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (.cse3 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (and (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) c_ULTIMATE.start_main_~end~0.base) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) c_ULTIMATE.start_main_~end~0.offset)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~end~0.base))) (_ bv1 1))) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~end~0.offset)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset) (_ bv0 32)))) is different from false [2021-10-29 04:45:45,168 WARN L207 SmtUtils]: Spent 8.42 s on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2021-10-29 04:45:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:45:45,184 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2021-10-29 04:45:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-29 04:45:45,185 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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) Word has length 15 [2021-10-29 04:45:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:45:45,186 INFO L225 Difference]: With dead ends: 214 [2021-10-29 04:45:45,186 INFO L226 Difference]: Without dead ends: 214 [2021-10-29 04:45:45,188 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 86.9s TimeCoverageRelationStatistics Valid=503, Invalid=1750, Unknown=11, NotChecked=186, Total=2450 [2021-10-29 04:45:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-29 04:45:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 116. [2021-10-29 04:45:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.404494382022472) internal successors, (125), 115 states have internal predecessors, (125), 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-10-29 04:45:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2021-10-29 04:45:45,193 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 15 [2021-10-29 04:45:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:45:45,193 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2021-10-29 04:45:45,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 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-10-29 04:45:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2021-10-29 04:45:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 04:45:45,195 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:45:45,195 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:45:45,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-29 04:45:45,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:45:45,413 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:45:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:45:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -715208061, now seen corresponding path program 1 times [2021-10-29 04:45:45,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:45:45,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650375310] [2021-10-29 04:45:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:45:45,414 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:45:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:45:45,415 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:45:45,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-29 04:45:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:45:45,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-29 04:45:45,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:45:45,557 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 13 treesize of output 9 [2021-10-29 04:45:45,662 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 19 treesize of output 7 [2021-10-29 04:45:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:45:45,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:45:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:45:45,881 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:45:45,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650375310] [2021-10-29 04:45:45,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650375310] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:45:45,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:45:45,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-10-29 04:45:45,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617685368] [2021-10-29 04:45:45,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:45:45,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:45:45,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:45:45,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-29 04:45:45,883 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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-10-29 04:45:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:45:46,863 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2021-10-29 04:45:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:45:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) Word has length 19 [2021-10-29 04:45:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:45:46,865 INFO L225 Difference]: With dead ends: 169 [2021-10-29 04:45:46,865 INFO L226 Difference]: Without dead ends: 169 [2021-10-29 04:45:46,865 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:45:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-10-29 04:45:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 120. [2021-10-29 04:45:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 119 states have internal predecessors, (129), 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-10-29 04:45:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-10-29 04:45:46,871 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 19 [2021-10-29 04:45:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:45:46,871 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-10-29 04:45:46,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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-10-29 04:45:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-10-29 04:45:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 04:45:46,873 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:45:46,873 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:45:46,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-29 04:45:47,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:45:47,082 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2021-10-29 04:45:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:45:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -714897179, now seen corresponding path program 1 times [2021-10-29 04:45:47,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:45:47,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715462090] [2021-10-29 04:45:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:45:47,083 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:45:47,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:45:47,083 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:45:47,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-29 04:45:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:45:47,235 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:45:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:45:47,342 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-29 04:45:47,343 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 04:45:47,344 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:45:47,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-29 04:45:47,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-29 04:45:47,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-29 04:45:47,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-29 04:45:47,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-29 04:45:47,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-29 04:45:47,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-29 04:45:47,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-29 04:45:47,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-29 04:45:47,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-29 04:45:47,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-29 04:45:47,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-29 04:45:47,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-29 04:45:47,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-29 04:45:47,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-29 04:45:47,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-29 04:45:47,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-29 04:45:47,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-29 04:45:47,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-29 04:45:47,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-29 04:45:47,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-29 04:45:47,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-29 04:45:47,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-29 04:45:47,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-29 04:45:47,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-29 04:45:47,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-29 04:45:47,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-29 04:45:47,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-29 04:45:47,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-29 04:45:47,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-29 04:45:47,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-29 04:45:47,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-29 04:45:47,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:45:47,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-29 04:45:47,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-29 04:45:47,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:45:47,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-29 04:45:47,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-29 04:45:47,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-29 04:45:47,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-29 04:45:47,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-29 04:45:47,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-29 04:45:47,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-29 04:45:47,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-29 04:45:47,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-29 04:45:47,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-29 04:45:47,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-29 04:45:47,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-29 04:45:47,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-29 04:45:47,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-29 04:45:47,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,363 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-29 04:45:47,364 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-29 04:45:47,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-29 04:45:47,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-29 04:45:47,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:45:47,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:45:47,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-29 04:45:47,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:45:47,572 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:45:47,574 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:45:47,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:45:47 BoogieIcfgContainer [2021-10-29 04:45:47,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:45:47,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:45:47,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:45:47,609 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:45:47,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:43:34" (3/4) ... [2021-10-29 04:45:47,613 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-29 04:45:47,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:45:47,614 INFO L168 Benchmark]: Toolchain (without parser) took 134882.80 ms. Allocated memory was 65.0 MB in the beginning and 107.0 MB in the end (delta: 41.9 MB). Free memory was 43.4 MB in the beginning and 85.2 MB in the end (delta: -41.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:45:47,614 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 65.0 MB. Free memory is still 44.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:45:47,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.92 ms. Allocated memory is still 65.0 MB. Free memory was 43.3 MB in the beginning and 40.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 04:45:47,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.25 ms. Allocated memory is still 65.0 MB. Free memory was 40.2 MB in the beginning and 37.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:45:47,616 INFO L168 Benchmark]: Boogie Preprocessor took 45.86 ms. Allocated memory is still 65.0 MB. Free memory was 37.9 MB in the beginning and 36.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:45:47,616 INFO L168 Benchmark]: RCFGBuilder took 1061.51 ms. Allocated memory is still 65.0 MB. Free memory was 36.0 MB in the beginning and 35.2 MB in the end (delta: 827.8 kB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-29 04:45:47,617 INFO L168 Benchmark]: TraceAbstraction took 132988.82 ms. Allocated memory was 65.0 MB in the beginning and 107.0 MB in the end (delta: 41.9 MB). Free memory was 34.6 MB in the beginning and 85.2 MB in the end (delta: -50.6 MB). Peak memory consumption was 50.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:45:47,617 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 107.0 MB. Free memory is still 85.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:45:47,619 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.30 ms. Allocated memory is still 65.0 MB. Free memory is still 44.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 705.92 ms. Allocated memory is still 65.0 MB. Free memory was 43.3 MB in the beginning and 40.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.25 ms. Allocated memory is still 65.0 MB. Free memory was 40.2 MB in the beginning and 37.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.86 ms. Allocated memory is still 65.0 MB. Free memory was 37.9 MB in the beginning and 36.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1061.51 ms. Allocated memory is still 65.0 MB. Free memory was 36.0 MB in the beginning and 35.2 MB in the end (delta: 827.8 kB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 132988.82 ms. Allocated memory was 65.0 MB in the beginning and 107.0 MB in the end (delta: 41.9 MB). Free memory was 34.6 MB in the beginning and 85.2 MB in the end (delta: -50.6 MB). Peak memory consumption was 50.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.74 ms. Allocated memory is still 107.0 MB. Free memory is still 85.2 MB. There was no memory consumed. 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 - UnprovableResult [Line: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list [L1040] COND FALSE !(!(((void*)0) != end)) [L1041] EXPR end->colour [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next [L1051] COND TRUE !(end->next) [L1051] reach_error() - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1052]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1067]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 136 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 132.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 98.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 776 SDtfs, 1626 SDslu, 1508 SDs, 0 SdLazy, 2458 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 117 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 111.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=0, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 339 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 20 QuantifiedInterpolants, 2245 SizeOfPredicates, 50 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-29 04:45:47,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b765a97-69f8-433b-8e98-4511a772639f/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...