./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0102-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:45:38,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:45:38,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:45:38,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:45:38,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:45:38,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:45:38,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:45:38,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:45:38,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:45:38,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:45:38,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:45:38,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:45:38,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:45:38,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:45:38,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:45:38,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:45:38,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:45:38,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:45:38,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:45:38,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:45:38,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:45:38,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:45:38,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:45:38,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:45:38,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:45:38,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:45:38,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:45:38,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:45:38,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:45:38,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:45:38,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:45:38,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:45:38,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:45:38,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:45:38,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:45:38,895 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:45:38,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:45:38,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:45:38,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:45:38,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:45:38,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:45:38,899 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-11-03 03:45:38,945 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:45:38,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:45:38,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:45:38,946 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:45:38,947 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:45:38,947 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:45:38,947 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 03:45:38,947 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:45:38,948 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:45:38,948 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 03:45:38,949 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 03:45:38,949 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:45:38,949 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 03:45:38,949 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 03:45:38,950 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 03:45:38,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 03:45:38,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 03:45:38,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:45:38,951 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:45:38,951 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 03:45:38,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:45:38,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:45:38,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:45:38,952 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 03:45:38,952 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 03:45:38,952 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-03 03:45:38,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:45:38,954 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:45:38,954 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:45:38,954 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:45:38,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:45:38,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:45:38,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:45:38,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:45:38,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:45:38,956 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 03:45:38,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 03:45:38,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:45:38,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:45:38,957 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_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2021-11-03 03:45:39,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:45:39,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:45:39,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:45:39,266 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:45:39,267 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:45:39,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/memsafety/test-0102-1.i [2021-11-03 03:45:39,354 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/301bcdd88/8927ebb07d9640998e5b6795bf59ebd6/FLAG31f742781 [2021-11-03 03:45:40,020 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:45:40,020 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/sv-benchmarks/c/memsafety/test-0102-1.i [2021-11-03 03:45:40,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/301bcdd88/8927ebb07d9640998e5b6795bf59ebd6/FLAG31f742781 [2021-11-03 03:45:40,279 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/301bcdd88/8927ebb07d9640998e5b6795bf59ebd6 [2021-11-03 03:45:40,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:45:40,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:45:40,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:45:40,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:45:40,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:45:40,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:45:40" (1/1) ... [2021-11-03 03:45:40,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f3bae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:40, skipping insertion in model container [2021-11-03 03:45:40,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:45:40" (1/1) ... [2021-11-03 03:45:40,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:45:40,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:45:40,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:45:40,796 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-11-03 03:45:40,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d99761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:40, skipping insertion in model container [2021-11-03 03:45:40,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:45:40,798 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-11-03 03:45:40,801 INFO L168 Benchmark]: Toolchain (without parser) took 516.70 ms. Allocated memory is still 111.1 MB. Free memory was 70.2 MB in the beginning and 82.6 MB in the end (delta: -12.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 03:45:40,803 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 111.1 MB. Free memory was 87.9 MB in the beginning and 87.8 MB in the end (delta: 59.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:45:40,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.68 ms. Allocated memory is still 111.1 MB. Free memory was 70.0 MB in the beginning and 82.6 MB in the end (delta: -12.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 03:45:40,807 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.23 ms. Allocated memory is still 111.1 MB. Free memory was 87.9 MB in the beginning and 87.8 MB in the end (delta: 59.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 504.68 ms. Allocated memory is still 111.1 MB. Free memory was 70.0 MB in the beginning and 82.6 MB in the end (delta: -12.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0102-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:45:43,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:45:43,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:45:43,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:45:43,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:45:43,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:45:43,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:45:43,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:45:43,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:45:43,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:45:43,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:45:43,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:45:43,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:45:43,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:45:43,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:45:43,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:45:43,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:45:43,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:45:43,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:45:43,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:45:43,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:45:43,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:45:43,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:45:43,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:45:43,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:45:43,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:45:43,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:45:43,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:45:43,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:45:43,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:45:43,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:45:43,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:45:43,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:45:43,168 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:45:43,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:45:43,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:45:43,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:45:43,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:45:43,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:45:43,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:45:43,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:45:43,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-11-03 03:45:43,229 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:45:43,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:45:43,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:45:43,231 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:45:43,231 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:45:43,231 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:45:43,231 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:45:43,232 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:45:43,232 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:45:43,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 03:45:43,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 03:45:43,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:45:43,233 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:45:43,234 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 03:45:43,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:45:43,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:45:43,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:45:43,235 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 03:45:43,235 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 03:45:43,235 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-03 03:45:43,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:45:43,236 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:45:43,236 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 03:45:43,236 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 03:45:43,236 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:45:43,236 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:45:43,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:45:43,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 03:45:43,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:45:43,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:45:43,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:45:43,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:45:43,238 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 03:45:43,239 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 03:45:43,239 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:45:43,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:45:43,240 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_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2021-11-03 03:45:43,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:45:43,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:45:43,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:45:43,667 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:45:43,667 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:45:43,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/memsafety/test-0102-1.i [2021-11-03 03:45:43,734 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/f672dbc92/8007540d555642038c93fa088207fa4f/FLAG94b50a5e5 [2021-11-03 03:45:44,372 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:45:44,375 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/sv-benchmarks/c/memsafety/test-0102-1.i [2021-11-03 03:45:44,397 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/f672dbc92/8007540d555642038c93fa088207fa4f/FLAG94b50a5e5 [2021-11-03 03:45:44,656 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/data/f672dbc92/8007540d555642038c93fa088207fa4f [2021-11-03 03:45:44,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:45:44,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:45:44,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:45:44,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:45:44,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:45:44,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:45:44" (1/1) ... [2021-11-03 03:45:44,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54de6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:44, skipping insertion in model container [2021-11-03 03:45:44,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:45:44" (1/1) ... [2021-11-03 03:45:44,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:45:44,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:45:45,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:45:45,104 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-03 03:45:45,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:45:45,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:45:45,185 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:45:45,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:45:45,308 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:45:45,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45 WrapperNode [2021-11-03 03:45:45,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:45:45,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:45:45,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:45:45,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:45:45,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:45:45,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:45:45,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:45:45,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:45:45,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:45:45,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:45:45,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:45:45,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:45:45,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (1/1) ... [2021-11-03 03:45:45,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:45:45,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:45:45,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 03:45:45,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 03:45:45,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 03:45:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 03:45:45,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:45:45,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 03:45:45,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-03 03:45:45,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:45:45,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 03:45:45,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 03:45:45,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:45:45,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:45:46,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:45:46,461 INFO L299 CfgBuilder]: Removed 40 assume(true) statements. [2021-11-03 03:45:46,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:45:46 BoogieIcfgContainer [2021-11-03 03:45:46,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:45:46,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:45:46,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:45:46,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:45:46,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:45:44" (1/3) ... [2021-11-03 03:45:46,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3c0f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:45:46, skipping insertion in model container [2021-11-03 03:45:46,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:45:45" (2/3) ... [2021-11-03 03:45:46,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3c0f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:45:46, skipping insertion in model container [2021-11-03 03:45:46,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:45:46" (3/3) ... [2021-11-03 03:45:46,480 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0102-1.i [2021-11-03 03:45:46,487 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:45:46,487 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2021-11-03 03:45:46,545 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:45:46,551 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 03:45:46,551 INFO L340 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2021-11-03 03:45:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 72 states have (on average 2.0972222222222223) internal successors, (151), 136 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:45:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 03:45:46,595 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:45:46,595 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 03:45:46,596 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:45:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 28828812, now seen corresponding path program 1 times [2021-11-03 03:45:46,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:45:46,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007060502] [2021-11-03 03:45:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:46,616 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:45:46,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:45:46,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:45:46,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 03:45:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:46,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-03 03:45:46,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:45:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:46,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:45:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:46,764 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:45:46,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007060502] [2021-11-03 03:45:46,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007060502] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:46,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:46,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 03:45:46,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447905241] [2021-11-03 03:45:46,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 03:45:46,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:45:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 03:45:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 03:45:46,815 INFO L87 Difference]: Start difference. First operand has 137 states, 72 states have (on average 2.0972222222222223) internal successors, (151), 136 states have internal predecessors, (151), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-11-03 03:45:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:46,844 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-11-03 03:45:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 03:45:46,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 5 [2021-11-03 03:45:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:46,859 INFO L225 Difference]: With dead ends: 137 [2021-11-03 03:45:46,860 INFO L226 Difference]: Without dead ends: 135 [2021-11-03 03:45:46,861 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 03:45:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-03 03:45:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-11-03 03:45:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 71 states have (on average 1.971830985915493) internal successors, (140), 134 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-11-03 03:45:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2021-11-03 03:45:46,926 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 5 [2021-11-03 03:45:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:46,926 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2021-11-03 03:45:46,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-11-03 03:45:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2021-11-03 03:45:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 03:45:46,927 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:45:46,928 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 03:45:46,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-03 03:45:47,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:45:47,140 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:45:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash 889540459, now seen corresponding path program 1 times [2021-11-03 03:45:47,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:45:47,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685723796] [2021-11-03 03:45:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:47,142 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:45:47,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:45:47,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:45:47,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 03:45:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:47,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 03:45:47,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:45:47,266 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-11-03 03:45:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:47,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:45:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:47,542 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:45:47,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685723796] [2021-11-03 03:45:47,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685723796] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:47,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:47,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-03 03:45:47,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128339424] [2021-11-03 03:45:47,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 03:45:47,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:45:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 03:45:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:45:47,546 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-11-03 03:45:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:48,507 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2021-11-03 03:45:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:45:48,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 6 [2021-11-03 03:45:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:48,511 INFO L225 Difference]: With dead ends: 135 [2021-11-03 03:45:48,511 INFO L226 Difference]: Without dead ends: 135 [2021-11-03 03:45:48,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 03:45:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-03 03:45:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2021-11-03 03:45:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 1.943661971830986) internal successors, (138), 132 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:45:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2021-11-03 03:45:48,521 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 6 [2021-11-03 03:45:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:48,521 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2021-11-03 03:45:48,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-11-03 03:45:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2021-11-03 03:45:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 03:45:48,522 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:45:48,523 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 03:45:48,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 03:45:48,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:45:48,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:45:48,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 889540458, now seen corresponding path program 1 times [2021-11-03 03:45:48,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:45:48,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892460740] [2021-11-03 03:45:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:48,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:45:48,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:45:48,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:45:48,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 03:45:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:48,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 03:45:48,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:45:48,844 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-11-03 03:45:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:48,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:45:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:48,909 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:45:48,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892460740] [2021-11-03 03:45:48,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892460740] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:48,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:48,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 03:45:48,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391598370] [2021-11-03 03:45:48,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:45:48,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:45:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:45:48,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:45:48,912 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:45:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:49,279 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions. [2021-11-03 03:45:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:45:49,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-11-03 03:45:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:49,281 INFO L225 Difference]: With dead ends: 175 [2021-11-03 03:45:49,281 INFO L226 Difference]: Without dead ends: 175 [2021-11-03 03:45:49,281 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:45:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-03 03:45:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 129. [2021-11-03 03:45:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.8873239436619718) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:45:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2021-11-03 03:45:49,299 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 6 [2021-11-03 03:45:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:49,299 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-11-03 03:45:49,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:45:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2021-11-03 03:45:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 03:45:49,301 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:45:49,301 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:45:49,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-03 03:45:49,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:45:49,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:45:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1986689261, now seen corresponding path program 1 times [2021-11-03 03:45:49,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:45:49,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948578514] [2021-11-03 03:45:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:49,516 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:45:49,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:45:49,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:45:49,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-03 03:45:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:49,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-03 03:45:49,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:45:49,653 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-11-03 03:45:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:49,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:45:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:49,754 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:45:49,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948578514] [2021-11-03 03:45:49,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948578514] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:49,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:49,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-03 03:45:49,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018684508] [2021-11-03 03:45:49,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:45:49,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:45:49,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:45:49,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:45:49,759 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-03 03:45:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:50,065 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2021-11-03 03:45:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:45:50,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 10 [2021-11-03 03:45:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:50,067 INFO L225 Difference]: With dead ends: 134 [2021-11-03 03:45:50,067 INFO L226 Difference]: Without dead ends: 134 [2021-11-03 03:45:50,067 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:45:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-03 03:45:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2021-11-03 03:45:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:45:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-11-03 03:45:50,076 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 10 [2021-11-03 03:45:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:50,076 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-11-03 03:45:50,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-03 03:45:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-11-03 03:45:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 03:45:50,077 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:45:50,077 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:45:50,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-03 03:45:50,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:45:50,288 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:45:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1986689262, now seen corresponding path program 1 times [2021-11-03 03:45:50,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:45:50,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339086260] [2021-11-03 03:45:50,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:50,290 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:45:50,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:45:50,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:45:50,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-03 03:45:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:50,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 03:45:50,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:45:50,408 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-11-03 03:45:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:50,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:45:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:50,443 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:45:50,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339086260] [2021-11-03 03:45:50,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339086260] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:50,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:50,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 03:45:50,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105814048] [2021-11-03 03:45:50,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:45:50,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:45:50,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:45:50,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:45:50,446 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-03 03:45:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:50,669 INFO L93 Difference]: Finished difference Result 174 states and 182 transitions. [2021-11-03 03:45:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:45:50,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-03 03:45:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:50,671 INFO L225 Difference]: With dead ends: 174 [2021-11-03 03:45:50,671 INFO L226 Difference]: Without dead ends: 174 [2021-11-03 03:45:50,671 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:45:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-11-03 03:45:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 125. [2021-11-03 03:45:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 124 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:45:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2021-11-03 03:45:50,698 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 10 [2021-11-03 03:45:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:50,699 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2021-11-03 03:45:50,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-11-03 03:45:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2021-11-03 03:45:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:45:50,702 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:45:50,702 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:45:50,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-03 03:45:50,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:45:50,914 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:45:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2052066035, now seen corresponding path program 1 times [2021-11-03 03:45:50,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:45:50,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218352002] [2021-11-03 03:45:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:50,915 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:45:50,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:45:50,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:45:50,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-03 03:45:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:51,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-03 03:45:51,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:45:51,046 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-11-03 03:45:51,111 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-03 03:45:51,112 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 16 treesize of output 21 [2021-11-03 03:45:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:51,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:45:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:51,348 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:45:51,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218352002] [2021-11-03 03:45:51,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218352002] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:51,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:51,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-03 03:45:51,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723760696] [2021-11-03 03:45:51,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 03:45:51,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:45:51,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 03:45:51,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:45:51,354 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-11-03 03:45:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:45:51,894 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions. [2021-11-03 03:45:51,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:45:51,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 12 [2021-11-03 03:45:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:45:51,896 INFO L225 Difference]: With dead ends: 175 [2021-11-03 03:45:51,896 INFO L226 Difference]: Without dead ends: 175 [2021-11-03 03:45:51,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-03 03:45:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-03 03:45:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2021-11-03 03:45:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 122 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-11-03 03:45:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2021-11-03 03:45:51,903 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 12 [2021-11-03 03:45:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:45:51,903 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2021-11-03 03:45:51,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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-11-03 03:45:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2021-11-03 03:45:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:45:51,904 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:45:51,904 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:45:51,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-03 03:45:52,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:45:52,105 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:45:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:45:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2052066036, now seen corresponding path program 1 times [2021-11-03 03:45:52,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:45:52,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514025890] [2021-11-03 03:45:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:45:52,106 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:45:52,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:45:52,107 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:45:52,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-03 03:45:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:45:52,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-03 03:45:52,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:45:52,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-03 03:45:52,278 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-11-03 03:45:52,451 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-03 03:45:52,451 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-11-03 03:45:52,461 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-03 03:45:52,462 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 24 [2021-11-03 03:45:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:52,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:45:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:45:54,452 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:45:54,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514025890] [2021-11-03 03:45:54,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514025890] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:45:54,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:45:54,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2021-11-03 03:45:54,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420138088] [2021-11-03 03:45:54,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-03 03:45:54,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:45:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-03 03:45:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-03 03:45:54,454 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:11,478 WARN L207 SmtUtils]: Spent 8.43 s on a formula simplification that was a NOOP. DAG size: 51 [2021-11-03 03:46:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:46:21,988 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-11-03 03:46:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 03:46:21,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 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-11-03 03:46:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:46:21,990 INFO L225 Difference]: With dead ends: 123 [2021-11-03 03:46:21,990 INFO L226 Difference]: Without dead ends: 123 [2021-11-03 03:46:21,990 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-11-03 03:46:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-03 03:46:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2021-11-03 03:46:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 120 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-11-03 03:46:21,996 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 12 [2021-11-03 03:46:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:46:21,997 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-11-03 03:46:21,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-11-03 03:46:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 03:46:21,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:46:21,998 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:46:22,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-11-03 03:46:22,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:46:22,212 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:46:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:46:22,212 INFO L85 PathProgramCache]: Analyzing trace with hash 645470996, now seen corresponding path program 1 times [2021-11-03 03:46:22,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:46:22,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082709383] [2021-11-03 03:46:22,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:22,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:46:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:46:22,214 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:46:22,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-03 03:46:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:22,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-03 03:46:22,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:46:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:22,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:46:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:22,436 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:46:22,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082709383] [2021-11-03 03:46:22,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082709383] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:46:22,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:46:22,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-03 03:46:22,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615879624] [2021-11-03 03:46:22,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:46:22,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:46:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:46:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:46:22,440 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:46:22,951 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2021-11-03 03:46:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:46:22,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-11-03 03:46:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:46:22,953 INFO L225 Difference]: With dead ends: 172 [2021-11-03 03:46:22,953 INFO L226 Difference]: Without dead ends: 172 [2021-11-03 03:46:22,954 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:46:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-11-03 03:46:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 118. [2021-11-03 03:46:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.732394366197183) internal successors, (123), 117 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-11-03 03:46:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2021-11-03 03:46:22,958 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 14 [2021-11-03 03:46:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:46:22,959 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2021-11-03 03:46:22,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2021-11-03 03:46:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 03:46:22,959 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:46:22,959 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:46:22,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-03 03:46:23,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:46:23,160 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:46:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:46:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 645470997, now seen corresponding path program 1 times [2021-11-03 03:46:23,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:46:23,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000684962] [2021-11-03 03:46:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:23,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:46:23,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:46:23,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:46:23,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-03 03:46:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:23,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-03 03:46:23,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:46:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:23,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:46:23,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-11-03 03:46:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:24,069 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:46:24,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000684962] [2021-11-03 03:46:24,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000684962] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:46:24,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:46:24,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-11-03 03:46:24,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780091022] [2021-11-03 03:46:24,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-03 03:46:24,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:46:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-03 03:46:24,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-03 03:46:24,071 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:46:26,793 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2021-11-03 03:46:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-03 03:46:26,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 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 14 [2021-11-03 03:46:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:46:26,797 INFO L225 Difference]: With dead ends: 132 [2021-11-03 03:46:26,797 INFO L226 Difference]: Without dead ends: 132 [2021-11-03 03:46:26,798 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2021-11-03 03:46:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-03 03:46:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 115. [2021-11-03 03:46:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 114 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-11-03 03:46:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2021-11-03 03:46:26,803 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 14 [2021-11-03 03:46:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:46:26,804 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2021-11-03 03:46:26,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2021-11-03 03:46:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 03:46:26,805 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:46:26,805 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:46:26,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-03 03:46:27,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:46:27,019 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:46:27,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:46:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1465235593, now seen corresponding path program 1 times [2021-11-03 03:46:27,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:46:27,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202298800] [2021-11-03 03:46:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:27,020 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:46:27,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:46:27,022 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:46:27,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-03 03:46:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:27,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-03 03:46:27,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:46:27,223 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-11-03 03:46:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:27,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:46:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:27,371 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:46:27,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202298800] [2021-11-03 03:46:27,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202298800] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:46:27,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:46:27,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-03 03:46:27,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453040661] [2021-11-03 03:46:27,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:46:27,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:46:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:46:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:46:27,374 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-11-03 03:46:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:46:28,040 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2021-11-03 03:46:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:46:28,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 15 [2021-11-03 03:46:28,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:46:28,042 INFO L225 Difference]: With dead ends: 168 [2021-11-03 03:46:28,042 INFO L226 Difference]: Without dead ends: 168 [2021-11-03 03:46:28,043 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:46:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-11-03 03:46:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 110. [2021-11-03 03:46:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 71 states have (on average 1.619718309859155) internal successors, (115), 109 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2021-11-03 03:46:28,047 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 15 [2021-11-03 03:46:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:46:28,048 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2021-11-03 03:46:28,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-11-03 03:46:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2021-11-03 03:46:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 03:46:28,049 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:46:28,049 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:46:28,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-03 03:46:28,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:46:28,257 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:46:28,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:46:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1465235592, now seen corresponding path program 1 times [2021-11-03 03:46:28,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:46:28,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953326474] [2021-11-03 03:46:28,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:28,258 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:46:28,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:46:28,258 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:46:28,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-03 03:46:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:28,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-03 03:46:28,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:46:28,480 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-11-03 03:46:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:28,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:46:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:28,974 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:46:28,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953326474] [2021-11-03 03:46:28,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953326474] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:46:28,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:46:28,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-11-03 03:46:28,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79686941] [2021-11-03 03:46:28,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 03:46:28,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:46:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 03:46:28,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:46:28,976 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:46:30,063 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2021-11-03 03:46:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 03:46:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-11-03 03:46:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:46:30,065 INFO L225 Difference]: With dead ends: 118 [2021-11-03 03:46:30,065 INFO L226 Difference]: Without dead ends: 118 [2021-11-03 03:46:30,066 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-03 03:46:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-03 03:46:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2021-11-03 03:46:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 105 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2021-11-03 03:46:30,070 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 15 [2021-11-03 03:46:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:46:30,070 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2021-11-03 03:46:30,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2021-11-03 03:46:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 03:46:30,071 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:46:30,071 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:46:30,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-03 03:46:30,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:46:30,271 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:46:30,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:46:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash 657868666, now seen corresponding path program 1 times [2021-11-03 03:46:30,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:46:30,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6552935] [2021-11-03 03:46:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:30,273 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:46:30,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:46:30,274 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:46:30,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-03 03:46:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:30,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-03 03:46:30,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:46:30,655 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-11-03 03:46:30,704 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-11-03 03:46:30,785 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-03 03:46:30,785 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 21 treesize of output 20 [2021-11-03 03:46:30,877 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:46:30,877 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 16 treesize of output 16 [2021-11-03 03:46:31,126 INFO L354 Elim1Store]: treesize reduction 562, result has 2.9 percent of original size [2021-11-03 03:46:31,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 69 treesize of output 27 [2021-11-03 03:46:31,273 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-03 03:46:31,273 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-11-03 03:46:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:31,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:46:31,501 INFO L354 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2021-11-03 03:46:31,502 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 24 treesize of output 23 [2021-11-03 03:46:31,647 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:46:31,650 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 115 [2021-11-03 03:46:33,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_sub_~sub~0.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_sub_~sub~0.base) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_2) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_3) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_4)) c_ULTIMATE.start_insert_sub_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_insert_sub_~head.offset)) c_ULTIMATE.start_insert_sub_~head.base)) is different from false [2021-11-03 03:46:35,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_24 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_insert_sub_~sub~0.base_24 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_insert_sub_~sub~0.base_24) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_2) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_3) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_4)) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_24)))))) is different from false [2021-11-03 03:46:37,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_24 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (or (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.base)))) (store .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_24 (store (store (store (store (select .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_24) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_1) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_2) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_3) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_4))) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_24)))))) is different from false [2021-11-03 03:46:41,030 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:46:41,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6552935] [2021-11-03 03:46:41,031 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 03:46:41,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949916732] [2021-11-03 03:46:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:46:41,032 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-03 03:46:41,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 [2021-11-03 03:46:41,064 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-03 03:46:41,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-11-03 03:46:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:46:41,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-03 03:46:41,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:46:41,415 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-11-03 03:46:41,540 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-11-03 03:46:41,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:46:41,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:46:41,733 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:46:41,733 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 19 treesize of output 19 [2021-11-03 03:46:42,010 INFO L354 Elim1Store]: treesize reduction 516, result has 2.8 percent of original size [2021-11-03 03:46:42,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 25 [2021-11-03 03:46:42,207 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:46:42,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2021-11-03 03:46:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:42,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:46:42,316 INFO L354 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2021-11-03 03:46:42,316 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 27 treesize of output 26 [2021-11-03 03:46:42,335 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:46:42,336 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 115 [2021-11-03 03:46:53,468 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_25 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_insert_sub_~sub~0.base_25 (store (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_insert_sub_~sub~0.base_25) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_6) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_7) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_8)) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_25))))))) is different from false [2021-11-03 03:46:55,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_25 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_25))))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.base)))) (store .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_25 (store (store (store (store (select .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_25) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_6) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_7) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_8))) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base))) is different from false [2021-11-03 03:46:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:46:55,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [949916732] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 03:46:55,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:46:55,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 15 [2021-11-03 03:46:55,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756732342] [2021-11-03 03:46:55,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-03 03:46:55,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 03:46:55,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-03 03:46:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=394, Unknown=8, NotChecked=220, Total=702 [2021-11-03 03:46:55,808 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:46:57,989 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| c_ULTIMATE.start_insert_top_~top~0.base)))) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base) (= c_ULTIMATE.start_insert_top_~top~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_create_sub_list_~sub.base))))) (= c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv8 32)) (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_25 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_25))))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.base)))) (store .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_25 (store (store (store (store (select .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_25) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_6) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_7) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_8))) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base)))) is different from false [2021-11-03 03:47:22,111 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| c_ULTIMATE.start_insert_top_~top~0.base)))) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base) (= c_ULTIMATE.start_insert_top_~top~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_create_sub_list_~sub.base))))) (= c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv8 32)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| c_ULTIMATE.start___list_add_~prev.base)) (_ bv1 1))) (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_25 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_25))))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.base)))) (store .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_25 (store (store (store (store (select .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_25) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_6) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_7) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_8))) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))) c_ULTIMATE.start_create_sub_list_~sub.base)))) is different from false [2021-11-03 03:47:22,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:47:22,533 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2021-11-03 03:47:22,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-03 03:47:22,533 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 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-11-03 03:47:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:47:22,535 INFO L225 Difference]: With dead ends: 166 [2021-11-03 03:47:22,535 INFO L226 Difference]: Without dead ends: 166 [2021-11-03 03:47:22,536 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=192, Invalid=818, Unknown=10, NotChecked=462, Total=1482 [2021-11-03 03:47:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-03 03:47:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2021-11-03 03:47:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 115 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-11-03 03:47:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2021-11-03 03:47:22,541 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 17 [2021-11-03 03:47:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:47:22,542 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2021-11-03 03:47:22,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:47:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2021-11-03 03:47:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 03:47:22,543 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:47:22,543 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:47:22,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-03 03:47:22,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2021-11-03 03:47:22,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt [2021-11-03 03:47:22,944 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 03:47:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:47:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 657868667, now seen corresponding path program 1 times [2021-11-03 03:47:22,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 03:47:22,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8690166] [2021-11-03 03:47:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:47:22,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 03:47:22,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 03:47:22,947 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 03:47:22,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-03 03:47:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:47:23,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-03 03:47:23,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:47:23,262 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-11-03 03:47:23,274 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-11-03 03:47:23,380 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-11-03 03:47:23,406 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-11-03 03:47:23,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:47:23,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:47:23,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:47:23,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:47:23,645 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-03 03:47:23,645 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 12 treesize of output 18 [2021-11-03 03:47:23,678 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:47:23,678 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 18 treesize of output 18 [2021-11-03 03:47:24,001 INFO L354 Elim1Store]: treesize reduction 516, result has 2.8 percent of original size [2021-11-03 03:47:24,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 88 [2021-11-03 03:47:24,139 INFO L354 Elim1Store]: treesize reduction 516, result has 2.8 percent of original size [2021-11-03 03:47:24,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 40 [2021-11-03 03:47:24,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-03 03:47:24,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-03 03:47:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:47:24,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:47:25,172 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:47:25,174 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 192 [2021-11-03 03:47:25,180 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:47:25,181 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 294 [2021-11-03 03:47:27,798 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse0 (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32))) (.cse1 (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse2 (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse3 (bvadd (_ bv4 32) c_ULTIMATE.start_insert_sub_~head.offset))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_13) .cse0 v_DerPreprocessor_14) .cse1 v_DerPreprocessor_15) .cse2 v_DerPreprocessor_16)) c_ULTIMATE.start_insert_sub_~head.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_sub_~sub~0.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_sub_~sub~0.base) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_9) .cse0 v_DerPreprocessor_10) .cse1 v_DerPreprocessor_11) .cse2 v_DerPreprocessor_12)) c_ULTIMATE.start_insert_sub_~head.base) .cse3))))) (forall ((ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_13) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_15) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_16)) c_ULTIMATE.start_insert_sub_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_insert_sub_~head.offset)))) (bvule .cse4 (bvadd (_ bv4 32) .cse4))))) is different from false [2021-11-03 03:47:41,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_26 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.offset)))) (store .cse1 v_ULTIMATE.start_insert_sub_~sub~0.base_26 (store (store (store (store (select .cse1 v_ULTIMATE.start_insert_sub_~sub~0.base_26) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_13) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_14) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_15) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_16))) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_DerPreprocessor_10 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (let ((.cse3 (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32))) (.cse4 (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse5 (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse6 (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.offset)))) (store .cse2 v_ULTIMATE.start_insert_sub_~sub~0.base_26 (store (store (store (store (select .cse2 v_ULTIMATE.start_insert_sub_~sub~0.base_26) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_13) .cse3 v_DerPreprocessor_14) .cse4 v_DerPreprocessor_15) .cse5 v_DerPreprocessor_16))) c_ULTIMATE.start_create_sub_list_~sub.base) .cse6)) (select (store |c_#length| v_ULTIMATE.start_insert_sub_~sub~0.base_26 (_ bv12 32)) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.base)))) (store .cse7 v_ULTIMATE.start_insert_sub_~sub~0.base_26 (store (store (store (store (select .cse7 v_ULTIMATE.start_insert_sub_~sub~0.base_26) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_9) .cse3 v_DerPreprocessor_10) .cse4 v_DerPreprocessor_11) .cse5 v_DerPreprocessor_12))) c_ULTIMATE.start_create_sub_list_~sub.base) .cse6)))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_26)))))) is different from false [2021-11-03 03:49:10,509 WARN L207 SmtUtils]: Spent 1.47 m on a formula simplification that was a NOOP. DAG size: 1805 [2021-11-03 03:49:12,240 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 03:49:12,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8690166] [2021-11-03 03:49:12,240 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 03:49:12,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2102186432] [2021-11-03 03:49:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:49:12,241 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-03 03:49:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 [2021-11-03 03:49:12,244 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-03 03:49:12,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-11-03 03:49:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:49:12,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-03 03:49:12,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:49:12,834 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-11-03 03:49:12,848 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-11-03 03:49:12,916 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-11-03 03:49:12,937 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-11-03 03:49:12,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:49:12,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:49:13,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:49:13,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:49:13,086 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-03 03:49:13,086 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 12 treesize of output 18 [2021-11-03 03:49:13,128 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:49:13,128 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 18 treesize of output 18 [2021-11-03 03:49:13,514 INFO L354 Elim1Store]: treesize reduction 516, result has 2.8 percent of original size [2021-11-03 03:49:13,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 88 [2021-11-03 03:49:13,704 INFO L354 Elim1Store]: treesize reduction 516, result has 2.8 percent of original size [2021-11-03 03:49:13,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 40 [2021-11-03 03:49:13,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-03 03:49:13,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-03 03:49:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:49:13,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:49:14,073 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:49:14,076 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 192 [2021-11-03 03:49:14,081 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:49:14,088 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 294 [2021-11-03 03:49:47,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_insert_sub_~sub~0.base_27 (_ BitVec 32))) (or (and (forall ((v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (let ((.cse1 (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse3 (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse4 (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32)))) (bvule (bvadd (_ bv4 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.offset)))) (store .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_27 (store (store (store (store (select .cse0 v_ULTIMATE.start_insert_sub_~sub~0.base_27) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_21) .cse1 v_DerPreprocessor_22) .cse2 v_DerPreprocessor_23) .cse3 v_DerPreprocessor_24))) c_ULTIMATE.start_create_sub_list_~sub.base) .cse4)) (select (store |c_#length| v_ULTIMATE.start_insert_sub_~sub~0.base_27 (_ bv12 32)) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.base)))) (store .cse5 v_ULTIMATE.start_insert_sub_~sub~0.base_27 (store (store (store (store (select .cse5 v_ULTIMATE.start_insert_sub_~sub~0.base_27) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_17) .cse1 v_DerPreprocessor_18) .cse2 v_DerPreprocessor_19) .cse3 v_DerPreprocessor_20))) c_ULTIMATE.start_create_sub_list_~sub.base) .cse4))))) (forall ((v_DerPreprocessor_21 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32))) (let ((.cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_create_sub_list_~sub.base) c_ULTIMATE.start_create_sub_list_~sub.offset c_ULTIMATE.start_create_sub_list_~sub.offset)))) (store .cse7 v_ULTIMATE.start_insert_sub_~sub~0.base_27 (store (store (store (store (select .cse7 v_ULTIMATE.start_insert_sub_~sub~0.base_27) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_21) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_22) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_23) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_24))) c_ULTIMATE.start_create_sub_list_~sub.base) (bvadd c_ULTIMATE.start_create_sub_list_~sub.offset (_ bv4 32))))) (bvule .cse6 (bvadd (_ bv4 32) .cse6))))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_insert_sub_~sub~0.base_27))))))))) is different from false [2021-11-03 03:49:49,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 03:49:49,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293618542] [2021-11-03 03:49:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:49:49,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 03:49:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:49:49,628 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 03:49:49,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-03 03:49:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:49:49,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-03 03:49:49,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 03:49:49,981 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-11-03 03:49:50,624 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-11-03 03:49:50,638 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-11-03 03:49:50,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:49:50,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:49:50,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 03:49:50,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 03:49:50,792 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-03 03:49:50,792 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 12 treesize of output 18 [2021-11-03 03:49:50,828 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 03:49:50,828 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-11-03 03:49:51,176 INFO L354 Elim1Store]: treesize reduction 516, result has 2.8 percent of original size [2021-11-03 03:49:51,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 130 treesize of output 88 [2021-11-03 03:49:51,360 INFO L354 Elim1Store]: treesize reduction 516, result has 2.8 percent of original size [2021-11-03 03:49:51,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 40 [2021-11-03 03:49:51,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-03 03:49:51,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-03 03:49:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:49:51,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 03:49:51,762 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:49:51,764 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 192 [2021-11-03 03:49:51,769 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 03:49:51,771 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 294 [2021-11-03 03:49:54,285 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_31 (_ BitVec 32)) (v_DerPreprocessor_32 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_29) (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32)) v_DerPreprocessor_30) (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_31) (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset) v_DerPreprocessor_32)) c_ULTIMATE.start_insert_sub_~head.base) (bvadd (_ bv4 32) c_ULTIMATE.start_insert_sub_~head.offset)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_DerPreprocessor_31 (_ BitVec 32)) (v_DerPreprocessor_32 (_ BitVec 32)) (ULTIMATE.start_insert_sub_~sub~0.offset (_ BitVec 32)) (v_DerPreprocessor_30 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_28 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32)) (v_DerPreprocessor_27 (_ BitVec 32))) (let ((.cse1 (bvadd ULTIMATE.start_insert_sub_~sub~0.offset (_ bv1 32))) (.cse2 (bvadd (_ bv2 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse3 (bvadd (_ bv3 32) ULTIMATE.start_insert_sub_~sub~0.offset)) (.cse4 (bvadd (_ bv4 32) c_ULTIMATE.start_insert_sub_~head.offset))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_insert_sub_~sub~0.base) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_29) .cse1 v_DerPreprocessor_30) .cse2 v_DerPreprocessor_31) .cse3 v_DerPreprocessor_32)) c_ULTIMATE.start_insert_sub_~head.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_sub_~sub~0.base (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_insert_sub_~sub~0.base) ULTIMATE.start_insert_sub_~sub~0.offset v_DerPreprocessor_25) .cse1 v_DerPreprocessor_26) .cse2 v_DerPreprocessor_27) .cse3 v_DerPreprocessor_28)) c_ULTIMATE.start_insert_sub_~head.base) .cse4)))))) is different from false [2021-11-03 03:50:27,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 03:50:27,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 03:50:56,178 WARN L207 SmtUtils]: Spent 28.54 s on a formula simplification that was a NOOP. DAG size: 1332 [2021-11-03 03:50:56,436 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-03 03:50:56,438 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 9330607 treesize of output 9330606 [2021-11-03 03:51:24,845 WARN L207 SmtUtils]: Spent 28.41 s on a formula simplification that was a NOOP. DAG size: 1331 [2021-11-03 03:51:52,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 03:51:52,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:51:52,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-03 03:51:52,229 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-11-03 03:51:52,229 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-11-03 03:51:52,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 03:51:52,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 03:51:52,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 03:51:52,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 03:51:52,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 03:51:52,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 03:51:52,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 03:51:52,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 03:51:52,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 03:51:52,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-03 03:51:52,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 03:51:52,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 03:51:52,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-03 03:51:52,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 03:51:52,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 03:51:52,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-03 03:51:52,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-03 03:51:52,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-03 03:51:52,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 03:51:52,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-03 03:51:52,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 03:51:52,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 03:51:52,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-03 03:51:52,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-03 03:51:52,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-03 03:51:52,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-03 03:51:52,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-03 03:51:52,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-03 03:51:52,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-03 03:51:52,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-03 03:51:52,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-03 03:51:52,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-03 03:51:52,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-03 03:51:52,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-03 03:51:52,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-03 03:51:52,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-03 03:51:52,243 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-03 03:51:52,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-03 03:51:52,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-03 03:51:52,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-03 03:51:52,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-03 03:51:52,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-03 03:51:52,244 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-03 03:51:52,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-03 03:51:52,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-11-03 03:51:52,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-03 03:51:52,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-03 03:51:52,245 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-03 03:51:52,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-03 03:51:52,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-03 03:51:52,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,246 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-03 03:51:52,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-03 03:51:52,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-03 03:51:52,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-03 03:51:52,247 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:51:52,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:51:52,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-11-03 03:51:52,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2021-11-03 03:51:52,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-03 03:51:52,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 03:51:52,880 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:51:52,883 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 03:51:52,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:51:52 BoogieIcfgContainer [2021-11-03 03:51:52,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 03:51:52,896 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 03:51:52,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 03:51:52,897 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 03:51:52,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:45:46" (3/4) ... [2021-11-03 03:51:52,900 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 03:51:52,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 03:51:52,902 INFO L168 Benchmark]: Toolchain (without parser) took 368240.87 ms. Allocated memory was 54.5 MB in the beginning and 434.1 MB in the end (delta: 379.6 MB). Free memory was 29.8 MB in the beginning and 230.5 MB in the end (delta: -200.6 MB). Peak memory consumption was 176.9 MB. Max. memory is 16.1 GB. [2021-11-03 03:51:52,902 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 36.0 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:51:52,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.76 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 29.7 MB in the beginning and 44.4 MB in the end (delta: -14.7 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-11-03 03:51:52,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.52 ms. Allocated memory is still 73.4 MB. Free memory was 44.4 MB in the beginning and 41.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 03:51:52,905 INFO L168 Benchmark]: Boogie Preprocessor took 49.74 ms. Allocated memory is still 73.4 MB. Free memory was 41.9 MB in the beginning and 54.2 MB in the end (delta: -12.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:51:52,906 INFO L168 Benchmark]: RCFGBuilder took 1045.17 ms. Allocated memory is still 73.4 MB. Free memory was 54.2 MB in the beginning and 45.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-03 03:51:52,906 INFO L168 Benchmark]: TraceAbstraction took 366421.60 ms. Allocated memory was 73.4 MB in the beginning and 434.1 MB in the end (delta: 360.7 MB). Free memory was 44.9 MB in the beginning and 231.5 MB in the end (delta: -186.6 MB). Peak memory consumption was 265.0 MB. Max. memory is 16.1 GB. [2021-11-03 03:51:52,908 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 434.1 MB. Free memory was 231.5 MB in the beginning and 230.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:51:52,911 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.23 ms. Allocated memory is still 54.5 MB. Free memory was 36.0 MB in the beginning and 36.0 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 632.76 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 29.7 MB in the beginning and 44.4 MB in the end (delta: -14.7 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.52 ms. Allocated memory is still 73.4 MB. Free memory was 44.4 MB in the beginning and 41.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.74 ms. Allocated memory is still 73.4 MB. Free memory was 41.9 MB in the beginning and 54.2 MB in the end (delta: -12.4 MB). Peak memory consumption was 6.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1045.17 ms. Allocated memory is still 73.4 MB. Free memory was 54.2 MB in the beginning and 45.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 366421.60 ms. Allocated memory was 73.4 MB in the beginning and 434.1 MB in the end (delta: 360.7 MB). Free memory was 44.9 MB in the beginning and 231.5 MB in the end (delta: -186.6 MB). Peak memory consumption was 265.0 MB. Max. memory is 16.1 GB. * Witness Printer took 4.58 ms. Allocated memory is still 434.1 MB. Free memory was 231.5 MB in the beginning and 230.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L602] struct list_head top = { &(top), &(top) }; [L587] struct top_list *top = malloc(sizeof(*top)); [L588] COND FALSE !(!top) [L579] sub->prev = sub [L580] sub->next = sub [L571] struct sub_list *sub = malloc(sizeof(*sub)); [L572] COND FALSE !(!sub) [L574] sub->number = 0 [L538] head->prev [L531] next->prev = new [L532] new->next = next [L533] new->prev = prev [L534] prev->next = new - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 574]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 574]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 574]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 574]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 532]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 533]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 534]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: 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, 137 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 366.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 61.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 961 SDtfs, 2973 SDslu, 1718 SDs, 0 SdLazy, 2182 SolverSat, 196 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 115 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 60.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=0, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 349 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 138.6s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 280 ConstructedInterpolants, 24 QuantifiedInterpolants, 2330 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1289 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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-11-03 03:51:52,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d92b894e-7758-4b22-a740-4e544a693462/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN