./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:51:33,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:51:33,375 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 14:51:33,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:51:33,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:51:33,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:51:33,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:51:33,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:51:33,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:51:33,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:51:33,407 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:51:33,407 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:51:33,408 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:51:33,408 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 14:51:33,409 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:51:33,409 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:51:33,409 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 14:51:33,410 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 14:51:33,410 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:51:33,411 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 14:51:33,411 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 14:51:33,412 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 14:51:33,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:51:33,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:51:33,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:51:33,414 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:51:33,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:51:33,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:51:33,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:51:33,416 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:51:33,416 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:51:33,416 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:51:33,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:51:33,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:51:33,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:51:33,417 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:51:33,417 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:51:33,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:51:33,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:51:33,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:51:33,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:51:33,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:51:33,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:51:33,419 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 14:51:33,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 14:51:33,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:51:33,419 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:51:33,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:51:33,420 INFO L153 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_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/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_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2023-12-02 14:51:33,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:51:33,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:51:33,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:51:33,673 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:51:33,674 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:51:33,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-12-02 14:51:36,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:51:36,678 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:51:36,678 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-12-02 14:51:36,697 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data/b15c2ed67/64ea5ab0e82c40f4a8417fd1a9e41a4a/FLAGd8a5893a9 [2023-12-02 14:51:36,709 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data/b15c2ed67/64ea5ab0e82c40f4a8417fd1a9e41a4a [2023-12-02 14:51:36,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:51:36,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:51:36,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:51:36,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:51:36,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:51:36,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:51:36" (1/1) ... [2023-12-02 14:51:36,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2827479c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:36, skipping insertion in model container [2023-12-02 14:51:36,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:51:36" (1/1) ... [2023-12-02 14:51:36,781 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:51:37,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:51:37,346 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-12-02 14:51:37,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@493ff78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:37, skipping insertion in model container [2023-12-02 14:51:37,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:51:37,347 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 14:51:37,349 INFO L158 Benchmark]: Toolchain (without parser) took 636.01ms. Allocated memory is still 174.1MB. Free memory was 123.0MB in the beginning and 101.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 14:51:37,350 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 14:51:37,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.81ms. Allocated memory is still 174.1MB. Free memory was 123.0MB in the beginning and 101.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 14:51:37,352 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.81ms. Allocated memory is still 174.1MB. Free memory was 123.0MB in the beginning and 101.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes 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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 14:51:39,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 14:51:39,200 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 14:51:39,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 14:51:39,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 14:51:39,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 14:51:39,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 14:51:39,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 14:51:39,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 14:51:39,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 14:51:39,238 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 14:51:39,238 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 14:51:39,239 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 14:51:39,239 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 14:51:39,240 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 14:51:39,240 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 14:51:39,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 14:51:39,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 14:51:39,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 14:51:39,243 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 14:51:39,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 14:51:39,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 14:51:39,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 14:51:39,245 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 14:51:39,246 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 14:51:39,246 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 14:51:39,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 14:51:39,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 14:51:39,247 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 14:51:39,248 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 14:51:39,248 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 14:51:39,248 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 14:51:39,249 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 14:51:39,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 14:51:39,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 14:51:39,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 14:51:39,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 14:51:39,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:51:39,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 14:51:39,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 14:51:39,251 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 14:51:39,251 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 14:51:39,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 14:51:39,251 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 14:51:39,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 14:51:39,252 INFO L153 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_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/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_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2023-12-02 14:51:39,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 14:51:39,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 14:51:39,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 14:51:39,548 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 14:51:39,548 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 14:51:39,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-12-02 14:51:42,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 14:51:42,632 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 14:51:42,632 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2023-12-02 14:51:42,653 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data/eb4314cb3/ce227232d73d4d6888f5be758a9a8ef3/FLAGe39b20e3c [2023-12-02 14:51:42,669 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/data/eb4314cb3/ce227232d73d4d6888f5be758a9a8ef3 [2023-12-02 14:51:42,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 14:51:42,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 14:51:42,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 14:51:42,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 14:51:42,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 14:51:42,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:51:42" (1/1) ... [2023-12-02 14:51:42,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5501db62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:42, skipping insertion in model container [2023-12-02 14:51:42,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:51:42" (1/1) ... [2023-12-02 14:51:42,753 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:51:43,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:51:43,463 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 14:51:43,478 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 14:51:43,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:51:43,589 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 14:51:43,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 14:51:43,746 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 14:51:43,752 INFO L206 MainTranslator]: Completed translation [2023-12-02 14:51:43,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43 WrapperNode [2023-12-02 14:51:43,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 14:51:43,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 14:51:43,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 14:51:43,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 14:51:43,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,842 INFO L138 Inliner]: procedures = 285, calls = 298, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1048 [2023-12-02 14:51:43,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 14:51:43,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 14:51:43,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 14:51:43,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 14:51:43,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 14:51:43,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 14:51:43,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 14:51:43,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 14:51:43,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (1/1) ... [2023-12-02 14:51:43,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 14:51:43,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:51:43,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 14:51:43,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 14:51:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 14:51:44,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 14:51:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 14:51:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 14:51:44,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 14:51:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 14:51:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 14:51:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 14:51:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 14:51:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 14:51:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2023-12-02 14:51:44,030 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2023-12-02 14:51:44,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 14:51:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 14:51:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 14:51:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 14:51:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2023-12-02 14:51:44,031 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2023-12-02 14:51:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 14:51:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2023-12-02 14:51:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2023-12-02 14:51:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 14:51:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 14:51:44,246 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 14:51:44,248 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 14:51:48,500 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 14:51:48,642 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 14:51:48,642 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 14:51:48,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:51:48 BoogieIcfgContainer [2023-12-02 14:51:48,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 14:51:48,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 14:51:48,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 14:51:48,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 14:51:48,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:51:42" (1/3) ... [2023-12-02 14:51:48,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9c7f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:51:48, skipping insertion in model container [2023-12-02 14:51:48,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:51:43" (2/3) ... [2023-12-02 14:51:48,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9c7f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:51:48, skipping insertion in model container [2023-12-02 14:51:48,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:51:48" (3/3) ... [2023-12-02 14:51:48,651 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2023-12-02 14:51:48,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 14:51:48,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 528 error locations. [2023-12-02 14:51:48,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 14:51:48,728 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69c698c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 14:51:48,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 528 error locations. [2023-12-02 14:51:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 14:51:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:51:48,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:51:48,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:51:48,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:51:48,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:51:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash 55333, now seen corresponding path program 1 times [2023-12-02 14:51:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:51:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71931206] [2023-12-02 14:51:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:51:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:51:48,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:51:48,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:51:48,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 14:51:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:51:48,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:51:48,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:51:48,988 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:51:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:51:49,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:51:49,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:51:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71931206] [2023-12-02 14:51:49,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71931206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:51:49,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:51:49,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:51:49,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668104121] [2023-12-02 14:51:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:51:49,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:51:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:51:49,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:51:49,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:51:49,050 INFO L87 Difference]: Start difference. First operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:51:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:51:50,962 INFO L93 Difference]: Finished difference Result 1054 states and 1123 transitions. [2023-12-02 14:51:50,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:51:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 14:51:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:51:50,980 INFO L225 Difference]: With dead ends: 1054 [2023-12-02 14:51:50,980 INFO L226 Difference]: Without dead ends: 1053 [2023-12-02 14:51:50,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:51:50,985 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 650 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:51:50,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 862 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 14:51:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-12-02 14:51:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2023-12-02 14:51:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 459 states have (on average 2.3398692810457518) internal successors, (1074), 977 states have internal predecessors, (1074), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:51:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1104 transitions. [2023-12-02 14:51:51,057 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1104 transitions. Word has length 2 [2023-12-02 14:51:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:51:51,057 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1104 transitions. [2023-12-02 14:51:51,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:51:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1104 transitions. [2023-12-02 14:51:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 14:51:51,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:51:51,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 14:51:51,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 14:51:51,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:51:51,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:51:51,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:51:51,260 INFO L85 PathProgramCache]: Analyzing trace with hash 55334, now seen corresponding path program 1 times [2023-12-02 14:51:51,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:51:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518138128] [2023-12-02 14:51:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:51:51,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:51:51,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:51:51,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:51:51,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 14:51:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:51:51,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:51:51,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:51:51,380 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:51:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:51:51,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:51:51,391 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:51:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518138128] [2023-12-02 14:51:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518138128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:51:51,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:51:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:51:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554797902] [2023-12-02 14:51:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:51:51,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:51:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:51:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:51:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:51:51,394 INFO L87 Difference]: Start difference. First operand 995 states and 1104 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:51:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:51:54,532 INFO L93 Difference]: Finished difference Result 1353 states and 1498 transitions. [2023-12-02 14:51:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:51:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 14:51:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:51:54,539 INFO L225 Difference]: With dead ends: 1353 [2023-12-02 14:51:54,540 INFO L226 Difference]: Without dead ends: 1353 [2023-12-02 14:51:54,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:51:54,541 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 382 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:51:54,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1265 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-02 14:51:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-12-02 14:51:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1165. [2023-12-02 14:51:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 628 states have (on average 2.3121019108280256) internal successors, (1452), 1145 states have internal predecessors, (1452), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 14:51:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1486 transitions. [2023-12-02 14:51:54,568 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1486 transitions. Word has length 2 [2023-12-02 14:51:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:51:54,568 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1486 transitions. [2023-12-02 14:51:54,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:51:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1486 transitions. [2023-12-02 14:51:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 14:51:54,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:51:54,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 14:51:54,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 14:51:54,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:51:54,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:51:54,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:51:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash -435639276, now seen corresponding path program 1 times [2023-12-02 14:51:54,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:51:54,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278896261] [2023-12-02 14:51:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:51:54,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:51:54,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:51:54,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:51:54,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 14:51:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:51:54,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:51:54,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:51:54,911 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:51:54,916 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:51:54,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:51:54,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-12-02 14:51:55,002 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:51:55,002 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:51:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:51:55,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:51:55,025 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:51:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278896261] [2023-12-02 14:51:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278896261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:51:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:51:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:51:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346477744] [2023-12-02 14:51:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:51:55,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:51:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:51:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:51:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:51:55,027 INFO L87 Difference]: Start difference. First operand 1165 states and 1486 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 14:51:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:51:59,011 INFO L93 Difference]: Finished difference Result 1792 states and 2170 transitions. [2023-12-02 14:51:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:51:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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 [2023-12-02 14:51:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:51:59,022 INFO L225 Difference]: With dead ends: 1792 [2023-12-02 14:51:59,022 INFO L226 Difference]: Without dead ends: 1792 [2023-12-02 14:51:59,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:51:59,023 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 1292 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:51:59,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1013 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 14:51:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-12-02 14:51:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1281. [2023-12-02 14:51:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 744 states have (on average 2.293010752688172) internal successors, (1706), 1261 states have internal predecessors, (1706), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 14:51:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1740 transitions. [2023-12-02 14:51:59,062 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1740 transitions. Word has length 6 [2023-12-02 14:51:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:51:59,063 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1740 transitions. [2023-12-02 14:51:59,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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) [2023-12-02 14:51:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1740 transitions. [2023-12-02 14:51:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:51:59,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:51:59,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:51:59,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 14:51:59,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:51:59,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:51:59,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:51:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash -619915645, now seen corresponding path program 1 times [2023-12-02 14:51:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:51:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949970377] [2023-12-02 14:51:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:51:59,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:51:59,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:51:59,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:51:59,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 14:51:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:51:59,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 14:51:59,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:51:59,403 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:51:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:51:59,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:51:59,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:51:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949970377] [2023-12-02 14:51:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949970377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:51:59,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:51:59,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:51:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419585725] [2023-12-02 14:51:59,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:51:59,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:51:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:51:59,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:51:59,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:51:59,418 INFO L87 Difference]: Start difference. First operand 1281 states and 1740 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:01,563 INFO L93 Difference]: Finished difference Result 1760 states and 2444 transitions. [2023-12-02 14:52:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:52:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 14:52:01,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:01,572 INFO L225 Difference]: With dead ends: 1760 [2023-12-02 14:52:01,573 INFO L226 Difference]: Without dead ends: 1760 [2023-12-02 14:52:01,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:01,574 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 869 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:01,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1073 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 14:52:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2023-12-02 14:52:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1236. [2023-12-02 14:52:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 744 states have (on average 2.213709677419355) internal successors, (1647), 1216 states have internal predecessors, (1647), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 14:52:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1681 transitions. [2023-12-02 14:52:01,609 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1681 transitions. Word has length 7 [2023-12-02 14:52:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:01,609 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1681 transitions. [2023-12-02 14:52:01,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1681 transitions. [2023-12-02 14:52:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 14:52:01,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:01,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:01,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 14:52:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:01,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:01,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -619915644, now seen corresponding path program 1 times [2023-12-02 14:52:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:01,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047173273] [2023-12-02 14:52:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:01,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:01,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:01,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 14:52:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:01,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:52:01,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:01,915 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:52:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:01,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:01,939 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:01,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047173273] [2023-12-02 14:52:01,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047173273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:01,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:01,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:52:01,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582120598] [2023-12-02 14:52:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:01,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:52:01,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:01,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:52:01,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:01,941 INFO L87 Difference]: Start difference. First operand 1236 states and 1681 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:05,073 INFO L93 Difference]: Finished difference Result 1793 states and 2433 transitions. [2023-12-02 14:52:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:52:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 14:52:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:05,082 INFO L225 Difference]: With dead ends: 1793 [2023-12-02 14:52:05,083 INFO L226 Difference]: Without dead ends: 1793 [2023-12-02 14:52:05,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:05,084 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 620 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:05,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1340 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-02 14:52:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2023-12-02 14:52:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1226. [2023-12-02 14:52:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 744 states have (on average 2.181451612903226) internal successors, (1623), 1206 states have internal predecessors, (1623), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 14:52:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1657 transitions. [2023-12-02 14:52:05,120 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1657 transitions. Word has length 7 [2023-12-02 14:52:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:05,120 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1657 transitions. [2023-12-02 14:52:05,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1657 transitions. [2023-12-02 14:52:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 14:52:05,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:05,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:05,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 14:52:05,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:05,322 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:05,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash -3807760, now seen corresponding path program 1 times [2023-12-02 14:52:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:05,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712327812] [2023-12-02 14:52:05,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:05,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:05,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:05,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:05,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-02 14:52:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:05,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:52:05,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:05,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:05,508 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712327812] [2023-12-02 14:52:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712327812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:05,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:05,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:52:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793373775] [2023-12-02 14:52:05,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:05,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:52:05,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:05,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:52:05,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:05,510 INFO L87 Difference]: Start difference. First operand 1226 states and 1657 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:07,430 INFO L93 Difference]: Finished difference Result 1658 states and 2181 transitions. [2023-12-02 14:52:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:52:07,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 14:52:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:07,438 INFO L225 Difference]: With dead ends: 1658 [2023-12-02 14:52:07,439 INFO L226 Difference]: Without dead ends: 1658 [2023-12-02 14:52:07,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:07,440 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 494 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:07,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2481 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 14:52:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2023-12-02 14:52:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1436. [2023-12-02 14:52:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 954 states have (on average 2.190775681341719) internal successors, (2090), 1416 states have internal predecessors, (2090), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 14:52:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2124 transitions. [2023-12-02 14:52:07,481 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2124 transitions. Word has length 12 [2023-12-02 14:52:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:07,481 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 2124 transitions. [2023-12-02 14:52:07,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2124 transitions. [2023-12-02 14:52:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 14:52:07,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:07,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:07,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-02 14:52:07,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:07,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:07,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -592731144, now seen corresponding path program 1 times [2023-12-02 14:52:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423252536] [2023-12-02 14:52:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:07,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:07,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:07,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-02 14:52:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:07,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:52:07,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:07,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:07,807 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423252536] [2023-12-02 14:52:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423252536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:52:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679987934] [2023-12-02 14:52:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:07,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:52:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:07,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:52:07,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:07,809 INFO L87 Difference]: Start difference. First operand 1436 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:08,594 INFO L93 Difference]: Finished difference Result 1352 states and 1964 transitions. [2023-12-02 14:52:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:52:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 14:52:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:08,601 INFO L225 Difference]: With dead ends: 1352 [2023-12-02 14:52:08,601 INFO L226 Difference]: Without dead ends: 1352 [2023-12-02 14:52:08,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:08,602 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 70 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:08,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1583 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 14:52:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-02 14:52:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2023-12-02 14:52:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 894 states have (on average 2.1588366890380315) internal successors, (1930), 1332 states have internal predecessors, (1930), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 14:52:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1964 transitions. [2023-12-02 14:52:08,632 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1964 transitions. Word has length 12 [2023-12-02 14:52:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:08,632 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1964 transitions. [2023-12-02 14:52:08,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1964 transitions. [2023-12-02 14:52:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 14:52:08,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:08,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:08,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-02 14:52:08,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:08,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:08,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1869888457, now seen corresponding path program 1 times [2023-12-02 14:52:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606001257] [2023-12-02 14:52:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:08,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:08,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:08,838 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:08,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 14:52:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:08,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 14:52:08,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:08,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:52:08,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:52:08,986 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 14:52:08,990 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 39 [2023-12-02 14:52:09,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:52:09,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-12-02 14:52:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:09,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:09,074 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606001257] [2023-12-02 14:52:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606001257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:09,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:52:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818269135] [2023-12-02 14:52:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:09,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:52:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:09,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:52:09,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:09,077 INFO L87 Difference]: Start difference. First operand 1352 states and 1964 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:10,958 INFO L93 Difference]: Finished difference Result 1382 states and 1742 transitions. [2023-12-02 14:52:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:52:10,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 14:52:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:10,966 INFO L225 Difference]: With dead ends: 1382 [2023-12-02 14:52:10,966 INFO L226 Difference]: Without dead ends: 1382 [2023-12-02 14:52:10,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:10,967 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 290 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:10,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2405 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 14:52:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2023-12-02 14:52:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1085. [2023-12-02 14:52:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 629 states have (on average 2.1446740858505566) internal successors, (1349), 1067 states have internal predecessors, (1349), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:52:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1379 transitions. [2023-12-02 14:52:10,985 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1379 transitions. Word has length 15 [2023-12-02 14:52:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:10,985 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1379 transitions. [2023-12-02 14:52:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1379 transitions. [2023-12-02 14:52:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 14:52:10,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:10,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:10,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-02 14:52:11,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:11,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:11,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1792162074, now seen corresponding path program 1 times [2023-12-02 14:52:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210054529] [2023-12-02 14:52:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:11,189 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:11,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-02 14:52:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:11,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 14:52:11,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:11,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:11,363 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:11,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210054529] [2023-12-02 14:52:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210054529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:52:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288921709] [2023-12-02 14:52:11,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:11,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:52:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:11,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:52:11,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:11,365 INFO L87 Difference]: Start difference. First operand 1085 states and 1379 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2023-12-02 14:52:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:12,123 INFO L93 Difference]: Finished difference Result 1031 states and 1299 transitions. [2023-12-02 14:52:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:52:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 [2023-12-02 14:52:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:12,129 INFO L225 Difference]: With dead ends: 1031 [2023-12-02 14:52:12,129 INFO L226 Difference]: Without dead ends: 1031 [2023-12-02 14:52:12,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:12,129 INFO L413 NwaCegarLoop]: 779 mSDtfsCounter, 70 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:12,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1509 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 14:52:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-12-02 14:52:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2023-12-02 14:52:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 599 states have (on average 2.1185308848080133) internal successors, (1269), 1013 states have internal predecessors, (1269), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:52:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1299 transitions. [2023-12-02 14:52:12,150 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1299 transitions. Word has length 15 [2023-12-02 14:52:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:12,150 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1299 transitions. [2023-12-02 14:52:12,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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) [2023-12-02 14:52:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1299 transitions. [2023-12-02 14:52:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 14:52:12,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:12,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:12,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-02 14:52:12,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:12,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:12,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash -14134636, now seen corresponding path program 1 times [2023-12-02 14:52:12,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:12,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240270038] [2023-12-02 14:52:12,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:12,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:12,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:12,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-02 14:52:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:12,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:52:12,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:12,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:12,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:12,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240270038] [2023-12-02 14:52:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240270038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:12,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:12,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:52:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283425111] [2023-12-02 14:52:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:12,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:52:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:52:12,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:12,549 INFO L87 Difference]: Start difference. First operand 1031 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2023-12-02 14:52:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:13,508 INFO L93 Difference]: Finished difference Result 1017 states and 1257 transitions. [2023-12-02 14:52:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:52:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 14:52:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:13,513 INFO L225 Difference]: With dead ends: 1017 [2023-12-02 14:52:13,513 INFO L226 Difference]: Without dead ends: 1017 [2023-12-02 14:52:13,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:13,514 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 58 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:13,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2220 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 14:52:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2023-12-02 14:52:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2023-12-02 14:52:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 597 states have (on average 2.0519262981574538) internal successors, (1225), 997 states have internal predecessors, (1225), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:52:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1255 transitions. [2023-12-02 14:52:13,527 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1255 transitions. Word has length 17 [2023-12-02 14:52:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:13,527 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1255 transitions. [2023-12-02 14:52:13,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) [2023-12-02 14:52:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1255 transitions. [2023-12-02 14:52:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 14:52:13,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:13,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:13,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-02 14:52:13,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:13,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:13,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash 734266083, now seen corresponding path program 1 times [2023-12-02 14:52:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749698047] [2023-12-02 14:52:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:13,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:13,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:13,731 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:13,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 14:52:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:13,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:52:13,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:13,895 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:52:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:14,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:14,050 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:14,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749698047] [2023-12-02 14:52:14,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749698047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:14,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:14,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:52:14,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636270945] [2023-12-02 14:52:14,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:14,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:52:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:14,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:52:14,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:14,052 INFO L87 Difference]: Start difference. First operand 1015 states and 1255 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:17,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:17,938 INFO L93 Difference]: Finished difference Result 1482 states and 1848 transitions. [2023-12-02 14:52:17,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:52:17,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 14:52:17,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:17,946 INFO L225 Difference]: With dead ends: 1482 [2023-12-02 14:52:17,946 INFO L226 Difference]: Without dead ends: 1482 [2023-12-02 14:52:17,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:17,947 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 523 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:17,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1885 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 14:52:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2023-12-02 14:52:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1011. [2023-12-02 14:52:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 597 states have (on average 2.0385259631490786) internal successors, (1217), 993 states have internal predecessors, (1217), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:52:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1247 transitions. [2023-12-02 14:52:17,967 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1247 transitions. Word has length 31 [2023-12-02 14:52:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:17,967 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1247 transitions. [2023-12-02 14:52:17,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1247 transitions. [2023-12-02 14:52:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 14:52:17,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:17,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:17,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 14:52:18,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:18,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:18,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash 734266082, now seen corresponding path program 1 times [2023-12-02 14:52:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405497492] [2023-12-02 14:52:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:18,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:18,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:18,171 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:18,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 14:52:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:18,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:52:18,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:18,328 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:52:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:18,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:18,389 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:18,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405497492] [2023-12-02 14:52:18,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405497492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:18,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 14:52:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428988267] [2023-12-02 14:52:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:18,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:52:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:18,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:52:18,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:18,391 INFO L87 Difference]: Start difference. First operand 1011 states and 1247 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:20,746 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2023-12-02 14:52:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:52:20,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 14:52:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:20,753 INFO L225 Difference]: With dead ends: 1391 [2023-12-02 14:52:20,753 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 14:52:20,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:20,754 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 754 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:20,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1032 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 14:52:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 14:52:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1007. [2023-12-02 14:52:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 597 states have (on average 2.0251256281407035) internal successors, (1209), 989 states have internal predecessors, (1209), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:52:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1239 transitions. [2023-12-02 14:52:20,769 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1239 transitions. Word has length 31 [2023-12-02 14:52:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:20,769 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1239 transitions. [2023-12-02 14:52:20,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1239 transitions. [2023-12-02 14:52:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 14:52:20,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:20,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:20,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 14:52:20,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:20,973 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:20,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2030840777, now seen corresponding path program 1 times [2023-12-02 14:52:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217394496] [2023-12-02 14:52:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:20,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:20,974 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:20,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 14:52:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:21,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 14:52:21,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:21,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:21,227 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217394496] [2023-12-02 14:52:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217394496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:52:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91696638] [2023-12-02 14:52:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:21,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:52:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:52:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:21,229 INFO L87 Difference]: Start difference. First operand 1007 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:22,131 INFO L93 Difference]: Finished difference Result 995 states and 1219 transitions. [2023-12-02 14:52:22,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:52:22,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-02 14:52:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:22,137 INFO L225 Difference]: With dead ends: 995 [2023-12-02 14:52:22,137 INFO L226 Difference]: Without dead ends: 995 [2023-12-02 14:52:22,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:22,138 INFO L413 NwaCegarLoop]: 742 mSDtfsCounter, 23 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:22,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2206 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 14:52:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2023-12-02 14:52:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2023-12-02 14:52:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 585 states have (on average 2.0324786324786324) internal successors, (1189), 977 states have internal predecessors, (1189), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 14:52:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1219 transitions. [2023-12-02 14:52:22,150 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1219 transitions. Word has length 51 [2023-12-02 14:52:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:22,150 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1219 transitions. [2023-12-02 14:52:22,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1219 transitions. [2023-12-02 14:52:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 14:52:22,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:22,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:22,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 14:52:22,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:22,352 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:22,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890552, now seen corresponding path program 1 times [2023-12-02 14:52:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:22,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041594374] [2023-12-02 14:52:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:22,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:22,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:22,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:22,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 14:52:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:22,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 14:52:22,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:22,697 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 14:52:22,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-12-02 14:52:22,741 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 14:52:22,742 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-12-02 14:52:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:23,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:23,069 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041594374] [2023-12-02 14:52:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041594374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:23,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:23,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 14:52:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953026795] [2023-12-02 14:52:23,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:23,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 14:52:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:23,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 14:52:23,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:23,072 INFO L87 Difference]: Start difference. First operand 995 states and 1219 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:25,397 INFO L93 Difference]: Finished difference Result 1813 states and 2222 transitions. [2023-12-02 14:52:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 14:52:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-02 14:52:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:25,406 INFO L225 Difference]: With dead ends: 1813 [2023-12-02 14:52:25,406 INFO L226 Difference]: Without dead ends: 1813 [2023-12-02 14:52:25,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 14:52:25,406 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 713 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:25,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 918 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 14:52:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-12-02 14:52:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1343. [2023-12-02 14:52:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 918 states have (on average 2.02723311546841) internal successors, (1861), 1313 states have internal predecessors, (1861), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 14:52:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1915 transitions. [2023-12-02 14:52:25,427 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1915 transitions. Word has length 55 [2023-12-02 14:52:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:25,427 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1915 transitions. [2023-12-02 14:52:25,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1915 transitions. [2023-12-02 14:52:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 14:52:25,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:25,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:25,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-02 14:52:25,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:25,632 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:25,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890553, now seen corresponding path program 1 times [2023-12-02 14:52:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954379053] [2023-12-02 14:52:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:25,634 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:25,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 14:52:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:25,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 14:52:25,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:25,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:52:25,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-12-02 14:52:26,047 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 14:52:26,047 INFO L378 Elim1Store]: Elim1 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 14 [2023-12-02 14:52:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:26,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:26,654 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:26,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954379053] [2023-12-02 14:52:26,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954379053] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:26,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:26,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 14:52:26,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088275857] [2023-12-02 14:52:26,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:26,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 14:52:26,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:26,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 14:52:26,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:26,656 INFO L87 Difference]: Start difference. First operand 1343 states and 1915 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:29,639 INFO L93 Difference]: Finished difference Result 1348 states and 1921 transitions. [2023-12-02 14:52:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 14:52:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-02 14:52:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:29,646 INFO L225 Difference]: With dead ends: 1348 [2023-12-02 14:52:29,646 INFO L226 Difference]: Without dead ends: 1348 [2023-12-02 14:52:29,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 14:52:29,647 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:29,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 14:52:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2023-12-02 14:52:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1348. [2023-12-02 14:52:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 922 states have (on average 2.022776572668113) internal successors, (1865), 1317 states have internal predecessors, (1865), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-02 14:52:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1921 transitions. [2023-12-02 14:52:29,667 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1921 transitions. Word has length 55 [2023-12-02 14:52:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:29,668 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1921 transitions. [2023-12-02 14:52:29,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1921 transitions. [2023-12-02 14:52:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 14:52:29,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:29,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:29,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 14:52:29,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:29,869 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:29,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash 298511460, now seen corresponding path program 1 times [2023-12-02 14:52:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:29,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581430643] [2023-12-02 14:52:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:29,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:29,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:29,871 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:29,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 14:52:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:30,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:52:30,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:30,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:30,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581430643] [2023-12-02 14:52:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581430643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:52:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581356944] [2023-12-02 14:52:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:30,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:52:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:52:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:52:30,256 INFO L87 Difference]: Start difference. First operand 1348 states and 1921 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:52:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:31,772 INFO L93 Difference]: Finished difference Result 1352 states and 1929 transitions. [2023-12-02 14:52:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 14:52:31,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-12-02 14:52:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:31,780 INFO L225 Difference]: With dead ends: 1352 [2023-12-02 14:52:31,781 INFO L226 Difference]: Without dead ends: 1352 [2023-12-02 14:52:31,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 14:52:31,781 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 19 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:31,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2897 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 14:52:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-02 14:52:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2023-12-02 14:52:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 923 states have (on average 2.021668472372698) internal successors, (1866), 1318 states have internal predecessors, (1866), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (29), 22 states have call predecessors, (29), 26 states have call successors, (29) [2023-12-02 14:52:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1925 transitions. [2023-12-02 14:52:31,804 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1925 transitions. Word has length 59 [2023-12-02 14:52:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:31,804 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1925 transitions. [2023-12-02 14:52:31,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 14:52:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1925 transitions. [2023-12-02 14:52:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 14:52:31,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:31,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:31,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-02 14:52:32,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:32,012 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:32,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1320167083, now seen corresponding path program 1 times [2023-12-02 14:52:32,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:32,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40794364] [2023-12-02 14:52:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:32,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:32,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:32,014 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:32,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 14:52:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:32,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:52:32,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:32,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:32,324 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40794364] [2023-12-02 14:52:32,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40794364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 14:52:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611957671] [2023-12-02 14:52:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:32,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:52:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:32,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:52:32,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 14:52:32,326 INFO L87 Difference]: Start difference. First operand 1350 states and 1925 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:33,734 INFO L93 Difference]: Finished difference Result 1374 states and 1949 transitions. [2023-12-02 14:52:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:52:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-02 14:52:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:33,743 INFO L225 Difference]: With dead ends: 1374 [2023-12-02 14:52:33,743 INFO L226 Difference]: Without dead ends: 1374 [2023-12-02 14:52:33,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:52:33,743 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 16 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3763 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:33,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3763 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 14:52:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-12-02 14:52:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1370. [2023-12-02 14:52:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 937 states have (on average 2.0117395944503733) internal successors, (1885), 1334 states have internal predecessors, (1885), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 14:52:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1946 transitions. [2023-12-02 14:52:33,766 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1946 transitions. Word has length 62 [2023-12-02 14:52:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:33,766 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1946 transitions. [2023-12-02 14:52:33,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 14:52:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1946 transitions. [2023-12-02 14:52:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 14:52:33,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:33,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:33,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-02 14:52:33,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:33,968 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:33,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192545, now seen corresponding path program 1 times [2023-12-02 14:52:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963631611] [2023-12-02 14:52:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:33,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:33,971 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:33,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 14:52:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:34,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 14:52:34,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:34,387 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:52:34,488 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2023-12-02 14:52:34,503 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 14:52:34,504 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-12-02 14:52:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:34,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:34,514 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:34,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963631611] [2023-12-02 14:52:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963631611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:34,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 14:52:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234848385] [2023-12-02 14:52:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:34,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:52:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:34,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:52:34,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 14:52:34,516 INFO L87 Difference]: Start difference. First operand 1370 states and 1946 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:52:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:36,927 INFO L93 Difference]: Finished difference Result 1753 states and 2454 transitions. [2023-12-02 14:52:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:52:36,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-12-02 14:52:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:36,934 INFO L225 Difference]: With dead ends: 1753 [2023-12-02 14:52:36,934 INFO L226 Difference]: Without dead ends: 1753 [2023-12-02 14:52:36,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 14:52:36,934 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 723 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:36,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 977 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1113 Invalid, 0 Unknown, 1207 Unchecked, 2.4s Time] [2023-12-02 14:52:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2023-12-02 14:52:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1369. [2023-12-02 14:52:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 937 states have (on average 2.0096051227321237) internal successors, (1883), 1333 states have internal predecessors, (1883), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 14:52:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1944 transitions. [2023-12-02 14:52:36,958 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1944 transitions. Word has length 64 [2023-12-02 14:52:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:36,959 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 1944 transitions. [2023-12-02 14:52:36,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:52:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1944 transitions. [2023-12-02 14:52:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 14:52:36,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:36,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:36,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-02 14:52:37,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:37,160 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:37,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192544, now seen corresponding path program 1 times [2023-12-02 14:52:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412006447] [2023-12-02 14:52:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:37,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:37,162 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:37,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-02 14:52:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:37,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 14:52:37,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:37,617 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:52:37,622 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:52:38,049 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2023-12-02 14:52:38,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 14:52:38,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-12-02 14:52:38,078 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:52:38,078 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:52:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:38,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:38,089 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:38,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412006447] [2023-12-02 14:52:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412006447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:38,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:52:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466859585] [2023-12-02 14:52:38,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:38,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 14:52:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:38,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 14:52:38,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-12-02 14:52:38,090 INFO L87 Difference]: Start difference. First operand 1369 states and 1944 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:52:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:43,824 INFO L93 Difference]: Finished difference Result 2312 states and 3241 transitions. [2023-12-02 14:52:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 14:52:43,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-12-02 14:52:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:43,831 INFO L225 Difference]: With dead ends: 2312 [2023-12-02 14:52:43,831 INFO L226 Difference]: Without dead ends: 2312 [2023-12-02 14:52:43,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-12-02 14:52:43,832 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 835 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1617 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:43,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1657 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2639 Invalid, 0 Unknown, 1617 Unchecked, 5.7s Time] [2023-12-02 14:52:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2023-12-02 14:52:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1365. [2023-12-02 14:52:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 941 states have (on average 1.9883103081827842) internal successors, (1871), 1329 states have internal predecessors, (1871), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 14:52:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1932 transitions. [2023-12-02 14:52:43,860 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1932 transitions. Word has length 64 [2023-12-02 14:52:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:43,860 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1932 transitions. [2023-12-02 14:52:43,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:52:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1932 transitions. [2023-12-02 14:52:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 14:52:43,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:43,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:43,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-02 14:52:44,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:44,061 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:44,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1110857919, now seen corresponding path program 1 times [2023-12-02 14:52:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278148592] [2023-12-02 14:52:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:44,063 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:44,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 14:52:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:44,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 14:52:44,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:44,374 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:52:44,394 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-12-02 14:52:44,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 14:52:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:44,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:44,446 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278148592] [2023-12-02 14:52:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278148592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:44,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 14:52:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389061096] [2023-12-02 14:52:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:44,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 14:52:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 14:52:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 14:52:44,448 INFO L87 Difference]: Start difference. First operand 1365 states and 1932 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:52:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:48,725 INFO L93 Difference]: Finished difference Result 1376 states and 1944 transitions. [2023-12-02 14:52:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 14:52:48,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-12-02 14:52:48,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:48,729 INFO L225 Difference]: With dead ends: 1376 [2023-12-02 14:52:48,729 INFO L226 Difference]: Without dead ends: 1376 [2023-12-02 14:52:48,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:52:48,730 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 14 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3256 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:48,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3256 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 14:52:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2023-12-02 14:52:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1375. [2023-12-02 14:52:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.9841938883034773) internal successors, (1883), 1337 states have internal predecessors, (1883), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 14:52:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1944 transitions. [2023-12-02 14:52:48,761 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1944 transitions. Word has length 70 [2023-12-02 14:52:48,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:48,762 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1944 transitions. [2023-12-02 14:52:48,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 14:52:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1944 transitions. [2023-12-02 14:52:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 14:52:48,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:48,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:48,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-02 14:52:48,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:48,963 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:48,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 76857197, now seen corresponding path program 1 times [2023-12-02 14:52:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980594494] [2023-12-02 14:52:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:48,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:48,966 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:48,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 14:52:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:49,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 14:52:49,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:49,284 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:52:49,322 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:52:49,333 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-12-02 14:52:49,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-02 14:52:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:49,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:49,459 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980594494] [2023-12-02 14:52:49,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980594494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:49,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:49,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 14:52:49,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983565052] [2023-12-02 14:52:49,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:49,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 14:52:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:49,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 14:52:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 14:52:49,461 INFO L87 Difference]: Start difference. First operand 1375 states and 1944 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:52:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:55,483 INFO L93 Difference]: Finished difference Result 1375 states and 1942 transitions. [2023-12-02 14:52:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 14:52:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2023-12-02 14:52:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:55,488 INFO L225 Difference]: With dead ends: 1375 [2023-12-02 14:52:55,488 INFO L226 Difference]: Without dead ends: 1375 [2023-12-02 14:52:55,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 14:52:55,489 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 12 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:55,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3828 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-02 14:52:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2023-12-02 14:52:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2023-12-02 14:52:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.982086406743941) internal successors, (1881), 1337 states have internal predecessors, (1881), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 14:52:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1942 transitions. [2023-12-02 14:52:55,510 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1942 transitions. Word has length 71 [2023-12-02 14:52:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:55,510 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1942 transitions. [2023-12-02 14:52:55,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 14:52:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1942 transitions. [2023-12-02 14:52:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 14:52:55,512 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:55,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:55,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-02 14:52:55,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:55,712 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:55,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash -998618493, now seen corresponding path program 1 times [2023-12-02 14:52:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368934168] [2023-12-02 14:52:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:55,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:55,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:55,714 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:55,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-02 14:52:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:56,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 14:52:56,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:56,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 14:52:56,036 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368934168] [2023-12-02 14:52:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368934168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 14:52:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 14:52:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 14:52:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474330169] [2023-12-02 14:52:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 14:52:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 14:52:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 14:52:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:56,038 INFO L87 Difference]: Start difference. First operand 1375 states and 1942 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:52:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:52:57,269 INFO L93 Difference]: Finished difference Result 1383 states and 1952 transitions. [2023-12-02 14:52:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 14:52:57,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2023-12-02 14:52:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:52:57,273 INFO L225 Difference]: With dead ends: 1383 [2023-12-02 14:52:57,273 INFO L226 Difference]: Without dead ends: 1381 [2023-12-02 14:52:57,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 14:52:57,274 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 4 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:52:57,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2966 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 14:52:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2023-12-02 14:52:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2023-12-02 14:52:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 953 states have (on average 1.9800629590766001) internal successors, (1887), 1343 states have internal predecessors, (1887), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 14:52:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1950 transitions. [2023-12-02 14:52:57,296 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1950 transitions. Word has length 76 [2023-12-02 14:52:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:52:57,296 INFO L495 AbstractCegarLoop]: Abstraction has 1381 states and 1950 transitions. [2023-12-02 14:52:57,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 14:52:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1950 transitions. [2023-12-02 14:52:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 14:52:57,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:52:57,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:52:57,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-02 14:52:57,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:57,498 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:52:57,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:52:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2135152941, now seen corresponding path program 1 times [2023-12-02 14:52:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:52:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443389601] [2023-12-02 14:52:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:57,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:52:57,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:52:57,499 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:52:57,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-02 14:52:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:57,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:52:57,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:57,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:52:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:57,988 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:52:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443389601] [2023-12-02 14:52:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443389601] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:52:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1973506968] [2023-12-02 14:52:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:57,988 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:52:57,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:52:57,989 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:52:57,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 14:52:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:58,528 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:52:58,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:58,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:52:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1973506968] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:52:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383582239] [2023-12-02 14:52:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:52:58,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:52:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:52:58,609 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:52:58,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 14:52:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:52:58,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 14:52:58,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:52:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:58,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:52:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:52:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383582239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:52:58,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:52:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2023-12-02 14:52:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055624727] [2023-12-02 14:52:58,993 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:52:58,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 14:52:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:52:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 14:52:58,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 14:52:58,996 INFO L87 Difference]: Start difference. First operand 1381 states and 1950 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 14:53:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:53:01,189 INFO L93 Difference]: Finished difference Result 1395 states and 1968 transitions. [2023-12-02 14:53:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 14:53:01,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-12-02 14:53:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:53:01,193 INFO L225 Difference]: With dead ends: 1395 [2023-12-02 14:53:01,193 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 14:53:01,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-12-02 14:53:01,194 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 14 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5185 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 14:53:01,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5185 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 14:53:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 14:53:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2023-12-02 14:53:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 961 states have (on average 1.9739854318418315) internal successors, (1897), 1351 states have internal predecessors, (1897), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 14:53:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1960 transitions. [2023-12-02 14:53:01,211 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1960 transitions. Word has length 77 [2023-12-02 14:53:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:53:01,211 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1960 transitions. [2023-12-02 14:53:01,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 14:53:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1960 transitions. [2023-12-02 14:53:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 14:53:01,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:53:01,212 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:53:01,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-12-02 14:53:01,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-12-02 14:53:01,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-02 14:53:01,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:53:01,813 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:53:01,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:53:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash -239229693, now seen corresponding path program 2 times [2023-12-02 14:53:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:53:01,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114639924] [2023-12-02 14:53:01,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:53:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:53:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:53:01,815 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:53:01,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 14:53:02,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:53:02,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:53:02,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 14:53:02,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:53:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:53:02,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:53:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:53:02,809 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:53:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114639924] [2023-12-02 14:53:02,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114639924] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:53:02,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [440813002] [2023-12-02 14:53:02,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:53:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:53:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:53:02,810 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:53:02,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 14:53:04,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:53:04,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:53:04,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 14:53:04,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:53:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:53:04,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:53:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:53:05,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [440813002] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:53:05,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627793568] [2023-12-02 14:53:05,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:53:05,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:53:05,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:53:05,009 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:53:05,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 14:53:45,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:53:45,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:53:45,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 14:53:45,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:53:46,044 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:53:46,044 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:53:46,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:53:46,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:53:46,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:53:46,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 14:53:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 14:53:46,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:53:46,713 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:53:46,714 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 24 [2023-12-02 14:53:46,721 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2335) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2023-12-02 14:53:46,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627793568] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:53:46,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 14:53:46,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2023-12-02 14:53:46,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908224491] [2023-12-02 14:53:46,723 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 14:53:46,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 14:53:46,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:53:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 14:53:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2023-12-02 14:53:46,726 INFO L87 Difference]: Start difference. First operand 1389 states and 1960 transitions. Second operand has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 14:54:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:54:02,944 INFO L93 Difference]: Finished difference Result 1798 states and 2508 transitions. [2023-12-02 14:54:02,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 14:54:02,944 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 80 [2023-12-02 14:54:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:54:02,947 INFO L225 Difference]: With dead ends: 1798 [2023-12-02 14:54:02,947 INFO L226 Difference]: Without dead ends: 1794 [2023-12-02 14:54:02,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=619, Invalid=3166, Unknown=1, NotChecked=120, Total=3906 [2023-12-02 14:54:02,949 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 795 mSDsluCounter, 6538 mSDsCounter, 0 mSdLazyCounter, 8778 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 6933 SdHoareTripleChecker+Invalid, 8839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 8778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:54:02,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 6933 Invalid, 8839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 8778 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2023-12-02 14:54:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2023-12-02 14:54:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1406. [2023-12-02 14:54:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 979 states have (on average 1.9601634320735444) internal successors, (1919), 1368 states have internal predecessors, (1919), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 14:54:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1982 transitions. [2023-12-02 14:54:02,965 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1982 transitions. Word has length 80 [2023-12-02 14:54:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:54:02,965 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1982 transitions. [2023-12-02 14:54:02,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 14:54:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1982 transitions. [2023-12-02 14:54:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 14:54:02,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:54:02,966 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:54:02,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 14:54:03,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 14:54:03,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 14:54:03,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:54:03,567 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:54:03,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:54:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1517835460, now seen corresponding path program 1 times [2023-12-02 14:54:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:54:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929701098] [2023-12-02 14:54:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:54:03,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:54:03,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:54:03,569 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:54:03,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-02 14:54:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:54:03,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 14:54:03,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:54:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:04,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:54:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:04,997 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:54:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929701098] [2023-12-02 14:54:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929701098] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:54:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1514151917] [2023-12-02 14:54:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:54:04,997 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:54:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:54:04,998 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:54:04,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 14:54:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:54:05,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 14:54:05,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:54:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:05,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:54:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:05,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1514151917] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:54:05,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339201834] [2023-12-02 14:54:05,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:54:05,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:54:05,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:54:05,868 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:54:05,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 14:54:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:54:06,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 14:54:06,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:54:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:06,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:54:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339201834] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:54:08,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 14:54:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2023-12-02 14:54:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888268435] [2023-12-02 14:54:08,074 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 14:54:08,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 14:54:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:54:08,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 14:54:08,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 14:54:08,076 INFO L87 Difference]: Start difference. First operand 1406 states and 1982 transitions. Second operand has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 14:54:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:54:17,238 INFO L93 Difference]: Finished difference Result 1450 states and 2056 transitions. [2023-12-02 14:54:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 14:54:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2023-12-02 14:54:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:54:17,242 INFO L225 Difference]: With dead ends: 1450 [2023-12-02 14:54:17,242 INFO L226 Difference]: Without dead ends: 1444 [2023-12-02 14:54:17,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1295, Invalid=2737, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 14:54:17,244 INFO L413 NwaCegarLoop]: 744 mSDtfsCounter, 75 mSDsluCounter, 11097 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 11841 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:54:17,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 11841 Invalid, 2127 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-02 14:54:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-12-02 14:54:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1442. [2023-12-02 14:54:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1015 states have (on average 1.935960591133005) internal successors, (1965), 1404 states have internal predecessors, (1965), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 14:54:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2028 transitions. [2023-12-02 14:54:17,259 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2028 transitions. Word has length 86 [2023-12-02 14:54:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:54:17,259 INFO L495 AbstractCegarLoop]: Abstraction has 1442 states and 2028 transitions. [2023-12-02 14:54:17,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 14:54:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2028 transitions. [2023-12-02 14:54:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 14:54:17,260 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:54:17,260 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:54:17,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-12-02 14:54:17,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 14:54:17,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-12-02 14:54:17,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:54:17,861 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:54:17,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:54:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1951482948, now seen corresponding path program 2 times [2023-12-02 14:54:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:54:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986534490] [2023-12-02 14:54:17,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:54:17,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:54:17,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:54:17,863 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:54:17,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-02 14:54:18,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:54:18,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:54:18,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 14:54:18,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:54:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:19,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:54:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:21,483 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:54:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986534490] [2023-12-02 14:54:21,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986534490] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:54:21,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1697174657] [2023-12-02 14:54:21,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:54:21,484 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:54:21,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:54:21,485 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:54:21,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 14:54:23,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:54:23,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:54:23,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 14:54:23,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:54:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:23,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:54:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 14:54:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1697174657] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 14:54:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22007267] [2023-12-02 14:54:24,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 14:54:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:54:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:54:24,383 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:54:24,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 14:55:19,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 14:55:19,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 14:55:19,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 14:55:19,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:55:20,203 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:55:20,297 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:55:20,298 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:55:20,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:55:20,416 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:55:20,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 14:55:20,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-12-02 14:55:21,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:55:21,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:55:21,754 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-12-02 14:55:21,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 14:55:21,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-12-02 14:55:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-02 14:55:22,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:55:22,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 14:55:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22007267] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:55:22,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 14:55:22,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2023-12-02 14:55:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700067157] [2023-12-02 14:55:22,906 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 14:55:22,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-02 14:55:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:55:22,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-02 14:55:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3528, Unknown=1, NotChecked=128, Total=4422 [2023-12-02 14:55:22,909 INFO L87 Difference]: Start difference. First operand 1442 states and 2028 transitions. Second operand has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 14:56:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:56:17,476 INFO L93 Difference]: Finished difference Result 1899 states and 2674 transitions. [2023-12-02 14:56:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-02 14:56:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 98 [2023-12-02 14:56:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:56:17,481 INFO L225 Difference]: With dead ends: 1899 [2023-12-02 14:56:17,481 INFO L226 Difference]: Without dead ends: 1895 [2023-12-02 14:56:17,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4790 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=3579, Invalid=17304, Unknown=1, NotChecked=286, Total=21170 [2023-12-02 14:56:17,489 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 922 mSDsluCounter, 11912 mSDsCounter, 0 mSdLazyCounter, 18946 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 12316 SdHoareTripleChecker+Invalid, 19001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 18946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2023-12-02 14:56:17,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 12316 Invalid, 19001 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [55 Valid, 18946 Invalid, 0 Unknown, 0 Unchecked, 40.5s Time] [2023-12-02 14:56:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2023-12-02 14:56:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1509. [2023-12-02 14:56:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1083 states have (on average 1.8975069252077563) internal successors, (2055), 1471 states have internal predecessors, (2055), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 14:56:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2118 transitions. [2023-12-02 14:56:17,520 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2118 transitions. Word has length 98 [2023-12-02 14:56:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:56:17,520 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2118 transitions. [2023-12-02 14:56:17,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 14:56:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2118 transitions. [2023-12-02 14:56:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 14:56:17,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:56:17,522 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:56:17,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 14:56:17,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-02 14:56:17,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 14:56:18,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:56:18,123 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:56:18,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:56:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash -769932828, now seen corresponding path program 1 times [2023-12-02 14:56:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:56:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520848858] [2023-12-02 14:56:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:56:18,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:56:18,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:56:18,125 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:56:18,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-12-02 14:56:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:56:18,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 14:56:18,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:56:18,981 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:56:19,115 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:56:19,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 14:56:19,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:56:19,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 14:56:20,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:56:20,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:56:20,590 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:56:20,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:56:20,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 14:56:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:56:20,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:56:22,828 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 14:56:23,256 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4218))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4172)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 14:56:23,259 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:56:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520848858] [2023-12-02 14:56:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520848858] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:56:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1709611922] [2023-12-02 14:56:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:56:23,260 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:56:23,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:56:23,261 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:56:23,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 14:56:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:56:27,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 14:56:27,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:56:27,608 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:56:27,971 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:56:27,972 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:56:28,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:56:28,739 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:56:28,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 14:56:28,842 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:56:28,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 14:56:28,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 14:56:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:56:28,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:56:28,936 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:56:28,937 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 24 [2023-12-02 14:56:28,945 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem74#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4656) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 14:56:28,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 14:56:29,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4702)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 14:56:29,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1709611922] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:56:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190281417] [2023-12-02 14:56:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:56:29,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:56:29,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:56:29,408 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:56:29,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 14:56:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:56:29,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 14:56:30,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:56:30,006 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:56:30,135 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:56:30,135 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:56:30,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:56:31,223 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:56:31,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:56:31,429 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:56:31,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:56:31,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 14:56:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:56:31,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:56:31,465 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5140) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 14:56:31,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5140) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 14:56:31,997 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 14:56:31,997 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 36 [2023-12-02 14:56:32,008 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5186))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5140)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2023-12-02 14:56:32,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190281417] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:56:32,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:56:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 33 [2023-12-02 14:56:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882484604] [2023-12-02 14:56:32,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:56:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 14:56:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:56:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 14:56:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1124, Unknown=14, NotChecked=600, Total=1892 [2023-12-02 14:56:32,014 INFO L87 Difference]: Start difference. First operand 1509 states and 2118 transitions. Second operand has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 14:56:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:56:43,094 INFO L93 Difference]: Finished difference Result 1892 states and 2624 transitions. [2023-12-02 14:56:43,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 14:56:43,095 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 122 [2023-12-02 14:56:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:56:43,098 INFO L225 Difference]: With dead ends: 1892 [2023-12-02 14:56:43,098 INFO L226 Difference]: Without dead ends: 1892 [2023-12-02 14:56:43,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=316, Invalid=2252, Unknown=14, NotChecked=840, Total=3422 [2023-12-02 14:56:43,099 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 1433 mSDsluCounter, 3802 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 4184 SdHoareTripleChecker+Invalid, 5678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 5603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-12-02 14:56:43,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 4184 Invalid, 5678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-12-02 14:56:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2023-12-02 14:56:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1506. [2023-12-02 14:56:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1083 states have (on average 1.89196675900277) internal successors, (2049), 1468 states have internal predecessors, (2049), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 14:56:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2112 transitions. [2023-12-02 14:56:43,120 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2112 transitions. Word has length 122 [2023-12-02 14:56:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:56:43,120 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 2112 transitions. [2023-12-02 14:56:43,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 14:56:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2112 transitions. [2023-12-02 14:56:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 14:56:43,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:56:43,121 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:56:43,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 14:56:43,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-12-02 14:56:43,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-12-02 14:56:43,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 14:56:43,722 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:56:43,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:56:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash -769932827, now seen corresponding path program 1 times [2023-12-02 14:56:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:56:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508465891] [2023-12-02 14:56:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:56:43,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:56:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:56:43,725 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:56:43,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-02 14:56:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:56:44,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 123 conjunts are in the unsatisfiable core [2023-12-02 14:56:44,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:56:44,684 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:56:45,001 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:56:45,042 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:56:45,043 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:56:45,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:56:45,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:56:45,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 14:56:45,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 14:56:46,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:56:46,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 14:56:46,250 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 14:56:46,379 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:56:46,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 14:56:46,384 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 14:56:46,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 14:56:46,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 14:56:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:56:46,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:56:46,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 14:56:46,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-12-02 14:56:48,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5764) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5763))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5764) .cse2 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 14:56:48,220 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:56:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508465891] [2023-12-02 14:56:48,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508465891] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:56:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1864377477] [2023-12-02 14:56:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:56:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:56:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:56:48,222 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:56:48,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 14:56:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:56:52,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 81 conjunts are in the unsatisfiable core [2023-12-02 14:56:52,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:56:52,681 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:56:52,691 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:56:53,338 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:56:53,339 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:56:53,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-12-02 14:56:53,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:56:53,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:56:53,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 14:56:53,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 14:56:54,538 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 11 [2023-12-02 14:56:54,774 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2023-12-02 14:56:54,782 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 22 [2023-12-02 14:56:54,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 14:56:54,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 14:56:54,941 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-12-02 14:56:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:56:55,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:56:55,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 167 [2023-12-02 14:57:01,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse3 (select |c_#length| v_arrayElimCell_74))) (or (bvule (bvadd (select (select (store .cse0 v_arrayElimCell_74 (store (select .cse0 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse1) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse3) (not (bvule (bvadd .cse1 (_ bv20 32)) .cse3))))) (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse1)))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_74 (store (select .cse5 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse6) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv4 32)) (bvadd .cse4 (_ bv8 32)))) (not (bvule (bvadd .cse6 (_ bv20 32)) (select |c_#length| v_arrayElimCell_74))))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse9 (select |c_#length| v_arrayElimCell_74))) (or (bvule (bvadd (select (select (store .cse7 v_arrayElimCell_74 (store (select .cse7 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse8) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse9) (not (bvule (bvadd .cse8 (_ bv20 32)) .cse9)) (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_74))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (bvadd (select (select (store .cse13 v_arrayElimCell_74 (store (select .cse13 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse12) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32))) (.cse11 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse10 .cse11) (forall ((v_ArrVal_6207 (_ BitVec 32))) (bvule .cse10 (select |c_#length| v_ArrVal_6207))) (not (bvule (bvadd .cse12 (_ bv20 32)) .cse11))))))) (forall ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse14 (select .cse15 .cse2))) (or (not (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse14))) (forall ((v_ArrVal_6207 (_ BitVec 32))) (bvule (bvadd (select (store .cse15 (bvadd (_ bv16 32) .cse14) .cse2) .cse2) (_ bv8 32)) (select |c_#length| v_ArrVal_6207))) (not (bvule (bvadd .cse14 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))))))))) is different from false [2023-12-02 14:57:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1864377477] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:57:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389095737] [2023-12-02 14:57:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:57:01,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:57:01,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:57:01,364 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:57:01,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 14:57:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:57:01,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 14:57:01,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:57:02,436 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:57:02,476 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:57:02,476 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:57:02,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:57:02,725 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:57:03,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 14:57:03,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-12-02 14:57:04,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:57:04,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:57:04,965 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-12-02 14:57:05,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:57:05,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 14:57:05,565 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-12-02 14:57:05,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 14:57:05,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-12-02 14:57:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:57:05,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:57:05,695 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 14:57:05,748 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 14:57:07,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6830))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6831) .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6831) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 14:57:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389095737] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:57:07,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:57:07,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 33 [2023-12-02 14:57:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968713949] [2023-12-02 14:57:07,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:57:07,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 14:57:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:57:07,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 14:57:07,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1291, Unknown=7, NotChecked=546, Total=1980 [2023-12-02 14:57:07,578 INFO L87 Difference]: Start difference. First operand 1506 states and 2112 transitions. Second operand has 34 states, 28 states have (on average 7.178571428571429) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 14:58:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:58:13,847 INFO L93 Difference]: Finished difference Result 2432 states and 3362 transitions. [2023-12-02 14:58:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 14:58:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 7.178571428571429) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 122 [2023-12-02 14:58:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:58:13,852 INFO L225 Difference]: With dead ends: 2432 [2023-12-02 14:58:13,852 INFO L226 Difference]: Without dead ends: 2432 [2023-12-02 14:58:13,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=278, Invalid=2395, Unknown=7, NotChecked=742, Total=3422 [2023-12-02 14:58:13,854 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 1224 mSDsluCounter, 5496 mSDsCounter, 0 mSdLazyCounter, 16290 mSolverCounterSat, 64 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 5991 SdHoareTripleChecker+Invalid, 16360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 16290 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.4s IncrementalHoareTripleChecker+Time [2023-12-02 14:58:13,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 5991 Invalid, 16360 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [64 Valid, 16290 Invalid, 6 Unknown, 0 Unchecked, 63.4s Time] [2023-12-02 14:58:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2023-12-02 14:58:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1720. [2023-12-02 14:58:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1295 states have (on average 1.9073359073359073) internal successors, (2470), 1680 states have internal predecessors, (2470), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 14:58:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2537 transitions. [2023-12-02 14:58:13,886 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2537 transitions. Word has length 122 [2023-12-02 14:58:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:58:13,886 INFO L495 AbstractCegarLoop]: Abstraction has 1720 states and 2537 transitions. [2023-12-02 14:58:13,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 7.178571428571429) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 14:58:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2537 transitions. [2023-12-02 14:58:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 14:58:13,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:58:13,887 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:58:13,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 14:58:14,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 14:58:14,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-02 14:58:14,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:58:14,488 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:58:14,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:58:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715296, now seen corresponding path program 1 times [2023-12-02 14:58:14,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:58:14,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330859600] [2023-12-02 14:58:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:58:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:58:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:58:14,490 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:58:14,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-02 14:58:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:58:15,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 14:58:15,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:58:15,555 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:58:15,922 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:58:15,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 14:58:15,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:58:16,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 14:58:18,328 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:58:18,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:58:18,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:58:18,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:58:18,732 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:58:18,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:58:18,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 14:58:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:58:18,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:58:21,165 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 14:58:21,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7285))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:58:21,214 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 14:58:21,892 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7332))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:58:21,898 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:58:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330859600] [2023-12-02 14:58:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330859600] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:58:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1147307280] [2023-12-02 14:58:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:58:21,899 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:58:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:58:21,900 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:58:21,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-12-02 14:58:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:58:28,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-02 14:58:28,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:58:28,032 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:58:28,733 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 14:58:28,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 14:58:28,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:58:29,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 14:58:31,168 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:58:31,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 14:58:31,521 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:58:31,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 14:58:31,744 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:58:31,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 14:58:31,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 14:58:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:58:31,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:58:33,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7786))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:58:33,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7786))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 14:58:34,707 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7833))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7786)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 14:58:34,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1147307280] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:58:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072101517] [2023-12-02 14:58:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:58:34,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 14:58:34,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 14:58:34,714 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 14:58:34,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 14:58:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:58:35,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 14:58:35,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:58:35,780 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:58:35,780 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:58:35,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 14:58:37,277 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:58:37,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 14:58:37,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:58:37,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 14:58:37,648 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 14:58:37,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 14:58:37,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 14:58:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:58:37,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:58:37,853 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 14:58:37,853 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 24 [2023-12-02 14:58:37,867 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem75#1.base|)) is different from false [2023-12-02 14:58:37,884 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 14:58:37,903 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8285)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 14:58:37,923 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8285))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 14:58:38,532 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8332))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8285)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 14:58:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072101517] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:58:38,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 14:58:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 32 [2023-12-02 14:58:38,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730226261] [2023-12-02 14:58:38,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 14:58:38,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 14:58:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 14:58:38,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 14:58:38,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1039, Unknown=18, NotChecked=924, Total=2162 [2023-12-02 14:58:38,539 INFO L87 Difference]: Start difference. First operand 1720 states and 2537 transitions. Second operand has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 14:59:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 14:59:03,040 INFO L93 Difference]: Finished difference Result 2105 states and 3047 transitions. [2023-12-02 14:59:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 14:59:03,041 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 124 [2023-12-02 14:59:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 14:59:03,046 INFO L225 Difference]: With dead ends: 2105 [2023-12-02 14:59:03,046 INFO L226 Difference]: Without dead ends: 2105 [2023-12-02 14:59:03,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 345 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=262, Invalid=1660, Unknown=18, NotChecked=1140, Total=3080 [2023-12-02 14:59:03,048 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 757 mSDsluCounter, 4709 mSDsCounter, 0 mSdLazyCounter, 6575 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 6617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 6575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2023-12-02 14:59:03,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 5090 Invalid, 6617 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 6575 Invalid, 0 Unknown, 0 Unchecked, 23.6s Time] [2023-12-02 14:59:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2023-12-02 14:59:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1719. [2023-12-02 14:59:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1295 states have (on average 1.9057915057915058) internal successors, (2468), 1679 states have internal predecessors, (2468), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 14:59:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2535 transitions. [2023-12-02 14:59:03,069 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2535 transitions. Word has length 124 [2023-12-02 14:59:03,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 14:59:03,070 INFO L495 AbstractCegarLoop]: Abstraction has 1719 states and 2535 transitions. [2023-12-02 14:59:03,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 14:59:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2535 transitions. [2023-12-02 14:59:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 14:59:03,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 14:59:03,071 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 14:59:03,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2023-12-02 14:59:03,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-12-02 14:59:03,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-12-02 14:59:03,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:59:03,672 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 14:59:03,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 14:59:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715295, now seen corresponding path program 1 times [2023-12-02 14:59:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 14:59:03,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487099866] [2023-12-02 14:59:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 14:59:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 14:59:03,674 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 14:59:03,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-02 14:59:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 14:59:04,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 14:59:04,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 14:59:04,794 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 14:59:05,412 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 14:59:05,495 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 14:59:05,496 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 14:59:05,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 14:59:05,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 14:59:05,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 14:59:05,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 14:59:07,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:59:07,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 14:59:07,735 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 14:59:07,992 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:59:07,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 14:59:08,005 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 14:59:08,192 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 14:59:08,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 14:59:08,199 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 14:59:08,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 14:59:08,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 14:59:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 14:59:08,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 14:59:08,648 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 14:59:08,695 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 14:59:08,763 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8832))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8833) .cse0 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8833) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 14:59:08,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8832))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8833) .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8833) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 14:59:12,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8926))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8832))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8927) .cse0 v_ArrVal_8833) .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8926))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8927) .cse6 v_ArrVal_8833) (select (select (store .cse7 .cse6 v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8835))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 14:59:12,238 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 14:59:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487099866] [2023-12-02 14:59:12,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487099866] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 14:59:12,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1948191970] [2023-12-02 14:59:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 14:59:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 14:59:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 14:59:12,239 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 14:59:12,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-12-02 15:01:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:10,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 15:01:10,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:01:10,940 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 15:01:11,583 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 15:01:11,632 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:01:11,632 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 15:01:11,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:01:11,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:01:11,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 15:01:11,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 15:01:13,612 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:01:13,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 15:01:13,622 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 15:01:13,800 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:01:13,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 15:01:13,825 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 15:01:13,909 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:01:13,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 15:01:13,918 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 15:01:13,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 15:01:13,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 15:01:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 15:01:13,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:01:14,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 15:01:14,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-12-02 15:01:14,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9428) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9427))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9428) .cse2 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:01:14,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9427))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9428) .cse1 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9428) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 15:01:16,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9522))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9427))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9521) .cse0 v_ArrVal_9428) .cse1 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9522))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9521) .cse6 v_ArrVal_9428) (select (select (store .cse7 .cse6 v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9430))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 15:01:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1948191970] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:01:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688122076] [2023-12-02 15:01:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:01:16,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:01:16,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:01:16,298 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:01:16,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-12-02 15:01:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:01:17,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 122 conjunts are in the unsatisfiable core [2023-12-02 15:01:17,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:01:17,477 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 15:01:17,524 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:01:17,524 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 15:01:17,662 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 15:01:17,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:01:18,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 15:01:18,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-12-02 15:01:19,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:01:19,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 15:01:19,737 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-12-02 15:01:20,091 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:01:20,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 15:01:20,116 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-12-02 15:01:20,341 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:01:20,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 15:01:20,363 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-12-02 15:01:20,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 15:01:20,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-12-02 15:01:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 15:01:20,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:01:20,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 15:01:20,526 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:01:20,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10022) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10021))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10022) .cse2 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:01:20,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10021))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10022) .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10022) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 15:01:22,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10115))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10116) .cse1 v_ArrVal_10022) (select (select (store .cse2 .cse1 v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10024))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10115))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10021))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10116) .cse4 v_ArrVal_10022) .cse5 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 15:01:22,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688122076] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:01:22,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:01:22,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2023-12-02 15:01:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66921437] [2023-12-02 15:01:22,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:01:22,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 15:01:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:01:22,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 15:01:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=492, Unknown=15, NotChecked=870, Total=1482 [2023-12-02 15:01:22,909 INFO L87 Difference]: Start difference. First operand 1719 states and 2535 transitions. Second operand has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:02:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:02:21,041 INFO L93 Difference]: Finished difference Result 2415 states and 3348 transitions. [2023-12-02 15:02:21,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 15:02:21,042 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-12-02 15:02:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:02:21,045 INFO L225 Difference]: With dead ends: 2415 [2023-12-02 15:02:21,045 INFO L226 Difference]: Without dead ends: 2415 [2023-12-02 15:02:21,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 351 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=178, Invalid=923, Unknown=15, NotChecked=1140, Total=2256 [2023-12-02 15:02:21,046 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 1177 mSDsluCounter, 6172 mSDsCounter, 0 mSdLazyCounter, 15499 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 6790 SdHoareTripleChecker+Invalid, 15526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 15499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:02:21,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 6790 Invalid, 15526 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [27 Valid, 15499 Invalid, 0 Unknown, 0 Unchecked, 56.9s Time] [2023-12-02 15:02:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2023-12-02 15:02:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1718. [2023-12-02 15:02:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1295 states have (on average 1.9042471042471043) internal successors, (2466), 1678 states have internal predecessors, (2466), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 15:02:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2533 transitions. [2023-12-02 15:02:21,068 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2533 transitions. Word has length 124 [2023-12-02 15:02:21,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:02:21,069 INFO L495 AbstractCegarLoop]: Abstraction has 1718 states and 2533 transitions. [2023-12-02 15:02:21,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 15:02:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2533 transitions. [2023-12-02 15:02:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 15:02:21,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:02:21,070 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:02:21,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2023-12-02 15:02:21,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Ended with exit code 0 [2023-12-02 15:02:21,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Ended with exit code 0 [2023-12-02 15:02:21,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:02:21,671 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 15:02:21,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:02:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384054, now seen corresponding path program 1 times [2023-12-02 15:02:21,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:02:21,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381648232] [2023-12-02 15:02:21,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:21,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:02:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:02:21,673 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:02:21,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-02 15:02:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:22,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 15:02:22,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:02:22,991 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 15:02:23,380 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:02:23,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:02:23,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:02:23,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 15:02:25,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:25,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:02:26,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:26,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:02:26,195 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:26,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:02:26,402 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:26,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:02:26,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 15:02:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 15:02:26,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:02:28,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10587) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:02:28,886 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10586))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:02:30,210 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10585))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:02:31,132 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10633 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10633))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10585)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 15:02:31,139 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:02:31,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381648232] [2023-12-02 15:02:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381648232] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:02:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [108367997] [2023-12-02 15:02:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:31,140 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:02:31,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:02:31,141 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:02:31,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-12-02 15:02:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:39,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 15:02:39,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:02:39,839 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 15:02:40,557 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:02:40,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-12-02 15:02:40,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:02:41,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 15:02:42,861 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:02:42,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 15:02:43,200 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:02:43,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 15:02:43,420 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:02:43,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 15:02:43,649 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:02:43,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 15:02:43,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 15:02:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 15:02:43,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:02:43,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_11104) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-12-02 15:02:43,745 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:02:43,770 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11103))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:02:43,794 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:02:43,822 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11102))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:02:43,851 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11102))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:02:44,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11150 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11150))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11102)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:02:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [108367997] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:02:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910357679] [2023-12-02 15:02:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:44,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:02:44,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:02:44,500 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:02:44,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-12-02 15:02:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:45,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 15:02:45,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:02:45,357 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 15:02:45,743 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:02:45,743 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 15:02:45,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:02:47,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:47,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:02:47,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:47,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 15:02:47,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:47,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:02:48,727 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:02:48,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:02:48,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 15:02:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 15:02:48,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:02:48,784 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_11620) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:02:48,806 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11620) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:02:48,844 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 15:02:48,844 INFO L378 Elim1Store]: Elim1 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 37 treesize of output 36 [2023-12-02 15:02:48,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem75#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11620)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 15:02:48,882 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11619))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11620)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 15:02:48,904 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11618)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11620)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2023-12-02 15:02:48,932 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11618))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11620)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2023-12-02 15:02:49,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11666))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11618)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11620)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2023-12-02 15:02:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910357679] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:02:49,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:02:49,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 35 [2023-12-02 15:02:49,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632037560] [2023-12-02 15:02:49,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:02:49,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 15:02:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:02:49,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 15:02:49,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1349, Unknown=37, NotChecked=1674, Total=3306 [2023-12-02 15:02:49,584 INFO L87 Difference]: Start difference. First operand 1718 states and 2533 transitions. Second operand has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 15:03:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:12,705 INFO L93 Difference]: Finished difference Result 2103 states and 3043 transitions. [2023-12-02 15:03:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 15:03:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 126 [2023-12-02 15:03:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:12,707 INFO L225 Difference]: With dead ends: 2103 [2023-12-02 15:03:12,707 INFO L226 Difference]: Without dead ends: 2103 [2023-12-02 15:03:12,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 347 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=329, Invalid=2058, Unknown=37, NotChecked=1998, Total=4422 [2023-12-02 15:03:12,709 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 1405 mSDsluCounter, 4876 mSDsCounter, 0 mSdLazyCounter, 6965 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 5256 SdHoareTripleChecker+Invalid, 7032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 6965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:12,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 5256 Invalid, 7032 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 6965 Invalid, 0 Unknown, 0 Unchecked, 22.2s Time] [2023-12-02 15:03:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2023-12-02 15:03:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1717. [2023-12-02 15:03:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1295 states have (on average 1.9027027027027028) internal successors, (2464), 1677 states have internal predecessors, (2464), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 15:03:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2531 transitions. [2023-12-02 15:03:12,726 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2531 transitions. Word has length 126 [2023-12-02 15:03:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:12,726 INFO L495 AbstractCegarLoop]: Abstraction has 1717 states and 2531 transitions. [2023-12-02 15:03:12,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 15:03:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2531 transitions. [2023-12-02 15:03:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 15:03:12,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:12,727 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:12,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2023-12-02 15:03:12,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2023-12-02 15:03:13,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Ended with exit code 0 [2023-12-02 15:03:13,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:03:13,328 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 15:03:13,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384055, now seen corresponding path program 1 times [2023-12-02 15:03:13,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:13,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733203458] [2023-12-02 15:03:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:13,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:03:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:13,330 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:03:13,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2023-12-02 15:03:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:14,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-02 15:03:14,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:14,525 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 15:03:15,149 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 15:03:15,217 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:03:15,218 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 15:03:15,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:03:15,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:03:15,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-02 15:03:15,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 15:03:17,237 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:03:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 15:03:17,256 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 15:03:17,483 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:03:17,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 15:03:17,491 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 15:03:17,666 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:03:17,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 15:03:17,683 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 15:03:17,859 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:03:17,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 15:03:17,867 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 11 [2023-12-02 15:03:17,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 15:03:17,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 15:03:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 15:03:17,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:18,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2023-12-02 15:03:18,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:03:18,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12183))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:03:18,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12184) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12183))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12184) .cse3 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 15:03:18,677 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12181))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12182) .cse1 v_ArrVal_12184) (select (select (store .cse2 .cse1 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12181))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12183))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12182) .cse4 v_ArrVal_12184) .cse5 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 15:03:18,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12181))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12183))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12182) .cse1 v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12181))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12182) .cse7 v_ArrVal_12184) (select (select (store .cse8 .cse7 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-12-02 15:03:22,790 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12277))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12181))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12183))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12278) .cse0 v_ArrVal_12182) .cse1 v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12277))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12181))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12278) .cse8 v_ArrVal_12182) .cse9 v_ArrVal_12184) (select (select (store .cse10 .cse9 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 15:03:22,817 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733203458] [2023-12-02 15:03:22,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733203458] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:03:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [877181835] [2023-12-02 15:03:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:03:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:03:22,819 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:03:22,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d1b14ba-6ce2-4149-b13b-2b8f7fdcd9d2/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process [2023-12-02 15:06:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:17,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-02 15:06:17,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:17,902 INFO L378 Elim1Store]: Elim1 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 7 [2023-12-02 15:06:19,959 INFO L378 Elim1Store]: Elim1 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 [2023-12-02 15:06:20,148 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:06:20,148 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 13 [2023-12-02 15:06:20,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 15:06:20,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1