./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE --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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE --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-e943c26 [2021-10-24 10:26:15,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 10:26:15,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 10:26:15,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 10:26:15,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 10:26:15,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 10:26:15,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 10:26:15,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 10:26:15,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 10:26:15,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 10:26:15,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 10:26:15,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 10:26:15,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 10:26:15,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 10:26:15,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 10:26:15,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 10:26:15,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 10:26:15,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 10:26:15,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 10:26:15,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 10:26:15,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 10:26:15,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 10:26:15,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 10:26:15,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 10:26:15,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 10:26:15,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 10:26:15,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 10:26:15,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 10:26:15,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 10:26:15,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 10:26:15,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 10:26:15,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 10:26:15,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 10:26:15,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 10:26:15,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 10:26:15,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 10:26:15,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 10:26:15,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 10:26:15,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 10:26:15,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 10:26:15,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 10:26:15,612 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-24 10:26:15,638 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 10:26:15,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 10:26:15,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 10:26:15,646 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 10:26:15,647 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 10:26:15,653 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 10:26:15,653 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 10:26:15,653 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 10:26:15,653 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 10:26:15,653 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 10:26:15,654 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 10:26:15,655 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 10:26:15,655 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 10:26:15,655 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 10:26:15,655 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 10:26:15,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-24 10:26:15,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-24 10:26:15,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 10:26:15,657 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 10:26:15,657 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-24 10:26:15,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 10:26:15,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 10:26:15,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 10:26:15,658 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-24 10:26:15,658 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-24 10:26:15,658 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-24 10:26:15,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 10:26:15,659 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 10:26:15,659 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 10:26:15,659 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 10:26:15,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 10:26:15,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 10:26:15,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:26:15,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 10:26:15,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 10:26:15,660 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 10:26:15,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 10:26:15,661 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 10:26:15,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 10:26:15,661 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE 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-24 10:26:15,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 10:26:15,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 10:26:15,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 10:26:15,988 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 10:26:15,989 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 10:26:15,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-24 10:26:16,070 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/b5b3c6534/9df1d12a4bf048daa1592b4bcdd7227a/FLAG961140222 [2021-10-24 10:26:16,647 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 10:26:16,647 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-24 10:26:16,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/b5b3c6534/9df1d12a4bf048daa1592b4bcdd7227a/FLAG961140222 [2021-10-24 10:26:16,905 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/b5b3c6534/9df1d12a4bf048daa1592b4bcdd7227a [2021-10-24 10:26:16,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 10:26:16,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 10:26:16,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 10:26:16,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 10:26:16,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 10:26:16,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:16" (1/1) ... [2021-10-24 10:26:16,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77add157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:16, skipping insertion in model container [2021-10-24 10:26:16,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:16" (1/1) ... [2021-10-24 10:26:16,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 10:26:16,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 10:26:17,357 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-24 10:26:17,360 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-24 10:26:17,362 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-24 10:26:17,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:26:17,375 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 10:26:17,414 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-24 10:26:17,417 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-24 10:26:17,418 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-24 10:26:17,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:26:17,462 INFO L208 MainTranslator]: Completed translation [2021-10-24 10:26:17,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17 WrapperNode [2021-10-24 10:26:17,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 10:26:17,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 10:26:17,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 10:26:17,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 10:26:17,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 10:26:17,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 10:26:17,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 10:26:17,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 10:26:17,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 10:26:17,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 10:26:17,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 10:26:17,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 10:26:17,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (1/1) ... [2021-10-24 10:26:17,602 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:26:17,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:26:17,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 10:26:17,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 10:26:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-24 10:26:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-24 10:26:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-24 10:26:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-24 10:26:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 10:26:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-24 10:26:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-24 10:26:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-24 10:26:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 10:26:17,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 10:26:18,528 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 10:26:18,530 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-10-24 10:26:18,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:18 BoogieIcfgContainer [2021-10-24 10:26:18,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 10:26:18,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 10:26:18,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 10:26:18,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 10:26:18,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:26:16" (1/3) ... [2021-10-24 10:26:18,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414aeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:18, skipping insertion in model container [2021-10-24 10:26:18,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:17" (2/3) ... [2021-10-24 10:26:18,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414aeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:18, skipping insertion in model container [2021-10-24 10:26:18,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:18" (3/3) ... [2021-10-24 10:26:18,547 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-10-24 10:26:18,553 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 10:26:18,554 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-10-24 10:26:18,612 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 10:26:18,622 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-24 10:26:18,622 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-10-24 10:26:18,644 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-24 10:26:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-24 10:26:18,652 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:18,653 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-24 10:26:18,653 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-24 10:26:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash 8095, now seen corresponding path program 1 times [2021-10-24 10:26:18,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:18,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747046496] [2021-10-24 10:26:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:18,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:18,851 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-24 10:26:18,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:18,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747046496] [2021-10-24 10:26:18,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747046496] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:18,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:18,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:26:18,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626849523] [2021-10-24 10:26:18,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:26:18,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:26:18,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:26:18,892 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-24 10:26:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:19,089 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2021-10-24 10:26:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:26:19,091 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-24 10:26:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:19,106 INFO L225 Difference]: With dead ends: 119 [2021-10-24 10:26:19,106 INFO L226 Difference]: Without dead ends: 117 [2021-10-24 10:26:19,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:26:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-10-24 10:26:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2021-10-24 10:26:19,181 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-24 10:26:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2021-10-24 10:26:19,185 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 2 [2021-10-24 10:26:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:19,186 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2021-10-24 10:26:19,186 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-24 10:26:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2021-10-24 10:26:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-24 10:26:19,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:19,187 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-24 10:26:19,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 10:26:19,188 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-24 10:26:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash 8096, now seen corresponding path program 1 times [2021-10-24 10:26:19,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:19,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379729045] [2021-10-24 10:26:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:19,190 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:19,240 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-24 10:26:19,241 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:19,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379729045] [2021-10-24 10:26:19,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379729045] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:19,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:19,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:26:19,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522179557] [2021-10-24 10:26:19,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:26:19,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:19,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:26:19,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:26:19,247 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-24 10:26:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:19,401 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2021-10-24 10:26:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:26:19,402 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-24 10:26:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:19,406 INFO L225 Difference]: With dead ends: 127 [2021-10-24 10:26:19,406 INFO L226 Difference]: Without dead ends: 127 [2021-10-24 10:26:19,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:26:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-10-24 10:26:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2021-10-24 10:26:19,420 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-24 10:26:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2021-10-24 10:26:19,425 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2021-10-24 10:26:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:19,426 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2021-10-24 10:26:19,429 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-24 10:26:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2021-10-24 10:26:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-24 10:26:19,430 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:19,430 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:19,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 10:26:19,431 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-24 10:26:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash -191356527, now seen corresponding path program 1 times [2021-10-24 10:26:19,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:19,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424407743] [2021-10-24 10:26:19,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:19,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:19,562 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-24 10:26:19,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:19,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424407743] [2021-10-24 10:26:19,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424407743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:19,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:19,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:26:19,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513843163] [2021-10-24 10:26:19,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:26:19,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:19,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:26:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:26:19,568 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-24 10:26:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:19,789 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2021-10-24 10:26:19,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:26:19,789 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-24 10:26:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:19,794 INFO L225 Difference]: With dead ends: 117 [2021-10-24 10:26:19,795 INFO L226 Difference]: Without dead ends: 117 [2021-10-24 10:26:19,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-10-24 10:26:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2021-10-24 10:26:19,805 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-24 10:26:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-10-24 10:26:19,806 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 7 [2021-10-24 10:26:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:19,806 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-10-24 10:26:19,806 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-24 10:26:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-10-24 10:26:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-24 10:26:19,807 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:19,807 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:19,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 10:26:19,808 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-24 10:26:19,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:19,808 INFO L82 PathProgramCache]: Analyzing trace with hash -191356526, now seen corresponding path program 1 times [2021-10-24 10:26:19,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:19,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723039042] [2021-10-24 10:26:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:19,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:19,906 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-24 10:26:19,907 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:19,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723039042] [2021-10-24 10:26:19,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723039042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:19,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:19,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:26:19,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613112785] [2021-10-24 10:26:19,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:26:19,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:26:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:26:19,910 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-24 10:26:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:20,141 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2021-10-24 10:26:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:26:20,142 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-24 10:26:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:20,143 INFO L225 Difference]: With dead ends: 140 [2021-10-24 10:26:20,143 INFO L226 Difference]: Without dead ends: 140 [2021-10-24 10:26:20,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-10-24 10:26:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2021-10-24 10:26:20,147 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-24 10:26:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2021-10-24 10:26:20,148 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 7 [2021-10-24 10:26:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:20,149 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2021-10-24 10:26:20,149 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-24 10:26:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2021-10-24 10:26:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 10:26:20,150 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:20,150 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:20,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 10:26:20,150 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-24 10:26:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash 789967275, now seen corresponding path program 1 times [2021-10-24 10:26:20,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:20,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812307625] [2021-10-24 10:26:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:20,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:20,219 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-24 10:26:20,219 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:20,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812307625] [2021-10-24 10:26:20,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812307625] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:20,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:20,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-24 10:26:20,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444012720] [2021-10-24 10:26:20,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:26:20,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:26:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:26:20,222 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-24 10:26:20,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:20,355 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-10-24 10:26:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:26:20,356 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-24 10:26:20,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:20,357 INFO L225 Difference]: With dead ends: 129 [2021-10-24 10:26:20,357 INFO L226 Difference]: Without dead ends: 129 [2021-10-24 10:26:20,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-10-24 10:26:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2021-10-24 10:26:20,364 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-24 10:26:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2021-10-24 10:26:20,365 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 9 [2021-10-24 10:26:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:20,365 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2021-10-24 10:26:20,366 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-24 10:26:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2021-10-24 10:26:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 10:26:20,366 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:20,366 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:20,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 10:26:20,367 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-24 10:26:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 790171077, now seen corresponding path program 1 times [2021-10-24 10:26:20,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:20,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353285951] [2021-10-24 10:26:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:20,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:20,492 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-24 10:26:20,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:20,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353285951] [2021-10-24 10:26:20,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353285951] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:20,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:20,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:26:20,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735702471] [2021-10-24 10:26:20,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:26:20,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:26:20,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:20,496 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-24 10:26:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:20,652 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2021-10-24 10:26:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:26:20,653 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-24 10:26:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:20,654 INFO L225 Difference]: With dead ends: 114 [2021-10-24 10:26:20,654 INFO L226 Difference]: Without dead ends: 114 [2021-10-24 10:26:20,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:26:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-24 10:26:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-10-24 10:26:20,669 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-24 10:26:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2021-10-24 10:26:20,670 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 9 [2021-10-24 10:26:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:20,671 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2021-10-24 10:26:20,672 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-24 10:26:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2021-10-24 10:26:20,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-24 10:26:20,672 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:20,672 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:20,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 10:26:20,676 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-24 10:26:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:20,678 INFO L82 PathProgramCache]: Analyzing trace with hash 790171076, now seen corresponding path program 1 times [2021-10-24 10:26:20,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:20,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822861028] [2021-10-24 10:26:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:20,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:20,748 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-24 10:26:20,748 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:20,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822861028] [2021-10-24 10:26:20,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822861028] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:20,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:20,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:26:20,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180991816] [2021-10-24 10:26:20,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:26:20,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:20,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:26:20,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:20,752 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-24 10:26:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:20,884 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-10-24 10:26:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:26:20,884 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-24 10:26:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:20,885 INFO L225 Difference]: With dead ends: 113 [2021-10-24 10:26:20,885 INFO L226 Difference]: Without dead ends: 113 [2021-10-24 10:26:20,886 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:26:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-24 10:26:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-10-24 10:26:20,898 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-24 10:26:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2021-10-24 10:26:20,899 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 9 [2021-10-24 10:26:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:20,900 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2021-10-24 10:26:20,900 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-24 10:26:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2021-10-24 10:26:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-24 10:26:20,901 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:20,901 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:20,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 10:26:20,901 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-24 10:26:20,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:20,902 INFO L82 PathProgramCache]: Analyzing trace with hash -854603864, now seen corresponding path program 1 times [2021-10-24 10:26:20,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:20,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25686280] [2021-10-24 10:26:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:20,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:21,039 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-24 10:26:21,039 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:21,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25686280] [2021-10-24 10:26:21,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25686280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:21,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:21,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-24 10:26:21,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028521200] [2021-10-24 10:26:21,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-24 10:26:21,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-24 10:26:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-24 10:26:21,043 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-24 10:26:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:21,284 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-10-24 10:26:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 10:26:21,285 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-24 10:26:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:21,286 INFO L225 Difference]: With dead ends: 113 [2021-10-24 10:26:21,286 INFO L226 Difference]: Without dead ends: 113 [2021-10-24 10:26:21,286 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.1ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-24 10:26:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-10-24 10:26:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-10-24 10:26:21,289 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-24 10:26:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2021-10-24 10:26:21,289 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 11 [2021-10-24 10:26:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:21,290 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2021-10-24 10:26:21,290 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-24 10:26:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2021-10-24 10:26:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-24 10:26:21,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:21,291 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:21,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-24 10:26:21,292 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-24 10:26:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash -854603863, now seen corresponding path program 1 times [2021-10-24 10:26:21,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:21,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687723086] [2021-10-24 10:26:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:21,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:21,446 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-24 10:26:21,446 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:21,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687723086] [2021-10-24 10:26:21,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687723086] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:21,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:21,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-24 10:26:21,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238178184] [2021-10-24 10:26:21,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-24 10:26:21,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-24 10:26:21,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:26:21,449 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-24 10:26:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:21,852 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2021-10-24 10:26:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-24 10:26:21,853 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-24 10:26:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:21,854 INFO L225 Difference]: With dead ends: 114 [2021-10-24 10:26:21,854 INFO L226 Difference]: Without dead ends: 114 [2021-10-24 10:26:21,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 227.7ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-24 10:26:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-24 10:26:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2021-10-24 10:26:21,859 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-24 10:26:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-10-24 10:26:21,864 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 11 [2021-10-24 10:26:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:21,865 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-10-24 10:26:21,866 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-24 10:26:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-10-24 10:26:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-24 10:26:21,867 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:21,867 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:21,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 10:26:21,867 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-24 10:26:21,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1793276823, now seen corresponding path program 1 times [2021-10-24 10:26:21,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:21,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559789165] [2021-10-24 10:26:21,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:21,869 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:21,954 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-24 10:26:21,955 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:21,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559789165] [2021-10-24 10:26:21,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559789165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:21,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:21,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:26:21,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700886461] [2021-10-24 10:26:21,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-24 10:26:21,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-24 10:26:21,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:26:21,957 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-24 10:26:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:22,143 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2021-10-24 10:26:22,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-24 10:26:22,144 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-24 10:26:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:22,145 INFO L225 Difference]: With dead ends: 161 [2021-10-24 10:26:22,145 INFO L226 Difference]: Without dead ends: 161 [2021-10-24 10:26:22,145 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-10-24 10:26:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-10-24 10:26:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2021-10-24 10:26:22,148 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-24 10:26:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2021-10-24 10:26:22,149 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 12 [2021-10-24 10:26:22,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:22,150 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2021-10-24 10:26:22,150 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-24 10:26:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2021-10-24 10:26:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-24 10:26:22,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:22,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:22,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-24 10:26:22,151 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-24 10:26:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash -50027826, now seen corresponding path program 1 times [2021-10-24 10:26:22,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:22,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275218081] [2021-10-24 10:26:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:22,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:22,198 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-24 10:26:22,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:22,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275218081] [2021-10-24 10:26:22,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275218081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:22,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:22,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:26:22,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268999793] [2021-10-24 10:26:22,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:26:22,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:22,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:26:22,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:22,200 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-24 10:26:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:22,317 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2021-10-24 10:26:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:26:22,317 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-24 10:26:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:22,318 INFO L225 Difference]: With dead ends: 112 [2021-10-24 10:26:22,319 INFO L226 Difference]: Without dead ends: 112 [2021-10-24 10:26:22,319 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:26:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-24 10:26:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-10-24 10:26:22,322 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-24 10:26:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2021-10-24 10:26:22,322 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 16 [2021-10-24 10:26:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:22,323 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2021-10-24 10:26:22,323 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-24 10:26:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2021-10-24 10:26:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-24 10:26:22,324 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:22,324 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:22,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-24 10:26:22,324 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-24 10:26:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash -50027825, now seen corresponding path program 1 times [2021-10-24 10:26:22,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:22,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914187225] [2021-10-24 10:26:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:22,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:22,397 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-24 10:26:22,397 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:22,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914187225] [2021-10-24 10:26:22,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914187225] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:22,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:22,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-24 10:26:22,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259112648] [2021-10-24 10:26:22,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:26:22,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:26:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:22,399 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-24 10:26:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:22,526 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2021-10-24 10:26:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:26:22,526 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-24 10:26:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:22,527 INFO L225 Difference]: With dead ends: 111 [2021-10-24 10:26:22,527 INFO L226 Difference]: Without dead ends: 111 [2021-10-24 10:26:22,528 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:26:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-10-24 10:26:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-10-24 10:26:22,530 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-24 10:26:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2021-10-24 10:26:22,531 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 16 [2021-10-24 10:26:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:22,531 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2021-10-24 10:26:22,531 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-24 10:26:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2021-10-24 10:26:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-24 10:26:22,532 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:22,532 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:22,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-24 10:26:22,533 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-24 10:26:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2126705211, now seen corresponding path program 1 times [2021-10-24 10:26:22,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:22,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363375758] [2021-10-24 10:26:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:22,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:22,653 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-24 10:26:22,654 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:26:22,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363375758] [2021-10-24 10:26:22,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363375758] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:22,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:22,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-24 10:26:22,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455375574] [2021-10-24 10:26:22,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:26:22,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:26:22,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:26:22,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:22,656 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-24 10:26:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:22,768 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2021-10-24 10:26:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:26:22,769 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-24 10:26:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:22,770 INFO L225 Difference]: With dead ends: 112 [2021-10-24 10:26:22,770 INFO L226 Difference]: Without dead ends: 112 [2021-10-24 10:26:22,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-24 10:26:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-10-24 10:26:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2021-10-24 10:26:22,773 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-24 10:26:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-10-24 10:26:22,774 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2021-10-24 10:26:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:22,774 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-10-24 10:26:22,774 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-24 10:26:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-10-24 10:26:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-24 10:26:22,775 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:22,775 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:22,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-24 10:26:22,775 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-24 10:26:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1503141088, now seen corresponding path program 1 times [2021-10-24 10:26:22,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:26:22,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567331431] [2021-10-24 10:26:22,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:22,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:26:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:26:22,788 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-24 10:26:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:26:22,819 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-24 10:26:22,819 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-24 10:26:22,820 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:26:22,822 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-24 10:26:22,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-24 10:26:22,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-24 10:26:22,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-24 10:26:22,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-24 10:26:22,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-24 10:26:22,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-24 10:26:22,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-24 10:26:22,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-24 10:26:22,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-24 10:26:22,824 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-24 10:26:22,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-24 10:26:22,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-24 10:26:22,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-24 10:26:22,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-24 10:26:22,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-24 10:26:22,825 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-24 10:26:22,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-24 10:26:22,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-24 10:26:22,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-24 10:26:22,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-24 10:26:22,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-24 10:26:22,826 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-24 10:26:22,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-24 10:26:22,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-24 10:26:22,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-24 10:26:22,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-24 10:26:22,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-24 10:26:22,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-24 10:26:22,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-24 10:26:22,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-24 10:26:22,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-24 10:26:22,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:26:22,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-24 10:26:22,828 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-24 10:26:22,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:26:22,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-24 10:26:22,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-24 10:26:22,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-24 10:26:22,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-24 10:26:22,829 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-24 10:26:22,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-24 10:26:22,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-24 10:26:22,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-24 10:26:22,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-24 10:26:22,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-24 10:26:22,830 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-24 10:26:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-24 10:26:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-24 10:26:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-24 10:26:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,831 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-24 10:26:22,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-24 10:26:22,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,832 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-24 10:26:22,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-24 10:26:22,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:26:22,833 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:26:22,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-24 10:26:22,840 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:26:22,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:26:22 BoogieIcfgContainer [2021-10-24 10:26:22,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:26:22,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:26:22,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:26:22,863 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:26:22,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:18" (3/4) ... [2021-10-24 10:26:22,866 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-24 10:26:22,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:26:22,867 INFO L168 Benchmark]: Toolchain (without parser) took 5958.18 ms. Allocated memory was 88.1 MB in the beginning and 125.8 MB in the end (delta: 37.7 MB). Free memory was 52.8 MB in the beginning and 55.9 MB in the end (delta: -3.1 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. [2021-10-24 10:26:22,868 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 88.1 MB. Free memory is still 42.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:26:22,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 546.82 ms. Allocated memory was 88.1 MB in the beginning and 125.8 MB in the end (delta: 37.7 MB). Free memory was 52.6 MB in the beginning and 93.8 MB in the end (delta: -41.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-24 10:26:22,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.45 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 91.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:26:22,869 INFO L168 Benchmark]: Boogie Preprocessor took 35.87 ms. Allocated memory is still 125.8 MB. Free memory was 91.8 MB in the beginning and 89.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:26:22,869 INFO L168 Benchmark]: RCFGBuilder took 950.19 ms. Allocated memory is still 125.8 MB. Free memory was 89.6 MB in the beginning and 63.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-24 10:26:22,869 INFO L168 Benchmark]: TraceAbstraction took 4324.44 ms. Allocated memory is still 125.8 MB. Free memory was 63.1 MB in the beginning and 55.9 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2021-10-24 10:26:22,870 INFO L168 Benchmark]: Witness Printer took 3.80 ms. Allocated memory is still 125.8 MB. Free memory is still 55.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:26:22,871 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.24 ms. Allocated memory is still 88.1 MB. Free memory is still 42.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 546.82 ms. Allocated memory was 88.1 MB in the beginning and 125.8 MB in the end (delta: 37.7 MB). Free memory was 52.6 MB in the beginning and 93.8 MB in the end (delta: -41.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.45 ms. Allocated memory is still 125.8 MB. Free memory was 93.8 MB in the beginning and 91.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.87 ms. Allocated memory is still 125.8 MB. Free memory was 91.8 MB in the beginning and 89.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 950.19 ms. Allocated memory is still 125.8 MB. Free memory was 89.6 MB in the beginning and 63.8 MB in the end (delta: 25.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4324.44 ms. Allocated memory is still 125.8 MB. Free memory was 63.1 MB in the beginning and 55.9 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.80 ms. Allocated memory is still 125.8 MB. Free memory is still 55.9 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: 4227.7ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 20.8ms, AutomataDifference: 2494.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 817 SDtfs, 1011 SDslu, 1036 SDs, 0 SdLazy, 1956 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1511.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 515.3ms Time, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: 156.5ms AutomataMinimizationTime, 13 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.3ms SsaConstructionTime, 282.5ms SatisfiabilityAnalysisTime, 874.5ms 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-24 10:26:22,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/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-e943c26 [2021-10-24 10:26:25,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 10:26:25,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 10:26:25,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 10:26:25,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 10:26:25,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 10:26:25,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 10:26:25,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 10:26:25,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 10:26:25,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 10:26:25,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 10:26:25,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 10:26:25,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 10:26:25,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 10:26:25,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 10:26:25,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 10:26:25,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 10:26:25,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 10:26:25,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 10:26:25,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 10:26:25,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 10:26:25,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 10:26:25,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 10:26:25,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 10:26:25,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 10:26:25,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 10:26:25,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 10:26:25,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 10:26:25,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 10:26:25,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 10:26:25,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 10:26:25,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 10:26:25,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 10:26:25,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 10:26:25,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 10:26:25,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 10:26:25,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 10:26:25,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 10:26:25,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 10:26:25,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 10:26:25,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 10:26:25,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-24 10:26:25,707 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 10:26:25,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 10:26:25,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 10:26:25,709 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 10:26:25,710 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 10:26:25,710 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 10:26:25,710 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 10:26:25,710 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 10:26:25,711 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 10:26:25,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-24 10:26:25,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-24 10:26:25,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 10:26:25,714 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 10:26:25,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-24 10:26:25,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 10:26:25,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 10:26:25,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 10:26:25,715 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-24 10:26:25,715 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-24 10:26:25,716 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-24 10:26:25,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 10:26:25,716 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 10:26:25,716 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-24 10:26:25,717 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-24 10:26:25,717 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 10:26:25,717 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 10:26:25,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 10:26:25,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-24 10:26:25,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 10:26:25,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:26:25,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 10:26:25,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 10:26:25,719 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-24 10:26:25,720 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-24 10:26:25,720 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 10:26:25,720 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 10:26:25,720 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE 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-24 10:26:26,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 10:26:26,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 10:26:26,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 10:26:26,192 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 10:26:26,192 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 10:26:26,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-24 10:26:26,277 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/89f6cde62/5fd1076380d342549e56731df924a4b6/FLAGfa8fa641c [2021-10-24 10:26:26,918 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 10:26:26,922 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2021-10-24 10:26:26,944 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/89f6cde62/5fd1076380d342549e56731df924a4b6/FLAGfa8fa641c [2021-10-24 10:26:27,173 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/data/89f6cde62/5fd1076380d342549e56731df924a4b6 [2021-10-24 10:26:27,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 10:26:27,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 10:26:27,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 10:26:27,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 10:26:27,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 10:26:27,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:27,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c4f5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27, skipping insertion in model container [2021-10-24 10:26:27,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:27,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 10:26:27,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 10:26:27,789 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-24 10:26:27,798 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-24 10:26:27,803 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-24 10:26:27,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:26:27,847 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 10:26:27,903 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2021-10-24 10:26:27,904 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2021-10-24 10:26:27,906 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_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2021-10-24 10:26:27,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:26:27,947 INFO L208 MainTranslator]: Completed translation [2021-10-24 10:26:27,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27 WrapperNode [2021-10-24 10:26:27,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 10:26:27,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 10:26:27,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 10:26:27,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 10:26:27,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:27,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 10:26:28,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 10:26:28,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 10:26:28,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 10:26:28,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 10:26:28,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 10:26:28,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 10:26:28,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 10:26:28,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (1/1) ... [2021-10-24 10:26:28,071 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:26:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:26:28,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 10:26:28,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 10:26:28,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-24 10:26:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-24 10:26:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-24 10:26:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 10:26:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-24 10:26:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-24 10:26:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-24 10:26:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-24 10:26:28,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 10:26:28,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 10:26:29,086 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 10:26:29,086 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-10-24 10:26:29,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:29 BoogieIcfgContainer [2021-10-24 10:26:29,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 10:26:29,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 10:26:29,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 10:26:29,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 10:26:29,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:26:27" (1/3) ... [2021-10-24 10:26:29,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2240a21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:29, skipping insertion in model container [2021-10-24 10:26:29,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:26:27" (2/3) ... [2021-10-24 10:26:29,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2240a21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:26:29, skipping insertion in model container [2021-10-24 10:26:29,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:29" (3/3) ... [2021-10-24 10:26:29,115 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2021-10-24 10:26:29,121 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 10:26:29,122 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2021-10-24 10:26:29,204 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 10:26:29,219 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-24 10:26:29,219 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2021-10-24 10:26:29,239 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-24 10:26:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-24 10:26:29,250 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:29,251 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-24 10:26:29,252 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-24 10:26:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-24 10:26:29,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:29,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539699165] [2021-10-24 10:26:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:29,278 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:29,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:29,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-24 10:26:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:29,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-24 10:26:29,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:29,454 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-24 10:26:29,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-24 10:26:29,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:29,513 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-24 10:26:29,514 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:29,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539699165] [2021-10-24 10:26:29,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539699165] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:29,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:29,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-24 10:26:29,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533402054] [2021-10-24 10:26:29,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:26:29,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:29,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:26:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:26:29,561 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-24 10:26:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:30,052 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-10-24 10:26:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:26:30,055 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-24 10:26:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:30,071 INFO L225 Difference]: With dead ends: 137 [2021-10-24 10:26:30,071 INFO L226 Difference]: Without dead ends: 133 [2021-10-24 10:26:30,074 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:26:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-24 10:26:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2021-10-24 10:26:30,135 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-24 10:26:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2021-10-24 10:26:30,140 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 3 [2021-10-24 10:26:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:30,141 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2021-10-24 10:26:30,141 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-24 10:26:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2021-10-24 10:26:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-24 10:26:30,142 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:30,142 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-24 10:26:30,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-24 10:26:30,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:26:30,357 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-24 10:26:30,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:30,358 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-24 10:26:30,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:30,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286571768] [2021-10-24 10:26:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:30,360 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:30,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:30,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-24 10:26:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:30,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-24 10:26:30,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:30,448 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-24 10:26:30,470 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-24 10:26:30,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:30,536 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-24 10:26:30,537 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:30,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286571768] [2021-10-24 10:26:30,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286571768] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:30,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:30,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-24 10:26:30,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901584872] [2021-10-24 10:26:30,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:26:30,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:26:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:26:30,541 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-24 10:26:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:31,002 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2021-10-24 10:26:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:26:31,005 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-24 10:26:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:31,006 INFO L225 Difference]: With dead ends: 146 [2021-10-24 10:26:31,006 INFO L226 Difference]: Without dead ends: 146 [2021-10-24 10:26:31,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:26:31,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-24 10:26:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2021-10-24 10:26:31,018 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-24 10:26:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2021-10-24 10:26:31,021 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 3 [2021-10-24 10:26:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:31,021 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2021-10-24 10:26:31,021 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-24 10:26:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2021-10-24 10:26:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-24 10:26:31,022 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:31,022 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:31,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-24 10:26:31,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:26:31,223 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-24 10:26:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2021-10-24 10:26:31,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:31,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153414051] [2021-10-24 10:26:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:31,225 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:31,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:31,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-24 10:26:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:31,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-24 10:26:31,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:31,339 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-24 10:26:31,445 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-24 10:26:31,446 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-24 10:26:31,498 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-24 10:26:31,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:31,572 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-24 10:26:31,572 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:31,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153414051] [2021-10-24 10:26:31,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153414051] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:31,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:31,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-24 10:26:31,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336372042] [2021-10-24 10:26:31,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:26:31,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:26:31,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:26:31,586 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-24 10:26:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:32,056 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2021-10-24 10:26:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-24 10:26:32,057 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-24 10:26:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:32,059 INFO L225 Difference]: With dead ends: 138 [2021-10-24 10:26:32,059 INFO L226 Difference]: Without dead ends: 138 [2021-10-24 10:26:32,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-10-24 10:26:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2021-10-24 10:26:32,067 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-24 10:26:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2021-10-24 10:26:32,069 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 8 [2021-10-24 10:26:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:32,069 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2021-10-24 10:26:32,070 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-24 10:26:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2021-10-24 10:26:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-24 10:26:32,070 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:32,071 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:32,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-24 10:26:32,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:26:32,282 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-24 10:26:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2021-10-24 10:26:32,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:32,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070506590] [2021-10-24 10:26:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:32,285 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:32,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:32,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:32,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-24 10:26:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:32,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-24 10:26:32,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:32,406 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-24 10:26:32,413 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-24 10:26:32,612 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-24 10:26:32,612 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-24 10:26:32,629 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-24 10:26:32,630 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-24 10:26:32,683 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-24 10:26:32,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:35,760 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-24 10:26:35,761 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:35,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070506590] [2021-10-24 10:26:35,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070506590] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:35,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:35,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-24 10:26:35,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485155645] [2021-10-24 10:26:35,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-24 10:26:35,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:35,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-24 10:26:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-10-24 10:26:35,764 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-24 10:26:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:55,270 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2021-10-24 10:26:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-24 10:26:55,271 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-24 10:26:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:55,273 INFO L225 Difference]: With dead ends: 173 [2021-10-24 10:26:55,273 INFO L226 Difference]: Without dead ends: 173 [2021-10-24 10:26:55,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 17812.0ms TimeCoverageRelationStatistics Valid=68, Invalid=112, Unknown=2, NotChecked=0, Total=182 [2021-10-24 10:26:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-24 10:26:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2021-10-24 10:26:55,280 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-24 10:26:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-10-24 10:26:55,281 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 8 [2021-10-24 10:26:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:55,281 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-10-24 10:26:55,282 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-24 10:26:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-10-24 10:26:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-24 10:26:55,283 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:55,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:55,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-24 10:26:55,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:26:55,487 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-24 10:26:55,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1116012804, now seen corresponding path program 1 times [2021-10-24 10:26:55,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:55,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784626135] [2021-10-24 10:26:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:55,493 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:55,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:55,496 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:55,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-24 10:26:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:55,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-24 10:26:55,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:55,640 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-24 10:26:55,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:55,685 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-24 10:26:55,685 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:55,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784626135] [2021-10-24 10:26:55,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784626135] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:55,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:55,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-24 10:26:55,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65565496] [2021-10-24 10:26:55,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:26:55,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:55,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:26:55,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:26:55,688 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-24 10:26:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:56,065 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-10-24 10:26:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:26:56,065 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-24 10:26:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:56,066 INFO L225 Difference]: With dead ends: 144 [2021-10-24 10:26:56,066 INFO L226 Difference]: Without dead ends: 144 [2021-10-24 10:26:56,067 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-24 10:26:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2021-10-24 10:26:56,073 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-24 10:26:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-10-24 10:26:56,074 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 10 [2021-10-24 10:26:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:56,075 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-10-24 10:26:56,075 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-24 10:26:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-10-24 10:26:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-24 10:26:56,076 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:56,076 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:56,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-24 10:26:56,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:26:56,287 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-24 10:26:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-10-24 10:26:56,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:56,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468813998] [2021-10-24 10:26:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:56,288 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:56,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:56,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:56,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-24 10:26:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:56,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-24 10:26:56,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:56,397 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-24 10:26:56,418 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-24 10:26:56,452 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-24 10:26:56,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-24 10:26:56,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:56,527 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-24 10:26:56,527 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:56,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468813998] [2021-10-24 10:26:56,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468813998] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:56,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:56,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-24 10:26:56,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805028761] [2021-10-24 10:26:56,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:26:56,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:56,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:26:56,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:56,530 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-24 10:26:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:57,113 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-10-24 10:26:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:26:57,113 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-24 10:26:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:57,114 INFO L225 Difference]: With dead ends: 115 [2021-10-24 10:26:57,114 INFO L226 Difference]: Without dead ends: 115 [2021-10-24 10:26:57,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 85.1ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:26:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-24 10:26:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-10-24 10:26:57,120 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-24 10:26:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-10-24 10:26:57,121 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 11 [2021-10-24 10:26:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:57,121 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-10-24 10:26:57,122 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-24 10:26:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-10-24 10:26:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-24 10:26:57,122 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:57,123 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:57,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-24 10:26:57,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:26:57,333 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-24 10:26:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-10-24 10:26:57,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:57,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041227939] [2021-10-24 10:26:57,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:57,335 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:57,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:57,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:57,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-24 10:26:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:57,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-24 10:26:57,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:57,483 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-24 10:26:57,518 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-24 10:26:57,529 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-24 10:26:57,589 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-24 10:26:57,598 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-24 10:26:57,632 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-24 10:26:57,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:57,919 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-24 10:26:57,920 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:57,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041227939] [2021-10-24 10:26:57,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041227939] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:57,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:57,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-24 10:26:57,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180009491] [2021-10-24 10:26:57,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-24 10:26:57,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-24 10:26:57,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-24 10:26:57,922 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-24 10:26:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:26:59,172 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-10-24 10:26:59,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-24 10:26:59,173 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-24 10:26:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:26:59,174 INFO L225 Difference]: With dead ends: 114 [2021-10-24 10:26:59,174 INFO L226 Difference]: Without dead ends: 114 [2021-10-24 10:26:59,175 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 340.4ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-10-24 10:26:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-24 10:26:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-10-24 10:26:59,179 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-24 10:26:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-10-24 10:26:59,180 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 11 [2021-10-24 10:26:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:26:59,181 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-10-24 10:26:59,181 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-24 10:26:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-10-24 10:26:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-24 10:26:59,182 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:26:59,182 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:26:59,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-24 10:26:59,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:26:59,390 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-24 10:26:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:26:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash -200394276, now seen corresponding path program 1 times [2021-10-24 10:26:59,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:26:59,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146203862] [2021-10-24 10:26:59,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:26:59,391 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:26:59,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:26:59,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:26:59,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-24 10:26:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:26:59,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-24 10:26:59,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:26:59,505 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-24 10:26:59,583 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-24 10:26:59,603 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-24 10:26:59,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:26:59,664 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-24 10:26:59,664 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:26:59,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146203862] [2021-10-24 10:26:59,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146203862] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:26:59,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:26:59,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-24 10:26:59,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57340766] [2021-10-24 10:26:59,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-24 10:26:59,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:26:59,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-24 10:26:59,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-24 10:26:59,666 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-24 10:27:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:27:00,289 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2021-10-24 10:27:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:27:00,290 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-24 10:27:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:27:00,291 INFO L225 Difference]: With dead ends: 175 [2021-10-24 10:27:00,291 INFO L226 Difference]: Without dead ends: 175 [2021-10-24 10:27:00,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-24 10:27:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-10-24 10:27:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 120. [2021-10-24 10:27:00,296 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-24 10:27:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-10-24 10:27:00,297 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 13 [2021-10-24 10:27:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:27:00,298 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-10-24 10:27:00,298 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-24 10:27:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-10-24 10:27:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-24 10:27:00,299 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:27:00,299 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:27:00,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-24 10:27:00,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:27:00,507 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-24 10:27:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:27:00,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-10-24 10:27:00,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:27:00,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794735272] [2021-10-24 10:27:00,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:27:00,508 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:27:00,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:27:00,518 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:27:00,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-24 10:27:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:27:00,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-24 10:27:00,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:27:00,672 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-24 10:27:00,764 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-24 10:27:00,764 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-24 10:27:00,857 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-24 10:27:01,098 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-24 10:27:01,099 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-24 10:27:01,276 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-24 10:27:01,277 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-24 10:27:01,498 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-24 10:27:01,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:27:13,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|) c_ULTIMATE.start_main_~end~0.base))) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))))))))) (_ bv1 1)))) is different from false [2021-10-24 10:27:13,768 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-24 10:27:13,768 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:27:13,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794735272] [2021-10-24 10:27:13,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794735272] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:27:13,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:27:13,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 14 [2021-10-24 10:27:13,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035094781] [2021-10-24 10:27:13,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-24 10:27:13,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:27:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-24 10:27:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=4, NotChecked=24, Total=210 [2021-10-24 10:27:13,771 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 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-24 10:27:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:27:16,192 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2021-10-24 10:27:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-24 10:27:16,192 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 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-24 10:27:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:27:16,194 INFO L225 Difference]: With dead ends: 141 [2021-10-24 10:27:16,194 INFO L226 Difference]: Without dead ends: 141 [2021-10-24 10:27:16,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 12962.0ms TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=4, NotChecked=42, Total=552 [2021-10-24 10:27:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-24 10:27:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2021-10-24 10:27:16,198 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-24 10:27:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2021-10-24 10:27:16,199 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 15 [2021-10-24 10:27:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:27:16,199 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2021-10-24 10:27:16,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 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-24 10:27:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2021-10-24 10:27:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-24 10:27:16,200 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:27:16,201 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:27:16,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-24 10:27:16,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:27:16,407 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-24 10:27:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:27:16,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-10-24 10:27:16,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:27:16,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009281406] [2021-10-24 10:27:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:27:16,408 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:27:16,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:27:16,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:27:16,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-24 10:27:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:27:16,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-24 10:27:16,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:27:16,604 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-24 10:27:16,664 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-24 10:27:16,685 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-24 10:27:16,686 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-24 10:27:16,735 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-24 10:27:16,752 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-24 10:27:16,949 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-10-24 10:27:16,950 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-24 10:27:16,981 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-10-24 10:27:16,981 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-24 10:27:17,134 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-24 10:27:17,135 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-24 10:27:17,142 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-10-24 10:27:17,143 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-24 10:27:17,224 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-24 10:27:17,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:27:29,313 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .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| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 c_ULTIMATE.start_main_~end~0.base)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (select (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (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 .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-10-24 10:27:29,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-24 10:27:29,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-24 10:27:29,579 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-24 10:27:29,579 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:27:29,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009281406] [2021-10-24 10:27:29,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009281406] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:27:29,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:27:29,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2021-10-24 10:27:29,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190181904] [2021-10-24 10:27:29,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-24 10:27:29,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:27:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-24 10:27:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=173, Unknown=2, NotChecked=26, Total=240 [2021-10-24 10:27:29,581 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-24 10:27:36,726 WARN L207 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-10-24 10:27:45,305 WARN L207 SmtUtils]: Spent 8.19 s on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2021-10-24 10:27:47,653 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (.cse0 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~end~0.offset))) (and (bvule .cse0 (select |c_#length| c_ULTIMATE.start_main_~end~0.base)) (= (select |c_#length| .cse1) (_ bv12 32)) (forall ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse2 (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|) .cse2 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|) .cse2 c_ULTIMATE.start_main_~end~0.base)) c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset))))) (not (= .cse1 c_ULTIMATE.start_main_~end~0.base)) (exists ((|ULTIMATE.start_main_#t~mem6.offset| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~end~0.base) c_ULTIMATE.start_main_~end~0.offset)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem6.offset|))) (and (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) c_ULTIMATE.start_main_~end~0.base) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) 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 ((.cse5 (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 .cse5 (bvadd (_ bv4 32) .cse5)))) (bvule c_ULTIMATE.start_main_~end~0.offset .cse0) (= (_ 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-24 10:28:04,856 WARN L207 SmtUtils]: Spent 9.56 s on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2021-10-24 10:28:07,466 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-24 10:28:39,146 WARN L207 SmtUtils]: Spent 18.21 s on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2021-10-24 10:28:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:28:39,675 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2021-10-24 10:28:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-10-24 10:28:39,676 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-24 10:28:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:28:39,677 INFO L225 Difference]: With dead ends: 177 [2021-10-24 10:28:39,677 INFO L226 Difference]: Without dead ends: 177 [2021-10-24 10:28:39,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 77977.8ms TimeCoverageRelationStatistics Valid=287, Invalid=1051, Unknown=6, NotChecked=216, Total=1560 [2021-10-24 10:28:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-10-24 10:28:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2021-10-24 10:28:39,681 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-24 10:28:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2021-10-24 10:28:39,682 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 15 [2021-10-24 10:28:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:28:39,682 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2021-10-24 10:28:39,683 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-24 10:28:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2021-10-24 10:28:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-24 10:28:39,684 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:28:39,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:28:39,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-24 10:28:39,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:28:39,887 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-24 10:28:39,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:28:39,887 INFO L82 PathProgramCache]: Analyzing trace with hash -715208061, now seen corresponding path program 1 times [2021-10-24 10:28:39,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:28:39,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608542431] [2021-10-24 10:28:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:28:39,888 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:28:39,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:28:39,889 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:28:39,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-24 10:28:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:28:40,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-24 10:28:40,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-24 10:28:40,045 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-24 10:28:40,151 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-24 10:28:40,176 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-24 10:28:40,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-24 10:28:40,339 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-24 10:28:40,340 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-24 10:28:40,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608542431] [2021-10-24 10:28:40,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608542431] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-24 10:28:40,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:28:40,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-10-24 10:28:40,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245762462] [2021-10-24 10:28:40,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-24 10:28:40,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-24 10:28:40,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-24 10:28:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-24 10:28:40,342 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-24 10:28:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:28:41,114 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2021-10-24 10:28:41,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-24 10:28:41,115 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-24 10:28:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:28:41,116 INFO L225 Difference]: With dead ends: 169 [2021-10-24 10:28:41,116 INFO L226 Difference]: Without dead ends: 169 [2021-10-24 10:28:41,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 148.8ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-10-24 10:28:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-10-24 10:28:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 120. [2021-10-24 10:28:41,120 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-24 10:28:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-10-24 10:28:41,121 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 19 [2021-10-24 10:28:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:28:41,122 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-10-24 10:28:41,122 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-24 10:28:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-10-24 10:28:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-24 10:28:41,123 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:28:41,123 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:28:41,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-24 10:28:41,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:28:41,333 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-24 10:28:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:28:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash -714897179, now seen corresponding path program 1 times [2021-10-24 10:28:41,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-24 10:28:41,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652209288] [2021-10-24 10:28:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:28:41,334 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-24 10:28:41,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat [2021-10-24 10:28:41,336 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-24 10:28:41,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-24 10:28:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:28:41,517 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-24 10:28:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-24 10:28:41,616 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-10-24 10:28:41,617 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-24 10:28:41,618 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:28:41,619 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-24 10:28:41,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-24 10:28:41,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-24 10:28:41,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-24 10:28:41,620 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-24 10:28:41,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-24 10:28:41,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-24 10:28:41,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-24 10:28:41,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-24 10:28:41,621 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-24 10:28:41,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-24 10:28:41,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-24 10:28:41,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-24 10:28:41,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-24 10:28:41,622 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-24 10:28:41,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-24 10:28:41,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-24 10:28:41,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-24 10:28:41,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-24 10:28:41,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-24 10:28:41,623 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-24 10:28:41,624 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-24 10:28:41,624 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-24 10:28:41,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-24 10:28:41,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-24 10:28:41,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-24 10:28:41,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-24 10:28:41,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-24 10:28:41,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-24 10:28:41,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-24 10:28:41,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-24 10:28:41,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-24 10:28:41,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:28:41,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-24 10:28:41,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-24 10:28:41,631 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:28:41,631 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-24 10:28:41,631 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-24 10:28:41,631 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-24 10:28:41,631 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-24 10:28:41,632 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-24 10:28:41,632 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-24 10:28:41,632 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-24 10:28:41,632 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-24 10:28:41,632 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-24 10:28:41,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-24 10:28:41,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-24 10:28:41,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-24 10:28:41,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-24 10:28:41,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-24 10:28:41,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-24 10:28:41,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-24 10:28:41,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-24 10:28:41,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-24 10:28:41,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-10-24 10:28:41,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:28:41,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-24 10:28:41,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/mathsat -unsat_core_generation=3 [2021-10-24 10:28:41,869 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:28:41,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:28:41 BoogieIcfgContainer [2021-10-24 10:28:41,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:28:41,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:28:41,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:28:41,906 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:28:41,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:26:29" (3/4) ... [2021-10-24 10:28:41,910 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-24 10:28:41,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:28:41,912 INFO L168 Benchmark]: Toolchain (without parser) took 134731.37 ms. Allocated memory was 56.6 MB in the beginning and 98.6 MB in the end (delta: 41.9 MB). Free memory was 33.0 MB in the beginning and 40.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 34.0 MB. Max. memory is 16.1 GB. [2021-10-24 10:28:41,912 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 56.6 MB. Free memory is still 36.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:28:41,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.03 ms. Allocated memory was 56.6 MB in the beginning and 81.8 MB in the end (delta: 25.2 MB). Free memory was 32.8 MB in the beginning and 56.6 MB in the end (delta: -23.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-24 10:28:41,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.09 ms. Allocated memory is still 81.8 MB. Free memory was 56.6 MB in the beginning and 54.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:28:41,913 INFO L168 Benchmark]: Boogie Preprocessor took 45.48 ms. Allocated memory is still 81.8 MB. Free memory was 54.5 MB in the beginning and 52.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:28:41,914 INFO L168 Benchmark]: RCFGBuilder took 1028.17 ms. Allocated memory is still 81.8 MB. Free memory was 52.4 MB in the beginning and 51.6 MB in the end (delta: 831.0 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-24 10:28:41,914 INFO L168 Benchmark]: TraceAbstraction took 132805.38 ms. Allocated memory was 81.8 MB in the beginning and 98.6 MB in the end (delta: 16.8 MB). Free memory was 50.9 MB in the beginning and 41.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. [2021-10-24 10:28:41,915 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 98.6 MB. Free memory was 41.3 MB in the beginning and 40.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:28:41,917 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.22 ms. Allocated memory is still 56.6 MB. Free memory is still 36.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 763.03 ms. Allocated memory was 56.6 MB in the beginning and 81.8 MB in the end (delta: 25.2 MB). Free memory was 32.8 MB in the beginning and 56.6 MB in the end (delta: -23.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.09 ms. Allocated memory is still 81.8 MB. Free memory was 56.6 MB in the beginning and 54.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.48 ms. Allocated memory is still 81.8 MB. Free memory was 54.5 MB in the beginning and 52.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1028.17 ms. Allocated memory is still 81.8 MB. Free memory was 52.4 MB in the beginning and 51.6 MB in the end (delta: 831.0 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 132805.38 ms. Allocated memory was 81.8 MB in the beginning and 98.6 MB in the end (delta: 16.8 MB). Free memory was 50.9 MB in the beginning and 41.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.91 ms. Allocated memory is still 98.6 MB. Free memory was 41.3 MB in the beginning and 40.2 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: 132665.8ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 22.2ms, AutomataDifference: 97142.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 779 SDtfs, 1498 SDslu, 1633 SDs, 0 SdLazy, 2860 SolverSat, 201 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13561.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 147 SyntacticMatches, 6 SemanticMatches, 108 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 109524.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=0, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 116.2ms AutomataMinimizationTime, 11 MinimizatonAttempts, 302 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 116.9ms SsaConstructionTime, 414.7ms SatisfiabilityAnalysisTime, 31256.8ms InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 22 QuantifiedInterpolants, 2295 SizeOfPredicates, 52 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-24 10:28:42,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e867a0fc-dcca-4ce1-b7f6-9933629d4e28/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...