./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje --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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:59:45,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:59:45,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 04:59:45,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:59:45,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:59:45,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:59:45,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:59:45,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:59:45,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:59:45,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:59:45,643 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:59:45,644 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:59:45,644 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:59:45,644 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:59:45,647 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:59:45,647 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:59:45,648 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:59:45,648 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:59:45,648 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:59:45,649 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:59:45,649 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:59:45,652 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:59:45,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:59:45,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:59:45,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:59:45,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:59:45,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:59:45,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:59:45,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:59:45,658 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:59:45,659 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:59:45,659 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:59:45,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:59:45,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:59:45,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:59:45,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:59:45,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:59:45,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:59:45,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:59:45,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:59:45,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:59:45,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:59:45,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:59:45,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:59:45,663 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:59:45,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:59:45,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:59:45,665 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:59:45,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:59:45,665 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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-09 04:59:45,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:59:45,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:59:45,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:59:45,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:59:45,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:59:45,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i Unable to find full path for "g++" [2024-11-09 04:59:48,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:59:48,406 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:59:48,407 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-09 04:59:48,438 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data/bd62ca114/dd692b6bb4ff4db2948901edb16a6957/FLAG9a92f057b [2024-11-09 04:59:48,691 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data/bd62ca114/dd692b6bb4ff4db2948901edb16a6957 [2024-11-09 04:59:48,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:59:48,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:59:48,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:59:48,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:59:48,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:59:48,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:59:48" (1/1) ... [2024-11-09 04:59:48,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6433c403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:48, skipping insertion in model container [2024-11-09 04:59:48,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:59:48" (1/1) ... [2024-11-09 04:59:48,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:59:49,275 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,351 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,360 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,374 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,454 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,455 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,459 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,459 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,485 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,498 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,499 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,506 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,507 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,511 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,513 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,517 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,518 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,526 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:49,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:59:49,566 ERROR L321 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) [2024-11-09 04:59:49,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d486229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:49, skipping insertion in model container [2024-11-09 04:59:49,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:59:49,570 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 04:59:49,573 INFO L158 Benchmark]: Toolchain (without parser) took 876.09ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 79.6MB in the beginning and 116.1MB in the end (delta: -36.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-09 04:59:49,573 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:59:49,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.51ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 79.6MB in the beginning and 116.1MB in the end (delta: -36.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-09 04:59:49,577 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.31ms. Allocated memory is still 123.7MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.51ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 79.6MB in the beginning and 116.1MB in the end (delta: -36.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje --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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:59:51,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:59:52,046 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 04:59:52,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:59:52,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:59:52,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:59:52,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:59:52,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:59:52,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:59:52,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:59:52,101 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:59:52,101 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:59:52,101 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:59:52,102 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:59:52,102 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:59:52,102 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:59:52,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:59:52,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:59:52,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:59:52,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:59:52,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:59:52,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:59:52,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:59:52,109 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:59:52,109 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:59:52,110 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:59:52,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:59:52,110 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:59:52,110 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:59:52,111 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:59:52,111 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:59:52,111 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:59:52,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:59:52,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:59:52,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:59:52,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:59:52,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:59:52,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:59:52,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:59:52,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:59:52,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:59:52,116 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:59:52,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:59:52,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:59:52,124 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:59:52,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-09 04:59:52,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:59:52,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:59:52,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:59:52,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:59:52,565 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:59:52,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i Unable to find full path for "g++" [2024-11-09 04:59:54,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:59:55,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:59:55,250 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-09 04:59:55,283 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data/fa2297d7e/0fe79db38aa14ce49b063f1b749fb3db/FLAG4441e32c5 [2024-11-09 04:59:55,300 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/data/fa2297d7e/0fe79db38aa14ce49b063f1b749fb3db [2024-11-09 04:59:55,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:59:55,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:59:55,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:59:55,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:59:55,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:59:55,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:59:55" (1/1) ... [2024-11-09 04:59:55,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c199f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:55, skipping insertion in model container [2024-11-09 04:59:55,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:59:55" (1/1) ... [2024-11-09 04:59:55,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:59:55,928 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:55,988 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:55,999 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,006 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,022 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,080 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,081 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,087 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,088 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,095 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,096 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,097 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,098 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,103 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,104 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,106 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,108 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,109 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,110 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,118 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:59:56,154 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 04:59:56,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:59:56,205 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,232 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,238 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,263 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,274 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,313 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,317 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,320 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,324 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,327 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,332 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,333 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,338 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,341 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,346 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,348 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,350 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,351 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,352 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,359 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 04:59:56,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:59:56,368 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:59:56,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:59:56,562 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:59:56,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56 WrapperNode [2024-11-09 04:59:56,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:59:56,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:59:56,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:59:56,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:59:56,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,717 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1177 [2024-11-09 04:59:56,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:59:56,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:59:56,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:59:56,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:59:56,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:59:56,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:59:56,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:59:56,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:59:56,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (1/1) ... [2024-11-09 04:59:56,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:59:56,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:59:56,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:59:56,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:59:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 04:59:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 04:59:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 04:59:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 04:59:56,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 04:59:56,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 04:59:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:59:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:59:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:59:56,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:59:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:59:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 04:59:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:59:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:59:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:59:56,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:59:57,294 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:59:57,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:59:57,302 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 05:00:03,010 INFO L? ?]: Removed 1300 outVars from TransFormulas that were not future-live. [2024-11-09 05:00:03,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:00:03,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:00:03,067 INFO L316 CfgBuilder]: Removed 66 assume(true) statements. [2024-11-09 05:00:03,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:00:03 BoogieIcfgContainer [2024-11-09 05:00:03,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:00:03,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:00:03,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:00:03,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:00:03,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:59:55" (1/3) ... [2024-11-09 05:00:03,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4fe855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:00:03, skipping insertion in model container [2024-11-09 05:00:03,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:59:56" (2/3) ... [2024-11-09 05:00:03,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4fe855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:00:03, skipping insertion in model container [2024-11-09 05:00:03,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:00:03" (3/3) ... [2024-11-09 05:00:03,081 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test3-2.i [2024-11-09 05:00:03,099 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:00:03,100 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 630 error locations. [2024-11-09 05:00:03,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:00:03,186 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@785b2e51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:00:03,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 630 error locations. [2024-11-09 05:00:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 1265 states, 630 states have (on average 2.2253968253968255) internal successors, (1402), 1258 states have internal predecessors, (1402), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 05:00:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:00:03,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:03,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:00:03,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1202725, now seen corresponding path program 1 times [2024-11-09 05:00:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:03,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756831983] [2024-11-09 05:00:03,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:03,224 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 [2024-11-09 05:00:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:03,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:03,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:03,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:03,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:03,529 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 [2024-11-09 05:00:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:03,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:03,557 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756831983] [2024-11-09 05:00:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756831983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:03,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:03,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381628435] [2024-11-09 05:00:03,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:03,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:03,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:03,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:03,613 INFO L87 Difference]: Start difference. First operand has 1265 states, 630 states have (on average 2.2253968253968255) internal successors, (1402), 1258 states have internal predecessors, (1402), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:06,445 INFO L93 Difference]: Finished difference Result 1442 states and 1529 transitions. [2024-11-09 05:00:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:06,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 05:00:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:06,467 INFO L225 Difference]: With dead ends: 1442 [2024-11-09 05:00:06,467 INFO L226 Difference]: Without dead ends: 1440 [2024-11-09 05:00:06,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:06,472 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1169 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:06,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 934 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 05:00:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-09 05:00:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1252. [2024-11-09 05:00:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 633 states have (on average 2.0837282780410744) internal successors, (1319), 1244 states have internal predecessors, (1319), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 05:00:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1329 transitions. [2024-11-09 05:00:06,689 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1329 transitions. Word has length 4 [2024-11-09 05:00:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:06,690 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1329 transitions. [2024-11-09 05:00:06,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1329 transitions. [2024-11-09 05:00:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:00:06,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:06,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:00:06,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:00:06,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:06,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:06,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1202726, now seen corresponding path program 1 times [2024-11-09 05:00:06,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842765442] [2024-11-09 05:00:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:06,897 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 [2024-11-09 05:00:06,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:06,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:06,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:07,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:00:07,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:07,034 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 [2024-11-09 05:00:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:07,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:07,061 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:07,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842765442] [2024-11-09 05:00:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842765442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:07,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653827023] [2024-11-09 05:00:07,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:07,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:07,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:07,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:07,065 INFO L87 Difference]: Start difference. First operand 1252 states and 1329 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:11,514 INFO L93 Difference]: Finished difference Result 1861 states and 1987 transitions. [2024-11-09 05:00:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:11,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 05:00:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:11,521 INFO L225 Difference]: With dead ends: 1861 [2024-11-09 05:00:11,521 INFO L226 Difference]: Without dead ends: 1861 [2024-11-09 05:00:11,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:11,523 INFO L432 NwaCegarLoop]: 1031 mSDtfsCounter, 652 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:11,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1734 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 05:00:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2024-11-09 05:00:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1464. [2024-11-09 05:00:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 845 states have (on average 2.0662721893491125) internal successors, (1746), 1455 states have internal predecessors, (1746), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:00:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1758 transitions. [2024-11-09 05:00:11,583 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1758 transitions. Word has length 4 [2024-11-09 05:00:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 1758 transitions. [2024-11-09 05:00:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1758 transitions. [2024-11-09 05:00:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:00:11,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:11,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:00:11,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:11,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:11,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:11,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:11,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1204564, now seen corresponding path program 1 times [2024-11-09 05:00:11,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:11,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103480158] [2024-11-09 05:00:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:11,790 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 [2024-11-09 05:00:11,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:11,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:11,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:11,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:00:11,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:11,987 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-09 05:00:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:11,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:11,989 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:11,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103480158] [2024-11-09 05:00:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103480158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:11,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106747537] [2024-11-09 05:00:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:11,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:11,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:11,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 05:00:11,993 INFO L87 Difference]: Start difference. First operand 1464 states and 1758 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:15,782 INFO L93 Difference]: Finished difference Result 2047 states and 2386 transitions. [2024-11-09 05:00:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:15,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 05:00:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:15,793 INFO L225 Difference]: With dead ends: 2047 [2024-11-09 05:00:15,793 INFO L226 Difference]: Without dead ends: 2046 [2024-11-09 05:00:15,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 05:00:15,795 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 624 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1948 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:15,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1737 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 1948 Unchecked, 3.7s Time] [2024-11-09 05:00:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2024-11-09 05:00:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1464. [2024-11-09 05:00:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 845 states have (on average 2.06508875739645) internal successors, (1745), 1455 states have internal predecessors, (1745), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:00:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1757 transitions. [2024-11-09 05:00:15,829 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1757 transitions. Word has length 4 [2024-11-09 05:00:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:15,829 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 1757 transitions. [2024-11-09 05:00:15,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1757 transitions. [2024-11-09 05:00:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:00:15,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:15,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:15,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:16,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:16,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:16,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1654943313, now seen corresponding path program 1 times [2024-11-09 05:00:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188592208] [2024-11-09 05:00:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:16,033 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 [2024-11-09 05:00:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:16,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:16,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:16,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 05:00:16,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:16,201 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 [2024-11-09 05:00:16,210 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 [2024-11-09 05:00:16,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:00:16,300 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 [2024-11-09 05:00:16,321 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:00:16,321 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 [2024-11-09 05:00:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:16,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:16,364 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:16,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188592208] [2024-11-09 05:00:16,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188592208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:16,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:16,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:16,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870764528] [2024-11-09 05:00:16,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:16,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:16,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:16,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:16,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:16,367 INFO L87 Difference]: Start difference. First operand 1464 states and 1757 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:20,620 INFO L93 Difference]: Finished difference Result 1646 states and 1950 transitions. [2024-11-09 05:00:20,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:20,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 05:00:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:20,628 INFO L225 Difference]: With dead ends: 1646 [2024-11-09 05:00:20,628 INFO L226 Difference]: Without dead ends: 1646 [2024-11-09 05:00:20,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:20,629 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 2626 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2631 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:20,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2631 Valid, 547 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 05:00:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2024-11-09 05:00:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1240. [2024-11-09 05:00:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 633 states have (on average 2.060031595576619) internal successors, (1304), 1232 states have internal predecessors, (1304), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 05:00:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1314 transitions. [2024-11-09 05:00:20,662 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1314 transitions. Word has length 8 [2024-11-09 05:00:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1314 transitions. [2024-11-09 05:00:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1314 transitions. [2024-11-09 05:00:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:00:20,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:20,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:20,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:20,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:20,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:20,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash 236364828, now seen corresponding path program 1 times [2024-11-09 05:00:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598846616] [2024-11-09 05:00:20,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:20,866 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 [2024-11-09 05:00:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:20,870 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:20,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:21,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:21,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:21,024 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 [2024-11-09 05:00:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:21,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:21,041 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598846616] [2024-11-09 05:00:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598846616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593888736] [2024-11-09 05:00:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:21,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:21,048 INFO L87 Difference]: Start difference. First operand 1240 states and 1314 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:23,748 INFO L93 Difference]: Finished difference Result 1579 states and 1686 transitions. [2024-11-09 05:00:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:00:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:23,753 INFO L225 Difference]: With dead ends: 1579 [2024-11-09 05:00:23,754 INFO L226 Difference]: Without dead ends: 1579 [2024-11-09 05:00:23,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:23,755 INFO L432 NwaCegarLoop]: 1179 mSDtfsCounter, 937 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:23,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1534 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 05:00:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-11-09 05:00:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1192. [2024-11-09 05:00:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 633 states have (on average 1.9842022116903633) internal successors, (1256), 1184 states have internal predecessors, (1256), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 05:00:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1266 transitions. [2024-11-09 05:00:23,781 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1266 transitions. Word has length 9 [2024-11-09 05:00:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1266 transitions. [2024-11-09 05:00:23,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1266 transitions. [2024-11-09 05:00:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:00:23,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:23,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:23,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:23,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:23,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:23,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:23,984 INFO L85 PathProgramCache]: Analyzing trace with hash 236364829, now seen corresponding path program 1 times [2024-11-09 05:00:23,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:23,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412652709] [2024-11-09 05:00:23,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:23,984 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 [2024-11-09 05:00:23,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:23,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:23,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:24,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:00:24,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:24,151 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 [2024-11-09 05:00:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:24,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:24,184 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412652709] [2024-11-09 05:00:24,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412652709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:24,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:24,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:00:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175300109] [2024-11-09 05:00:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:24,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:24,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:24,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:24,187 INFO L87 Difference]: Start difference. First operand 1192 states and 1266 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:27,846 INFO L93 Difference]: Finished difference Result 1666 states and 1776 transitions. [2024-11-09 05:00:27,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:00:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:27,850 INFO L225 Difference]: With dead ends: 1666 [2024-11-09 05:00:27,851 INFO L226 Difference]: Without dead ends: 1666 [2024-11-09 05:00:27,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:27,852 INFO L432 NwaCegarLoop]: 1371 mSDtfsCounter, 697 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:27,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1907 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 05:00:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-09 05:00:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1219. [2024-11-09 05:00:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 670 states have (on average 1.9701492537313432) internal successors, (1320), 1211 states have internal predecessors, (1320), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 05:00:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1330 transitions. [2024-11-09 05:00:27,877 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1330 transitions. Word has length 9 [2024-11-09 05:00:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:27,878 INFO L471 AbstractCegarLoop]: Abstraction has 1219 states and 1330 transitions. [2024-11-09 05:00:27,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1330 transitions. [2024-11-09 05:00:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:00:27,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:27,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:27,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:28,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:28,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:28,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash 997976629, now seen corresponding path program 1 times [2024-11-09 05:00:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464465164] [2024-11-09 05:00:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:28,081 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 [2024-11-09 05:00:28,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:28,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:28,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:28,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 05:00:28,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:28,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:28,341 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464465164] [2024-11-09 05:00:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464465164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:28,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:00:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838864190] [2024-11-09 05:00:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:28,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:28,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:28,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:28,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:28,345 INFO L87 Difference]: Start difference. First operand 1219 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:29,486 INFO L93 Difference]: Finished difference Result 1822 states and 2021 transitions. [2024-11-09 05:00:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:29,487 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 05:00:29,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:29,492 INFO L225 Difference]: With dead ends: 1822 [2024-11-09 05:00:29,492 INFO L226 Difference]: Without dead ends: 1822 [2024-11-09 05:00:29,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:29,493 INFO L432 NwaCegarLoop]: 1384 mSDtfsCounter, 640 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 3781 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:29,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 3781 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 05:00:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2024-11-09 05:00:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1472. [2024-11-09 05:00:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 922 states have (on average 1.940347071583514) internal successors, (1789), 1463 states have internal predecessors, (1789), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:00:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 1801 transitions. [2024-11-09 05:00:29,524 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 1801 transitions. Word has length 13 [2024-11-09 05:00:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:29,524 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 1801 transitions. [2024-11-09 05:00:29,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1801 transitions. [2024-11-09 05:00:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:00:29,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:29,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:29,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:00:29,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:29,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:29,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 441370107, now seen corresponding path program 1 times [2024-11-09 05:00:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530346657] [2024-11-09 05:00:29,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:29,729 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 [2024-11-09 05:00:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:29,730 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:29,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:29,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:00:29,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:29,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:29,887 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530346657] [2024-11-09 05:00:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530346657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:29,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603484632] [2024-11-09 05:00:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:29,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:29,889 INFO L87 Difference]: Start difference. First operand 1472 states and 1801 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) [2024-11-09 05:00:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:29,953 INFO L93 Difference]: Finished difference Result 1410 states and 1711 transitions. [2024-11-09 05:00:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:29,954 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 [2024-11-09 05:00:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:29,958 INFO L225 Difference]: With dead ends: 1410 [2024-11-09 05:00:29,958 INFO L226 Difference]: Without dead ends: 1410 [2024-11-09 05:00:29,959 INFO L431 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 [2024-11-09 05:00:29,959 INFO L432 NwaCegarLoop]: 1190 mSDtfsCounter, 71 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:29,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2317 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:00:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-11-09 05:00:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2024-11-09 05:00:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 884 states have (on average 1.9219457013574661) internal successors, (1699), 1401 states have internal predecessors, (1699), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:00:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1711 transitions. [2024-11-09 05:00:29,983 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1711 transitions. Word has length 15 [2024-11-09 05:00:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:29,984 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 1711 transitions. [2024-11-09 05:00:29,984 INFO L472 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) [2024-11-09 05:00:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1711 transitions. [2024-11-09 05:00:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 05:00:29,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:29,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:29,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:00:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:30,186 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash 799354906, now seen corresponding path program 1 times [2024-11-09 05:00:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047040396] [2024-11-09 05:00:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:30,187 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 [2024-11-09 05:00:30,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:30,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:30,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:30,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:30,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:30,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:30,359 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:30,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047040396] [2024-11-09 05:00:30,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047040396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:30,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:30,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:00:30,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630649747] [2024-11-09 05:00:30,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:30,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:30,361 INFO L87 Difference]: Start difference. First operand 1410 states and 1711 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:30,447 INFO L93 Difference]: Finished difference Result 1380 states and 1653 transitions. [2024-11-09 05:00:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:00:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 05:00:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:30,450 INFO L225 Difference]: With dead ends: 1380 [2024-11-09 05:00:30,450 INFO L226 Difference]: Without dead ends: 1380 [2024-11-09 05:00:30,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:30,451 INFO L432 NwaCegarLoop]: 1145 mSDtfsCounter, 48 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:30,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3409 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-09 05:00:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2024-11-09 05:00:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 868 states have (on average 1.890552995391705) internal successors, (1641), 1371 states have internal predecessors, (1641), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:00:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1653 transitions. [2024-11-09 05:00:30,477 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1653 transitions. Word has length 16 [2024-11-09 05:00:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1653 transitions. [2024-11-09 05:00:30,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1653 transitions. [2024-11-09 05:00:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:00:30,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:30,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:30,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:00:30,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:30,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:30,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1393695911, now seen corresponding path program 1 times [2024-11-09 05:00:30,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:30,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180355024] [2024-11-09 05:00:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:30,683 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 [2024-11-09 05:00:30,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:30,686 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:30,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:30,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:00:30,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:31,066 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-09 05:00:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:31,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:31,068 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:31,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180355024] [2024-11-09 05:00:31,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180355024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:31,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646963708] [2024-11-09 05:00:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:31,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 05:00:31,070 INFO L87 Difference]: Start difference. First operand 1380 states and 1653 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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) [2024-11-09 05:00:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:33,264 INFO L93 Difference]: Finished difference Result 1680 states and 2028 transitions. [2024-11-09 05:00:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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 [2024-11-09 05:00:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:33,268 INFO L225 Difference]: With dead ends: 1680 [2024-11-09 05:00:33,268 INFO L226 Difference]: Without dead ends: 1672 [2024-11-09 05:00:33,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 05:00:33,269 INFO L432 NwaCegarLoop]: 1064 mSDtfsCounter, 246 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1429 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:33,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1701 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 639 Invalid, 0 Unknown, 1429 Unchecked, 2.1s Time] [2024-11-09 05:00:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2024-11-09 05:00:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1438. [2024-11-09 05:00:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 925 states have (on average 1.8497297297297297) internal successors, (1711), 1428 states have internal predecessors, (1711), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 05:00:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1725 transitions. [2024-11-09 05:00:33,295 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1725 transitions. Word has length 17 [2024-11-09 05:00:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:33,295 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 1725 transitions. [2024-11-09 05:00:33,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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) [2024-11-09 05:00:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1725 transitions. [2024-11-09 05:00:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:00:33,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:33,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:33,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:00:33,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:33,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:33,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash -539745472, now seen corresponding path program 1 times [2024-11-09 05:00:33,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:33,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203160934] [2024-11-09 05:00:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:33,501 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 [2024-11-09 05:00:33,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:33,502 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:33,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:33,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 05:00:33,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:33,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:33,695 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203160934] [2024-11-09 05:00:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203160934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77805280] [2024-11-09 05:00:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:33,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:33,697 INFO L87 Difference]: Start difference. First operand 1438 states and 1725 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:33,766 INFO L93 Difference]: Finished difference Result 1376 states and 1635 transitions. [2024-11-09 05:00:33,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 05:00:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:33,773 INFO L225 Difference]: With dead ends: 1376 [2024-11-09 05:00:33,773 INFO L226 Difference]: Without dead ends: 1376 [2024-11-09 05:00:33,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:33,774 INFO L432 NwaCegarLoop]: 1110 mSDtfsCounter, 71 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:33,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2157 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:00:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-09 05:00:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-09 05:00:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 887 states have (on average 1.8275084554678693) internal successors, (1621), 1366 states have internal predecessors, (1621), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 05:00:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1635 transitions. [2024-11-09 05:00:33,796 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1635 transitions. Word has length 20 [2024-11-09 05:00:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:33,797 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1635 transitions. [2024-11-09 05:00:33,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1635 transitions. [2024-11-09 05:00:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:00:33,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:33,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:00:33,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:00:34,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:34,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:34,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:34,001 INFO L85 PathProgramCache]: Analyzing trace with hash 449542154, now seen corresponding path program 1 times [2024-11-09 05:00:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:34,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855740522] [2024-11-09 05:00:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:34,002 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 [2024-11-09 05:00:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:34,003 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:34,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:34,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:34,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:34,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:34,222 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:34,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855740522] [2024-11-09 05:00:34,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855740522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:34,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:00:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046973504] [2024-11-09 05:00:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:34,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:34,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:34,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:34,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:34,224 INFO L87 Difference]: Start difference. First operand 1376 states and 1635 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:34,312 INFO L93 Difference]: Finished difference Result 1346 states and 1577 transitions. [2024-11-09 05:00:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:00:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-11-09 05:00:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:34,316 INFO L225 Difference]: With dead ends: 1346 [2024-11-09 05:00:34,317 INFO L226 Difference]: Without dead ends: 1346 [2024-11-09 05:00:34,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:34,318 INFO L432 NwaCegarLoop]: 1065 mSDtfsCounter, 48 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3169 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:34,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3169 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2024-11-09 05:00:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2024-11-09 05:00:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 871 states have (on average 1.7944890929965558) internal successors, (1563), 1336 states have internal predecessors, (1563), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 05:00:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1577 transitions. [2024-11-09 05:00:34,343 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1577 transitions. Word has length 21 [2024-11-09 05:00:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:34,345 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1577 transitions. [2024-11-09 05:00:34,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1577 transitions. [2024-11-09 05:00:34,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:00:34,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:34,346 INFO L215 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] [2024-11-09 05:00:34,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:00:34,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:34,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:34,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:34,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1379197992, now seen corresponding path program 1 times [2024-11-09 05:00:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635074700] [2024-11-09 05:00:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:34,548 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 [2024-11-09 05:00:34,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:34,552 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:34,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:34,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:00:34,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:34,724 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 [2024-11-09 05:00:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:34,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:34,835 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635074700] [2024-11-09 05:00:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635074700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:34,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226280125] [2024-11-09 05:00:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:34,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:34,838 INFO L87 Difference]: Start difference. First operand 1346 states and 1577 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:37,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:37,522 INFO L93 Difference]: Finished difference Result 1542 states and 1775 transitions. [2024-11-09 05:00:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 05:00:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:37,528 INFO L225 Difference]: With dead ends: 1542 [2024-11-09 05:00:37,528 INFO L226 Difference]: Without dead ends: 1542 [2024-11-09 05:00:37,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:37,529 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 971 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:37,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1387 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 05:00:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-09 05:00:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2024-11-09 05:00:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 871 states have (on average 1.7807118254879448) internal successors, (1551), 1332 states have internal predecessors, (1551), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 05:00:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1565 transitions. [2024-11-09 05:00:37,550 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1565 transitions. Word has length 30 [2024-11-09 05:00:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:37,551 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 1565 transitions. [2024-11-09 05:00:37,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1565 transitions. [2024-11-09 05:00:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:00:37,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:37,552 INFO L215 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] [2024-11-09 05:00:37,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:37,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:37,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:37,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1379197993, now seen corresponding path program 1 times [2024-11-09 05:00:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:37,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696071464] [2024-11-09 05:00:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:37,754 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 [2024-11-09 05:00:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:37,757 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:37,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:37,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:00:37,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:37,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 5 [2024-11-09 05:00:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:38,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:38,196 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:38,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696071464] [2024-11-09 05:00:38,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696071464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:38,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:38,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:38,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571614661] [2024-11-09 05:00:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:38,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:38,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:38,199 INFO L87 Difference]: Start difference. First operand 1342 states and 1565 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:42,301 INFO L93 Difference]: Finished difference Result 2025 states and 2386 transitions. [2024-11-09 05:00:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-09 05:00:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:42,306 INFO L225 Difference]: With dead ends: 2025 [2024-11-09 05:00:42,306 INFO L226 Difference]: Without dead ends: 2025 [2024-11-09 05:00:42,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:42,307 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 578 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:42,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1972 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 05:00:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-11-09 05:00:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1657. [2024-11-09 05:00:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1184 states have (on average 1.7922297297297298) internal successors, (2122), 1645 states have internal predecessors, (2122), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 05:00:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2140 transitions. [2024-11-09 05:00:42,333 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2140 transitions. Word has length 30 [2024-11-09 05:00:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:42,334 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2140 transitions. [2024-11-09 05:00:42,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2140 transitions. [2024-11-09 05:00:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 05:00:42,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:42,335 INFO L215 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] [2024-11-09 05:00:42,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:00:42,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:42,536 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:42,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:42,536 INFO L85 PathProgramCache]: Analyzing trace with hash -925089160, now seen corresponding path program 1 times [2024-11-09 05:00:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:42,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607173160] [2024-11-09 05:00:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:42,537 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 [2024-11-09 05:00:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:42,541 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:42,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:42,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:00:42,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:42,782 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 [2024-11-09 05:00:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:42,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:42,888 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607173160] [2024-11-09 05:00:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607173160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:42,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484950148] [2024-11-09 05:00:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:42,890 INFO L87 Difference]: Start difference. First operand 1657 states and 2140 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:45,880 INFO L93 Difference]: Finished difference Result 2108 states and 2716 transitions. [2024-11-09 05:00:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:45,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-09 05:00:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:45,888 INFO L225 Difference]: With dead ends: 2108 [2024-11-09 05:00:45,888 INFO L226 Difference]: Without dead ends: 2108 [2024-11-09 05:00:45,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:45,889 INFO L432 NwaCegarLoop]: 1003 mSDtfsCounter, 784 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:45,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2020 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 05:00:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2024-11-09 05:00:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1653. [2024-11-09 05:00:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1184 states have (on average 1.785472972972973) internal successors, (2114), 1641 states have internal predecessors, (2114), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 05:00:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2132 transitions. [2024-11-09 05:00:45,919 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2132 transitions. Word has length 35 [2024-11-09 05:00:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:45,919 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2132 transitions. [2024-11-09 05:00:45,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2132 transitions. [2024-11-09 05:00:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 05:00:45,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:45,920 INFO L215 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] [2024-11-09 05:00:45,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:00:46,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:46,121 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:46,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:46,121 INFO L85 PathProgramCache]: Analyzing trace with hash -925089159, now seen corresponding path program 1 times [2024-11-09 05:00:46,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:46,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255923659] [2024-11-09 05:00:46,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:46,122 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 [2024-11-09 05:00:46,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:46,123 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:46,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:46,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 05:00:46,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:46,337 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 [2024-11-09 05:00:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:46,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:46,560 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:46,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255923659] [2024-11-09 05:00:46,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255923659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:46,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:46,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979377980] [2024-11-09 05:00:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:46,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:46,562 INFO L87 Difference]: Start difference. First operand 1653 states and 2132 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:50,562 INFO L93 Difference]: Finished difference Result 2168 states and 2740 transitions. [2024-11-09 05:00:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-11-09 05:00:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:50,569 INFO L225 Difference]: With dead ends: 2168 [2024-11-09 05:00:50,569 INFO L226 Difference]: Without dead ends: 2168 [2024-11-09 05:00:50,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:50,570 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 540 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:50,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2559 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 05:00:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2024-11-09 05:00:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 1649. [2024-11-09 05:00:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1184 states have (on average 1.7787162162162162) internal successors, (2106), 1637 states have internal predecessors, (2106), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 05:00:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2124 transitions. [2024-11-09 05:00:50,596 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2124 transitions. Word has length 35 [2024-11-09 05:00:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:50,597 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2124 transitions. [2024-11-09 05:00:50,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2124 transitions. [2024-11-09 05:00:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 05:00:50,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:50,598 INFO L215 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] [2024-11-09 05:00:50,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:00:50,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:50,799 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:50,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1490216113, now seen corresponding path program 1 times [2024-11-09 05:00:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:50,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459858662] [2024-11-09 05:00:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:50,800 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 [2024-11-09 05:00:50,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:50,801 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:50,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:50,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:50,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:51,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:51,039 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:51,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459858662] [2024-11-09 05:00:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459858662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:51,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:51,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:00:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303500573] [2024-11-09 05:00:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:51,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:51,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:51,041 INFO L87 Difference]: Start difference. First operand 1649 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:51,128 INFO L93 Difference]: Finished difference Result 1619 states and 2074 transitions. [2024-11-09 05:00:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:00:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-09 05:00:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:51,134 INFO L225 Difference]: With dead ends: 1619 [2024-11-09 05:00:51,134 INFO L226 Difference]: Without dead ends: 1619 [2024-11-09 05:00:51,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:51,135 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 27 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:51,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3128 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2024-11-09 05:00:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2024-11-09 05:00:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1154 states have (on average 1.781629116117851) internal successors, (2056), 1607 states have internal predecessors, (2056), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 05:00:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2074 transitions. [2024-11-09 05:00:51,159 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2074 transitions. Word has length 49 [2024-11-09 05:00:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:51,159 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2074 transitions. [2024-11-09 05:00:51,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2074 transitions. [2024-11-09 05:00:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 05:00:51,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:51,160 INFO L215 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] [2024-11-09 05:00:51,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:00:51,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:51,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash -391326663, now seen corresponding path program 1 times [2024-11-09 05:00:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:51,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13243699] [2024-11-09 05:00:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:51,362 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 [2024-11-09 05:00:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:51,366 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:51,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:51,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:51,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:51,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:51,667 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:51,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13243699] [2024-11-09 05:00:51,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13243699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:51,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:51,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:00:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676188103] [2024-11-09 05:00:51,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:51,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:51,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:51,669 INFO L87 Difference]: Start difference. First operand 1619 states and 2074 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:51,746 INFO L93 Difference]: Finished difference Result 1607 states and 2054 transitions. [2024-11-09 05:00:51,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:00:51,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-09 05:00:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:51,750 INFO L225 Difference]: With dead ends: 1607 [2024-11-09 05:00:51,751 INFO L226 Difference]: Without dead ends: 1607 [2024-11-09 05:00:51,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:00:51,752 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 21 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:51,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3122 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-09 05:00:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2024-11-09 05:00:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1142 states have (on average 1.7828371278458843) internal successors, (2036), 1595 states have internal predecessors, (2036), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 05:00:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2054 transitions. [2024-11-09 05:00:51,776 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2054 transitions. Word has length 54 [2024-11-09 05:00:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:51,776 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2054 transitions. [2024-11-09 05:00:51,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2054 transitions. [2024-11-09 05:00:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 05:00:51,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:51,777 INFO L215 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] [2024-11-09 05:00:51,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:51,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:51,978 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:51,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash -227924733, now seen corresponding path program 1 times [2024-11-09 05:00:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197418480] [2024-11-09 05:00:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:51,980 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 [2024-11-09 05:00:51,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:51,982 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:51,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:52,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:00:52,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:52,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:52,266 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197418480] [2024-11-09 05:00:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197418480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970907501] [2024-11-09 05:00:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:52,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:00:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:00:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:52,268 INFO L87 Difference]: Start difference. First operand 1607 states and 2054 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:52,376 INFO L93 Difference]: Finished difference Result 1601 states and 1718 transitions. [2024-11-09 05:00:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:00:52,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-09 05:00:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:52,380 INFO L225 Difference]: With dead ends: 1601 [2024-11-09 05:00:52,381 INFO L226 Difference]: Without dead ends: 1601 [2024-11-09 05:00:52,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:00:52,382 INFO L432 NwaCegarLoop]: 1342 mSDtfsCounter, 316 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:52,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 2339 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:00:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2024-11-09 05:00:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1243. [2024-11-09 05:00:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 780 states have (on average 1.7) internal successors, (1326), 1233 states have internal predecessors, (1326), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 05:00:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1340 transitions. [2024-11-09 05:00:52,403 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1340 transitions. Word has length 57 [2024-11-09 05:00:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:52,408 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1340 transitions. [2024-11-09 05:00:52,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1340 transitions. [2024-11-09 05:00:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 05:00:52,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:52,409 INFO L215 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] [2024-11-09 05:00:52,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:52,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:52,612 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash -293651529, now seen corresponding path program 1 times [2024-11-09 05:00:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555704516] [2024-11-09 05:00:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:52,613 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 [2024-11-09 05:00:52,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:52,614 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:52,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:52,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 05:00:52,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:52,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:00:52,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:00:52,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:00:52,879 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 [2024-11-09 05:00:52,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:00:52,973 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 [2024-11-09 05:00:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:53,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:53,035 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:53,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555704516] [2024-11-09 05:00:53,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555704516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:53,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:53,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:00:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384824478] [2024-11-09 05:00:53,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:53,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:00:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:00:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:00:53,037 INFO L87 Difference]: Start difference. First operand 1243 states and 1340 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2024-11-09 05:00:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:54,663 INFO L93 Difference]: Finished difference Result 1468 states and 1581 transitions. [2024-11-09 05:00:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:00:54,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 60 [2024-11-09 05:00:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:54,666 INFO L225 Difference]: With dead ends: 1468 [2024-11-09 05:00:54,666 INFO L226 Difference]: Without dead ends: 1465 [2024-11-09 05:00:54,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:00:54,666 INFO L432 NwaCegarLoop]: 1034 mSDtfsCounter, 1094 mSDsluCounter, 2735 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 3769 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:54,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 3769 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 05:00:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-11-09 05:00:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1190. [2024-11-09 05:00:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 728 states have (on average 1.7486263736263736) internal successors, (1273), 1181 states have internal predecessors, (1273), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:00:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1285 transitions. [2024-11-09 05:00:54,684 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1285 transitions. Word has length 60 [2024-11-09 05:00:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:54,684 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1285 transitions. [2024-11-09 05:00:54,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2024-11-09 05:00:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1285 transitions. [2024-11-09 05:00:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 05:00:54,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:54,686 INFO L215 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] [2024-11-09 05:00:54,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:00:54,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:54,886 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:54,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash -775502995, now seen corresponding path program 1 times [2024-11-09 05:00:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:54,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420365239] [2024-11-09 05:00:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:54,887 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 [2024-11-09 05:00:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:54,889 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:54,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:55,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 05:00:55,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:00:55,333 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 [2024-11-09 05:00:55,341 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 [2024-11-09 05:00:56,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:00:56,083 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 [2024-11-09 05:00:56,103 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:00:56,104 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 [2024-11-09 05:00:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:00:56,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:00:56,118 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420365239] [2024-11-09 05:00:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420365239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:00:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:00:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:00:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577119710] [2024-11-09 05:00:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:00:56,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:00:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:00:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:00:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:56,121 INFO L87 Difference]: Start difference. First operand 1190 states and 1285 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:00:59,684 INFO L93 Difference]: Finished difference Result 1521 states and 1641 transitions. [2024-11-09 05:00:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:00:59,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-11-09 05:00:59,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:00:59,686 INFO L225 Difference]: With dead ends: 1521 [2024-11-09 05:00:59,686 INFO L226 Difference]: Without dead ends: 1521 [2024-11-09 05:00:59,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:00:59,687 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 1041 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:00:59,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 832 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 05:00:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-11-09 05:00:59,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1115. [2024-11-09 05:00:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 691 states have (on average 1.6801736613603473) internal successors, (1161), 1106 states have internal predecessors, (1161), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:00:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1173 transitions. [2024-11-09 05:00:59,697 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1173 transitions. Word has length 62 [2024-11-09 05:00:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:00:59,698 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1173 transitions. [2024-11-09 05:00:59,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:00:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1173 transitions. [2024-11-09 05:00:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 05:00:59,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:00:59,698 INFO L215 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] [2024-11-09 05:00:59,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:00:59,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:00:59,899 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:00:59,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:00:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash -489791377, now seen corresponding path program 1 times [2024-11-09 05:00:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:00:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041624918] [2024-11-09 05:00:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:59,900 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 [2024-11-09 05:00:59,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:00:59,901 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:00:59,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:01:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:00,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:01:00,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:00,195 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 [2024-11-09 05:01:00,212 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 [2024-11-09 05:01:00,238 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 [2024-11-09 05:01:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:00,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:01:00,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:01:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041624918] [2024-11-09 05:01:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041624918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:01:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519301101] [2024-11-09 05:01:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:00,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:01:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:01:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:01:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:01:00,254 INFO L87 Difference]: Start difference. First operand 1115 states and 1173 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:03,641 INFO L93 Difference]: Finished difference Result 1114 states and 1172 transitions. [2024-11-09 05:01:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:01:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-09 05:01:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:03,645 INFO L225 Difference]: With dead ends: 1114 [2024-11-09 05:01:03,645 INFO L226 Difference]: Without dead ends: 1114 [2024-11-09 05:01:03,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:01:03,646 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:03,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2636 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 05:01:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-09 05:01:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2024-11-09 05:01:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 691 states have (on average 1.678726483357453) internal successors, (1160), 1105 states have internal predecessors, (1160), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:01:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1172 transitions. [2024-11-09 05:01:03,665 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1172 transitions. Word has length 67 [2024-11-09 05:01:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:03,665 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1172 transitions. [2024-11-09 05:01:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1172 transitions. [2024-11-09 05:01:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 05:01:03,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:03,666 INFO L215 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] [2024-11-09 05:01:03,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:03,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:01:03,866 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:01:03,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash -489791376, now seen corresponding path program 1 times [2024-11-09 05:01:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:01:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75911750] [2024-11-09 05:01:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:03,868 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 [2024-11-09 05:01:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:01:03,869 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:01:03,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:01:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:04,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 05:01:04,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:04,223 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 [2024-11-09 05:01:04,244 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 [2024-11-09 05:01:04,259 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 [2024-11-09 05:01:04,314 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 [2024-11-09 05:01:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:04,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:01:04,353 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:01:04,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75911750] [2024-11-09 05:01:04,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75911750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:04,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:04,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:01:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744416141] [2024-11-09 05:01:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:04,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:01:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:01:04,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:01:04,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:01:04,356 INFO L87 Difference]: Start difference. First operand 1114 states and 1172 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:08,271 INFO L93 Difference]: Finished difference Result 1113 states and 1171 transitions. [2024-11-09 05:01:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:01:08,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-09 05:01:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:08,274 INFO L225 Difference]: With dead ends: 1113 [2024-11-09 05:01:08,275 INFO L226 Difference]: Without dead ends: 1113 [2024-11-09 05:01:08,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:01:08,275 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 1 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:08,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2676 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 05:01:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-09 05:01:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2024-11-09 05:01:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 690 states have (on average 1.6797101449275362) internal successors, (1159), 1104 states have internal predecessors, (1159), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:01:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1171 transitions. [2024-11-09 05:01:08,285 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1171 transitions. Word has length 67 [2024-11-09 05:01:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:08,285 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1171 transitions. [2024-11-09 05:01:08,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:01:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1171 transitions. [2024-11-09 05:01:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 05:01:08,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:08,286 INFO L215 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] [2024-11-09 05:01:08,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:08,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:01:08,486 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:01:08,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1790301686, now seen corresponding path program 1 times [2024-11-09 05:01:08,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:01:08,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456942229] [2024-11-09 05:01:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:08,488 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 [2024-11-09 05:01:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:01:08,489 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:01:08,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (25)] Waiting until timeout for monitored process [2024-11-09 05:01:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:08,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 05:01:08,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:08,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:01:08,820 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:01:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456942229] [2024-11-09 05:01:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456942229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:01:08,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:01:08,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:01:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27590361] [2024-11-09 05:01:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:01:08,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:01:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:01:08,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:01:08,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:08,822 INFO L87 Difference]: Start difference. First operand 1113 states and 1171 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-09 05:01:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:08,869 INFO L93 Difference]: Finished difference Result 1116 states and 1175 transitions. [2024-11-09 05:01:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:01:08,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2024-11-09 05:01:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:08,874 INFO L225 Difference]: With dead ends: 1116 [2024-11-09 05:01:08,874 INFO L226 Difference]: Without dead ends: 1116 [2024-11-09 05:01:08,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:01:08,875 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 0 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:08,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3067 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:01:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-09 05:01:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-09 05:01:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 692 states have (on average 1.6791907514450868) internal successors, (1162), 1107 states have internal predecessors, (1162), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:01:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1175 transitions. [2024-11-09 05:01:08,901 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1175 transitions. Word has length 75 [2024-11-09 05:01:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1175 transitions. [2024-11-09 05:01:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-11-09 05:01:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1175 transitions. [2024-11-09 05:01:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 05:01:08,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:08,903 INFO L215 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] [2024-11-09 05:01:08,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (25)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:09,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:01:09,103 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:01:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash 420185869, now seen corresponding path program 1 times [2024-11-09 05:01:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:01:09,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205154388] [2024-11-09 05:01:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:09,105 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 [2024-11-09 05:01:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:01:09,106 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:01:09,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:01:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:09,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:01:09,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:09,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:09,553 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:01:09,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205154388] [2024-11-09 05:01:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205154388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1336307981] [2024-11-09 05:01:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:01:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:01:09,557 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:01:09,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-09 05:01:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:10,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:01:10,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:10,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1336307981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255607018] [2024-11-09 05:01:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:10,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:10,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:10,201 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:10,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-09 05:01:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:10,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:01:10,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:10,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255607018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:10,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:01:10,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-09 05:01:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612948422] [2024-11-09 05:01:10,630 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:10,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:01:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:01:10,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:01:10,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:01:10,633 INFO L87 Difference]: Start difference. First operand 1116 states and 1175 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:01:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:10,848 INFO L93 Difference]: Finished difference Result 1128 states and 1192 transitions. [2024-11-09 05:01:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:01:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2024-11-09 05:01:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:10,851 INFO L225 Difference]: With dead ends: 1128 [2024-11-09 05:01:10,851 INFO L226 Difference]: Without dead ends: 1128 [2024-11-09 05:01:10,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:01:10,852 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 8 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3070 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:10,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3070 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:01:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-11-09 05:01:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1126. [2024-11-09 05:01:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 701 states have (on average 1.6790299572039944) internal successors, (1177), 1116 states have internal predecessors, (1177), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:01:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1190 transitions. [2024-11-09 05:01:10,870 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1190 transitions. Word has length 76 [2024-11-09 05:01:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:10,871 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1190 transitions. [2024-11-09 05:01:10,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:01:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1190 transitions. [2024-11-09 05:01:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 05:01:10,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:10,872 INFO L215 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] [2024-11-09 05:01:10,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:11,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:11,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-09 05:01:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:11,473 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:01:11,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:11,474 INFO L85 PathProgramCache]: Analyzing trace with hash 723837878, now seen corresponding path program 2 times [2024-11-09 05:01:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:01:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232267350] [2024-11-09 05:01:11,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:01:11,475 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 [2024-11-09 05:01:11,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:01:11,477 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:01:11,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (29)] Waiting until timeout for monitored process [2024-11-09 05:01:12,073 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:01:12,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:12,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:01:12,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:12,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:12,392 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:01:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232267350] [2024-11-09 05:01:12,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232267350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:12,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [142733499] [2024-11-09 05:01:12,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:01:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:01:12,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:01:12,394 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:01:12,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-09 05:01:14,213 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:01:14,213 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:14,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 05:01:14,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:14,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:14,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [142733499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039414772] [2024-11-09 05:01:14,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:01:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:14,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:14,364 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:14,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-09 05:01:33,064 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:01:33,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:33,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:01:33,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:33,088 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 [2024-11-09 05:01:33,238 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:01:33,238 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 [2024-11-09 05:01:33,273 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 [2024-11-09 05:01:33,593 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:01:33,593 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 [2024-11-09 05:01:33,665 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 [2024-11-09 05:01:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:01:33,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:33,816 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 05:01:33,816 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 [2024-11-09 05:01:33,823 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1826 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1826) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-09 05:01:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039414772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:01:33,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 05:01:33,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2024-11-09 05:01:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733705265] [2024-11-09 05:01:33,826 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 05:01:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:01:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 05:01:33,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2024-11-09 05:01:33,828 INFO L87 Difference]: Start difference. First operand 1126 states and 1190 transitions. Second operand has 23 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:01:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:45,792 INFO L93 Difference]: Finished difference Result 1511 states and 1607 transitions. [2024-11-09 05:01:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 05:01:45,792 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 79 [2024-11-09 05:01:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:45,795 INFO L225 Difference]: With dead ends: 1511 [2024-11-09 05:01:45,795 INFO L226 Difference]: Without dead ends: 1507 [2024-11-09 05:01:45,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=407, Invalid=2046, Unknown=1, NotChecked=96, Total=2550 [2024-11-09 05:01:45,797 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 727 mSDsluCounter, 7006 mSDsCounter, 0 mSdLazyCounter, 5638 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 7669 SdHoareTripleChecker+Invalid, 5669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:45,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 7669 Invalid, 5669 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 5638 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2024-11-09 05:01:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-11-09 05:01:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1134. [2024-11-09 05:01:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 710 states have (on average 1.6732394366197183) internal successors, (1188), 1124 states have internal predecessors, (1188), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:01:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1201 transitions. [2024-11-09 05:01:45,821 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1201 transitions. Word has length 79 [2024-11-09 05:01:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:45,821 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1201 transitions. [2024-11-09 05:01:45,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 7.0) internal successors, (154), 22 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:01:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1201 transitions. [2024-11-09 05:01:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 05:01:45,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:45,822 INFO L215 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] [2024-11-09 05:01:45,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (29)] Ended with exit code 0 [2024-11-09 05:01:46,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-11-09 05:01:46,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-09 05:01:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:01:46,423 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:01:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1697403991, now seen corresponding path program 1 times [2024-11-09 05:01:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:01:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514079045] [2024-11-09 05:01:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:46,425 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 [2024-11-09 05:01:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:01:46,426 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:01:46,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (32)] Waiting until timeout for monitored process [2024-11-09 05:01:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:46,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 05:01:46,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:46,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:47,530 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:47,531 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:01:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514079045] [2024-11-09 05:01:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514079045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092603631] [2024-11-09 05:01:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:47,532 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:01:47,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:01:47,534 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:01:47,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-09 05:01:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:48,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 05:01:48,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:48,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2092603631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:48,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140195848] [2024-11-09 05:01:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:01:48,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:48,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:48,426 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:48,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-09 05:01:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:01:48,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 05:01:48,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:48,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140195848] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:49,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 05:01:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-09 05:01:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015794282] [2024-11-09 05:01:49,743 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 05:01:49,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 05:01:49,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:01:49,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 05:01:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 05:01:49,746 INFO L87 Difference]: Start difference. First operand 1134 states and 1201 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 05:01:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:01:52,001 INFO L93 Difference]: Finished difference Result 1160 states and 1242 transitions. [2024-11-09 05:01:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 05:01:52,002 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 85 [2024-11-09 05:01:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:01:52,004 INFO L225 Difference]: With dead ends: 1160 [2024-11-09 05:01:52,005 INFO L226 Difference]: Without dead ends: 1154 [2024-11-09 05:01:52,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 05:01:52,006 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 14 mSDsluCounter, 18359 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19383 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:01:52,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 19383 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 05:01:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-09 05:01:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1152. [2024-11-09 05:01:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 728 states have (on average 1.6634615384615385) internal successors, (1211), 1142 states have internal predecessors, (1211), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:01:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1224 transitions. [2024-11-09 05:01:52,023 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1224 transitions. Word has length 85 [2024-11-09 05:01:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:01:52,023 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1224 transitions. [2024-11-09 05:01:52,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 05:01:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1224 transitions. [2024-11-09 05:01:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 05:01:52,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:01:52,025 INFO L215 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] [2024-11-09 05:01:52,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (32)] Ended with exit code 0 [2024-11-09 05:01:52,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-09 05:01:52,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-09 05:01:52,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:52,626 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:01:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:01:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1409830295, now seen corresponding path program 2 times [2024-11-09 05:01:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:01:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668240347] [2024-11-09 05:01:52,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:01:52,627 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 [2024-11-09 05:01:52,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:01:52,630 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:01:52,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Waiting until timeout for monitored process [2024-11-09 05:01:53,266 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:01:53,266 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:53,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 05:01:53,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:53,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:55,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:01:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668240347] [2024-11-09 05:01:55,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668240347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:55,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1015729720] [2024-11-09 05:01:55,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:01:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:01:55,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:01:55,481 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:01:55,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2024-11-09 05:01:57,493 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:01:57,493 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:01:57,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 05:01:57,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:01:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:57,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:01:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:01:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1015729720] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:01:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166782168] [2024-11-09 05:01:57,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 05:01:57,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:01:57,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:01:57,954 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:01:57,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-09 05:02:31,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 05:02:31,993 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:02:32,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 05:02:32,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:02:32,207 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:02:32,208 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 [2024-11-09 05:02:32,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 05:02:32,325 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 [2024-11-09 05:02:32,337 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 [2024-11-09 05:02:32,722 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 [2024-11-09 05:02:32,730 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 [2024-11-09 05:02:33,464 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:02:33,465 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 [2024-11-09 05:02:33,473 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 [2024-11-09 05:02:33,655 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 [2024-11-09 05:02:33,661 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 [2024-11-09 05:02:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 05:02:33,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:02:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166782168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:02:35,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 05:02:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2024-11-09 05:02:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075450687] [2024-11-09 05:02:35,437 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 05:02:35,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 05:02:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:02:35,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 05:02:35,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=698, Invalid=2814, Unknown=28, NotChecked=0, Total=3540 [2024-11-09 05:02:35,440 INFO L87 Difference]: Start difference. First operand 1152 states and 1224 transitions. Second operand has 57 states, 56 states have (on average 3.3392857142857144) internal successors, (187), 57 states have internal predecessors, (187), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:03:22,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:22,361 INFO L93 Difference]: Finished difference Result 1564 states and 1691 transitions. [2024-11-09 05:03:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-09 05:03:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.3392857142857144) internal successors, (187), 57 states have internal predecessors, (187), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2024-11-09 05:03:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:22,364 INFO L225 Difference]: With dead ends: 1564 [2024-11-09 05:03:22,365 INFO L226 Difference]: Without dead ends: 1556 [2024-11-09 05:03:22,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3110 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=3102, Invalid=14682, Unknown=38, NotChecked=0, Total=17822 [2024-11-09 05:03:22,370 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 754 mSDsluCounter, 19302 mSDsCounter, 0 mSdLazyCounter, 16127 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 19970 SdHoareTripleChecker+Invalid, 16207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 16127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:22,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 19970 Invalid, 16207 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [80 Valid, 16127 Invalid, 0 Unknown, 0 Unchecked, 36.8s Time] [2024-11-09 05:03:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-11-09 05:03:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1185. [2024-11-09 05:03:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 762 states have (on average 1.643044619422572) internal successors, (1252), 1175 states have internal predecessors, (1252), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:03:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1265 transitions. [2024-11-09 05:03:22,392 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1265 transitions. Word has length 97 [2024-11-09 05:03:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:22,393 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1265 transitions. [2024-11-09 05:03:22,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.3392857142857144) internal successors, (187), 57 states have internal predecessors, (187), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:03:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1265 transitions. [2024-11-09 05:03:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 05:03:22,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:22,395 INFO L215 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] [2024-11-09 05:03:22,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2024-11-09 05:03:22,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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)] Ended with exit code 0 [2024-11-09 05:03:22,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-09 05:03:22,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:22,996 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:03:22,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash -156854412, now seen corresponding path program 1 times [2024-11-09 05:03:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:03:22,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159604082] [2024-11-09 05:03:22,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:22,998 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 [2024-11-09 05:03:22,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:03:22,999 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:03:23,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (38)] Waiting until timeout for monitored process [2024-11-09 05:03:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:23,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 05:03:24,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:24,016 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 [2024-11-09 05:03:24,203 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:03:24,203 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 [2024-11-09 05:03:24,247 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 [2024-11-09 05:03:24,385 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 [2024-11-09 05:03:25,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:25,867 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 [2024-11-09 05:03:26,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:26,053 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 [2024-11-09 05:03:26,100 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 [2024-11-09 05:03:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:03:26,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:26,237 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3553) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-11-09 05:03:26,256 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3553 (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_3553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:03:26,788 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3553 (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~mem36#1.base| v_ArrVal_3599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3553)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:03:26,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:03:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159604082] [2024-11-09 05:03:26,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159604082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1933937324] [2024-11-09 05:03:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:26,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:03:26,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:03:26,793 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:03:26,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-09 05:03:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:29,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 05:03:29,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:29,787 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 [2024-11-09 05:03:30,019 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:03:30,019 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 [2024-11-09 05:03:30,055 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 [2024-11-09 05:03:30,149 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 [2024-11-09 05:03:31,390 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:31,391 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 [2024-11-09 05:03:31,513 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:31,513 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 [2024-11-09 05:03:31,554 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 [2024-11-09 05:03:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:03:31,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:31,594 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4023) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 05:03:31,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_4023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2024-11-09 05:03:32,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4023 (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~mem36#1.base| v_ArrVal_4069))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4023)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 05:03:32,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1933937324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72064146] [2024-11-09 05:03:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:32,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:32,121 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:32,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-09 05:03:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:32,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 05:03:32,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:33,103 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:03:33,104 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 [2024-11-09 05:03:33,137 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 [2024-11-09 05:03:34,007 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:34,008 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 [2024-11-09 05:03:34,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:34,190 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 [2024-11-09 05:03:34,218 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 [2024-11-09 05:03:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:03:34,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:34,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4491) |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 [2024-11-09 05:03:34,272 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4491 (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_4491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:03:34,956 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-09 05:03:34,956 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 [2024-11-09 05:03:34,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4537 (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~mem36#1.base| v_ArrVal_4537))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4491)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem36#1.base|)) is different from false [2024-11-09 05:03:34,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72064146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:34,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:03:34,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2024-11-09 05:03:34,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451390294] [2024-11-09 05:03:34,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:03:34,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 05:03:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:03:34,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 05:03:34,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=323, Unknown=9, NotChecked=396, Total=812 [2024-11-09 05:03:34,977 INFO L87 Difference]: Start difference. First operand 1185 states and 1265 transitions. Second operand has 19 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 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) [2024-11-09 05:03:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:48,803 INFO L93 Difference]: Finished difference Result 1555 states and 1660 transitions. [2024-11-09 05:03:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:03:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 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 122 [2024-11-09 05:03:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:48,808 INFO L225 Difference]: With dead ends: 1555 [2024-11-09 05:03:48,808 INFO L226 Difference]: Without dead ends: 1555 [2024-11-09 05:03:48,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 354 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=428, Unknown=9, NotChecked=450, Total=992 [2024-11-09 05:03:48,809 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 703 mSDsluCounter, 5862 mSDsCounter, 0 mSdLazyCounter, 5447 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 6523 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:48,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 6523 Invalid, 5459 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 5447 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2024-11-09 05:03:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-09 05:03:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1184. [2024-11-09 05:03:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 762 states have (on average 1.641732283464567) internal successors, (1251), 1174 states have internal predecessors, (1251), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:03:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1264 transitions. [2024-11-09 05:03:48,831 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1264 transitions. Word has length 122 [2024-11-09 05:03:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:48,831 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1264 transitions. [2024-11-09 05:03:48,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 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) [2024-11-09 05:03:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1264 transitions. [2024-11-09 05:03:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 05:03:48,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:48,834 INFO L215 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] [2024-11-09 05:03:48,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (38)] Ended with exit code 0 [2024-11-09 05:03:49,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2024-11-09 05:03:49,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-09 05:03:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:49,435 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:03:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash -156854411, now seen corresponding path program 1 times [2024-11-09 05:03:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:03:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873511688] [2024-11-09 05:03:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:49,436 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 [2024-11-09 05:03:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:03:49,438 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:03:49,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (41)] Waiting until timeout for monitored process [2024-11-09 05:03:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:50,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-09 05:03:50,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:50,509 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 [2024-11-09 05:03:50,725 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 [2024-11-09 05:03:50,745 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:03:50,746 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 [2024-11-09 05:03:50,780 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 [2024-11-09 05:03:50,788 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 [2024-11-09 05:03:50,934 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 [2024-11-09 05:03:50,944 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 [2024-11-09 05:03:51,990 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:51,990 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 [2024-11-09 05:03:52,000 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 [2024-11-09 05:03:52,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:52,179 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 [2024-11-09 05:03:52,188 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 [2024-11-09 05:03:52,236 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 [2024-11-09 05:03:52,244 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 [2024-11-09 05:03:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:03:52,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:52,746 WARN L851 $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_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5007) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 05:03:54,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5007 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5099))) (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~mem36#1.base| v_ArrVal_5100) .cse0 v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5007) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5008 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5100) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5008) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-09 05:03:54,453 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:03:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873511688] [2024-11-09 05:03:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873511688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [511173163] [2024-11-09 05:03:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:54,454 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:03:54,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:03:54,455 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:03:54,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2024-11-09 05:03:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:58,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-09 05:03:58,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:58,912 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 [2024-11-09 05:03:58,919 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 [2024-11-09 05:03:59,553 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:03:59,553 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 [2024-11-09 05:03:59,562 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 12 treesize of output 14 [2024-11-09 05:03:59,650 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 15 treesize of output 1 [2024-11-09 05:03:59,658 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 [2024-11-09 05:03:59,783 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 17 treesize of output 9 [2024-11-09 05:03:59,859 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 [2024-11-09 05:04:00,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:04:00,803 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 [2024-11-09 05:04:01,182 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 48 treesize of output 34 [2024-11-09 05:04:01,198 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 [2024-11-09 05:04:01,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:01,469 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2024-11-09 05:04:01,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:04:01,483 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 [2024-11-09 05:04:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:04:01,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:04:01,995 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 [2024-11-09 05:04:47,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [511173163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:47,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773190253] [2024-11-09 05:04:47,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:47,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:47,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:04:47,614 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:04:47,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-11-09 05:04:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:48,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-09 05:04:48,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:04:49,157 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 [2024-11-09 05:04:49,237 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:04:49,238 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 [2024-11-09 05:04:49,273 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 [2024-11-09 05:04:49,306 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 [2024-11-09 05:04:49,567 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 [2024-11-09 05:04:49,584 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 [2024-11-09 05:04:52,895 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:04:52,896 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 [2024-11-09 05:04:52,915 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 [2024-11-09 05:04:53,218 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:04:53,219 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 [2024-11-09 05:04:53,236 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 [2024-11-09 05:04:53,359 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 [2024-11-09 05:04:53,400 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 [2024-11-09 05:04:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:04:53,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:04:53,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-09 05:04:53,699 WARN L851 $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_6043 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 05:04:56,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6135) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6136) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_6043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6044 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6136))) (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~mem36#1.base| v_ArrVal_6135) .cse2 v_ArrVal_6043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 05:04:56,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773190253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:56,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:04:56,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2024-11-09 05:04:56,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821607551] [2024-11-09 05:04:56,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:04:56,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 05:04:56,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:04:56,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 05:04:56,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=551, Unknown=30, NotChecked=260, Total=930 [2024-11-09 05:04:56,774 INFO L87 Difference]: Start difference. First operand 1184 states and 1264 transitions. Second operand has 20 states, 17 states have (on average 9.117647058823529) internal successors, (155), 20 states have internal predecessors, (155), 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) [2024-11-09 05:06:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:06:16,958 INFO L93 Difference]: Finished difference Result 1927 states and 2058 transitions. [2024-11-09 05:06:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:06:16,960 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.117647058823529) internal successors, (155), 20 states have internal predecessors, (155), 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 122 [2024-11-09 05:06:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:06:16,964 INFO L225 Difference]: With dead ends: 1927 [2024-11-09 05:06:16,965 INFO L226 Difference]: Without dead ends: 1927 [2024-11-09 05:06:16,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 351 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 46.7s TimeCoverageRelationStatistics Valid=172, Invalid=940, Unknown=30, NotChecked=340, Total=1482 [2024-11-09 05:06:16,966 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 1055 mSDsluCounter, 5329 mSDsCounter, 0 mSdLazyCounter, 9156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 5861 SdHoareTripleChecker+Invalid, 9169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 9156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:06:16,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 5861 Invalid, 9169 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 9156 Invalid, 0 Unknown, 0 Unchecked, 77.3s Time] [2024-11-09 05:06:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2024-11-09 05:06:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1183. [2024-11-09 05:06:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 762 states have (on average 1.6404199475065617) internal successors, (1250), 1173 states have internal predecessors, (1250), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:06:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1263 transitions. [2024-11-09 05:06:17,004 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1263 transitions. Word has length 122 [2024-11-09 05:06:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:06:17,005 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1263 transitions. [2024-11-09 05:06:17,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.117647058823529) internal successors, (155), 20 states have internal predecessors, (155), 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) [2024-11-09 05:06:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1263 transitions. [2024-11-09 05:06:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 05:06:17,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:06:17,007 INFO L215 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] [2024-11-09 05:06:17,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (42)] Ended with exit code 0 [2024-11-09 05:06:17,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2024-11-09 05:06:17,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (41)] Ended with exit code 0 [2024-11-09 05:06:17,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 [2024-11-09 05:06:17,608 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:06:17,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:06:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash 74930077, now seen corresponding path program 1 times [2024-11-09 05:06:17,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:06:17,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475578840] [2024-11-09 05:06:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:17,610 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 [2024-11-09 05:06:17,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:06:17,611 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:06:17,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (44)] Waiting until timeout for monitored process [2024-11-09 05:06:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:18,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 05:06:18,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:18,746 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 [2024-11-09 05:06:19,726 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:06:19,726 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 [2024-11-09 05:06:19,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 [2024-11-09 05:06:20,317 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 [2024-11-09 05:06:24,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:06:24,506 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 [2024-11-09 05:06:24,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:06:24,952 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 [2024-11-09 05:06:25,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:06:25,383 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 [2024-11-09 05:06:25,493 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 [2024-11-09 05:06:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:06:25,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:06:25,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6576) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 05:06:26,003 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (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_6576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:06:26,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6575 (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~mem38#1.base| v_ArrVal_6575))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:06:26,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6575 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6575))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:06:27,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6575 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6622))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6575)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:06:27,252 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:06:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475578840] [2024-11-09 05:06:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475578840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:06:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1911466511] [2024-11-09 05:06:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:06:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:06:27,254 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:06:27,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2024-11-09 05:06:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:50,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 05:06:50,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:50,685 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 [2024-11-09 05:06:51,692 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:06:51,693 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 [2024-11-09 05:06:51,770 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 [2024-11-09 05:06:52,081 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 [2024-11-09 05:06:56,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:06:56,233 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 [2024-11-09 05:06:56,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:06:56,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 [2024-11-09 05:06:56,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:06:56,804 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 [2024-11-09 05:06:56,915 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 [2024-11-09 05:06:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:06:56,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:06:57,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7062 (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_7062) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:06:57,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7062 (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~mem38#1.base| v_ArrVal_7061))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7062)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:06:57,384 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7062 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7061))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7062)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:06:58,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7061 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7062 (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 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7108))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7061)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7062)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 05:06:58,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1911466511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:06:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520186014] [2024-11-09 05:06:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:58,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:06:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:06:58,631 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:06:58,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2024-11-09 05:06:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:59,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 05:06:59,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:59,626 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 [2024-11-09 05:07:00,541 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:07:00,542 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 [2024-11-09 05:07:00,723 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 [2024-11-09 05:07:03,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:07:03,993 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 [2024-11-09 05:07:04,700 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:07:04,700 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 [2024-11-09 05:07:05,171 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:07:05,171 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 [2024-11-09 05:07:05,258 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 [2024-11-09 05:07:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:07:05,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:07:05,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7547) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 05:07:05,399 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7547 (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_7547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:07:05,460 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7547 (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~mem38#1.base| v_ArrVal_7546))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7547)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-09 05:07:05,502 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7547 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7546))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7547)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:07:06,886 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-09 05:07:06,886 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 61 treesize of output 60 [2024-11-09 05:07:06,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (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~mem36#1.base| v_ArrVal_7593))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7546)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7547)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 05:07:06,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520186014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:06,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:07:06,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 20 [2024-11-09 05:07:06,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230257285] [2024-11-09 05:07:06,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:07:06,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 05:07:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:07:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 05:07:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=430, Unknown=21, NotChecked=770, Total=1332 [2024-11-09 05:07:06,936 INFO L87 Difference]: Start difference. First operand 1183 states and 1263 transitions. Second operand has 21 states, 18 states have (on average 5.666666666666667) internal successors, (102), 20 states have internal predecessors, (102), 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) [2024-11-09 05:07:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:40,425 INFO L93 Difference]: Finished difference Result 1553 states and 1658 transitions. [2024-11-09 05:07:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:07:40,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.666666666666667) internal successors, (102), 20 states have internal predecessors, (102), 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 125 [2024-11-09 05:07:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:40,429 INFO L225 Difference]: With dead ends: 1553 [2024-11-09 05:07:40,430 INFO L226 Difference]: Without dead ends: 1553 [2024-11-09 05:07:40,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 364 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=132, Invalid=553, Unknown=21, NotChecked=854, Total=1560 [2024-11-09 05:07:40,431 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 698 mSDsluCounter, 3730 mSDsCounter, 0 mSdLazyCounter, 3488 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 3501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:40,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 4391 Invalid, 3501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 3488 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2024-11-09 05:07:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2024-11-09 05:07:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1182. [2024-11-09 05:07:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 762 states have (on average 1.6391076115485563) internal successors, (1249), 1172 states have internal predecessors, (1249), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:07:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1262 transitions. [2024-11-09 05:07:40,452 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1262 transitions. Word has length 125 [2024-11-09 05:07:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:40,453 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1262 transitions. [2024-11-09 05:07:40,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.666666666666667) internal successors, (102), 20 states have internal predecessors, (102), 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) [2024-11-09 05:07:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1262 transitions. [2024-11-09 05:07:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 05:07:40,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:40,455 INFO L215 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] [2024-11-09 05:07:40,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2024-11-09 05:07:40,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (44)] Forceful destruction successful, exit code 0 [2024-11-09 05:07:40,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2024-11-09 05:07:41,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:07:41,056 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:07:41,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash 74930078, now seen corresponding path program 1 times [2024-11-09 05:07:41,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:07:41,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206649133] [2024-11-09 05:07:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:41,058 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 [2024-11-09 05:07:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:07:41,059 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:07:41,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (47)] Waiting until timeout for monitored process [2024-11-09 05:07:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:42,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 05:07:42,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:42,546 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 [2024-11-09 05:07:43,613 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:07:43,613 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 [2024-11-09 05:07:43,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 05:07:43,772 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 [2024-11-09 05:07:43,792 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 [2024-11-09 05:07:44,385 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 [2024-11-09 05:07:44,405 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 [2024-11-09 05:07:48,151 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:07:48,152 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 [2024-11-09 05:07:48,206 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 [2024-11-09 05:07:48,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:07:48,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 62 treesize of output 57 [2024-11-09 05:07:48,760 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 [2024-11-09 05:07:49,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:07:49,263 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 [2024-11-09 05:07:49,284 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 [2024-11-09 05:07:49,416 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 [2024-11-09 05:07:49,435 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 [2024-11-09 05:07:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:07:49,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:07:50,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:07:50,262 WARN L851 $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_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 05:07:50,384 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8078))) (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~mem38#1.base| v_ArrVal_8079) .cse0 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8079) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2024-11-09 05:07:50,467 WARN L851 $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_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8078))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8079) .cse1 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8079) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 05:07:54,445 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8173))) (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~mem36#1.base| v_ArrVal_8172) .cse1 v_ArrVal_8079) (select (select (store .cse2 .cse1 v_ArrVal_8078) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8080))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8173))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8078))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8172) .cse4 v_ArrVal_8079) .cse5 v_ArrVal_8080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 05:07:54,467 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:07:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206649133] [2024-11-09 05:07:54,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206649133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [939284775] [2024-11-09 05:07:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:54,468 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:07:54,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:07:54,469 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:07:54,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2024-11-09 05:10:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:10:11,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 05:10:11,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:10:11,590 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 [2024-11-09 05:10:12,493 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:10:12,494 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 [2024-11-09 05:10:12,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 05:10:12,561 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 [2024-11-09 05:10:12,578 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 [2024-11-09 05:10:12,853 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 [2024-11-09 05:10:12,870 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 [2024-11-09 05:10:16,147 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:10:16,148 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 [2024-11-09 05:10:16,166 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 [2024-11-09 05:10:16,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:10:16,493 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 [2024-11-09 05:10:16,511 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 [2024-11-09 05:10:16,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:10:16,774 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 [2024-11-09 05:10:16,792 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 [2024-11-09 05:10:16,906 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 [2024-11-09 05:10:16,922 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 [2024-11-09 05:10:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:10:16,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:10:17,511 WARN L851 $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_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-09 05:10:17,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8659) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8658))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8659) .cse2 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 05:10:17,857 WARN L851 $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_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8659) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8658))) (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_8659) .cse3 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 05:10:20,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8753))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8658))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8752) .cse0 v_ArrVal_8659) .cse1 v_ArrVal_8660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8753))) (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~mem36#1.base| v_ArrVal_8752) .cse6 v_ArrVal_8659) (select (select (store .cse7 .cse6 v_ArrVal_8658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8660))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-09 05:10:20,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [939284775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:10:20,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060846998] [2024-11-09 05:10:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:10:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:10:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:10:20,931 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:10:20,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-09 05:10:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:10:21,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 05:10:21,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:10:22,770 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:10:22,770 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 [2024-11-09 05:10:22,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 05:10:22,839 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 [2024-11-09 05:10:22,856 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 [2024-11-09 05:10:23,130 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 [2024-11-09 05:10:23,147 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 [2024-11-09 05:10:26,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:10:26,225 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 [2024-11-09 05:10:26,242 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 [2024-11-09 05:10:26,561 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:10:26,561 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 [2024-11-09 05:10:26,578 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 [2024-11-09 05:10:26,832 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:10:26,833 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 [2024-11-09 05:10:26,850 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 [2024-11-09 05:10:26,964 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 [2024-11-09 05:10:26,980 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 [2024-11-09 05:10:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:10:27,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:10:27,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9239) |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~mem39#1.base| v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-09 05:10:27,243 WARN L851 $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_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 05:10:27,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9237) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9238))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9237) .cse2 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 05:10:27,496 WARN L851 $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_9240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9238))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9237) .cse1 v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9240) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9239 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9237) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9239) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 05:10:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060846998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:10:36,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:10:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-09 05:10:36,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436125092] [2024-11-09 05:10:36,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:10:36,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:10:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:10:36,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:10:36,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=172, Unknown=26, NotChecked=494, Total=756 [2024-11-09 05:10:36,744 INFO L87 Difference]: Start difference. First operand 1182 states and 1262 transitions. Second operand has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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) [2024-11-09 05:11:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:11:06,577 INFO L93 Difference]: Finished difference Result 1550 states and 1655 transitions. [2024-11-09 05:11:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:11:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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 125 [2024-11-09 05:11:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:11:06,582 INFO L225 Difference]: With dead ends: 1550 [2024-11-09 05:11:06,582 INFO L226 Difference]: Without dead ends: 1550 [2024-11-09 05:11:06,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 371 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=104, Invalid=339, Unknown=29, NotChecked=650, Total=1122 [2024-11-09 05:11:06,583 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 698 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 3209 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:11:06,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2575 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3209 Invalid, 0 Unknown, 0 Unchecked, 27.6s Time] [2024-11-09 05:11:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2024-11-09 05:11:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1181. [2024-11-09 05:11:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 762 states have (on average 1.6377952755905512) internal successors, (1248), 1171 states have internal predecessors, (1248), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:11:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1261 transitions. [2024-11-09 05:11:06,604 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1261 transitions. Word has length 125 [2024-11-09 05:11:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:11:06,604 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1261 transitions. [2024-11-09 05:11:06,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.444444444444445) internal successors, (85), 11 states have internal predecessors, (85), 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) [2024-11-09 05:11:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1261 transitions. [2024-11-09 05:11:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 05:11:06,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:11:06,607 INFO L215 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, 1, 1] [2024-11-09 05:11:06,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2024-11-09 05:11:06,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (47)] Forceful destruction successful, exit code 0 [2024-11-09 05:11:07,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2024-11-09 05:11:07,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 05:11:07,208 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:11:07,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:11:07,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1140763141, now seen corresponding path program 1 times [2024-11-09 05:11:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:11:07,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230492273] [2024-11-09 05:11:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:07,209 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 [2024-11-09 05:11:07,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:11:07,210 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:11:07,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (50)] Waiting until timeout for monitored process [2024-11-09 05:11:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:08,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 05:11:08,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:11:08,506 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 [2024-11-09 05:11:09,493 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:11:09,493 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 [2024-11-09 05:11:09,625 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 [2024-11-09 05:11:10,091 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 [2024-11-09 05:11:14,062 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:11:14,063 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 [2024-11-09 05:11:14,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:11:14,547 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 [2024-11-09 05:11:14,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:11:14,960 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 [2024-11-09 05:11:15,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:11:15,392 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 [2024-11-09 05:11:15,485 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 [2024-11-09 05:11:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:11:15,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:11:16,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (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_9788) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:11:16,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (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~mem39#1.base| v_ArrVal_9787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:11:16,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:11:16,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9786 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:11:16,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9786 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9786))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:11:17,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9786 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9834))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9786)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9787)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:11:17,579 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:11:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230492273] [2024-11-09 05:11:17,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230492273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:11:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [411278682] [2024-11-09 05:11:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:11:17,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:11:17,581 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:11:17,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2024-11-09 05:12:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:05,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 05:12:05,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:05,250 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 [2024-11-09 05:12:06,164 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 05:12:06,164 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 [2024-11-09 05:12:06,226 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 [2024-11-09 05:12:06,507 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 [2024-11-09 05:12:10,068 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:10,068 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 [2024-11-09 05:12:10,349 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:10,349 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 [2024-11-09 05:12:10,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:10,595 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 [2024-11-09 05:12:10,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:10,841 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 [2024-11-09 05:12:10,950 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 [2024-11-09 05:12:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:12:10,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:12:11,338 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9788 (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~mem39#1.base| v_ArrVal_10289))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:12:11,375 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9788 (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_10289))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-09 05:12:11,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9788 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10288))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:12:11,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9788 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10288))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:12:12,687 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10289 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9788 (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~mem36#1.base| v_ArrVal_10336))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10288)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10289)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 05:12:12,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [411278682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:12,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424751879] [2024-11-09 05:12:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:12,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:12:12,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:12:12,704 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:12:12,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-09 05:12:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:13,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 05:12:13,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:14,491 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:12:14,492 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 [2024-11-09 05:12:14,659 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 [2024-11-09 05:12:17,545 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:17,546 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 [2024-11-09 05:12:18,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:18,269 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 [2024-11-09 05:12:18,693 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:18,693 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 [2024-11-09 05:12:19,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:12:19,124 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 [2024-11-09 05:12:19,201 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 [2024-11-09 05:12:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:12:19,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:12:19,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10790) |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 [2024-11-09 05:12:19,325 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (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_10790) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:12:19,378 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (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~mem39#1.base| v_ArrVal_10789))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10790)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:12:19,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10789))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10790)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:12:19,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10788))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10789)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10790)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:12:19,511 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (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 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10788))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10789)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10790)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:12:20,830 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2024-11-09 05:12:20,830 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 109 treesize of output 108 [2024-11-09 05:12:20,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10789 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (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~mem36#1.base| v_ArrVal_10836))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10788)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10789)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10790)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 05:12:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424751879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:20,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:12:20,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 22 [2024-11-09 05:12:20,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002900459] [2024-11-09 05:12:20,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:12:20,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 05:12:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:12:20,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 05:12:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=514, Unknown=26, NotChecked=1134, Total=1806 [2024-11-09 05:12:20,889 INFO L87 Difference]: Start difference. First operand 1181 states and 1261 transitions. Second operand has 23 states, 20 states have (on average 5.6) internal successors, (112), 22 states have internal predecessors, (112), 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) [2024-11-09 05:13:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:25,449 INFO L93 Difference]: Finished difference Result 1551 states and 1656 transitions. [2024-11-09 05:13:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:13:25,450 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.6) internal successors, (112), 22 states have internal predecessors, (112), 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 128 [2024-11-09 05:13:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:25,455 INFO L225 Difference]: With dead ends: 1551 [2024-11-09 05:13:25,455 INFO L226 Difference]: Without dead ends: 1551 [2024-11-09 05:13:25,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 375 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=153, Invalid=648, Unknown=27, NotChecked=1242, Total=2070 [2024-11-09 05:13:25,456 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 693 mSDsluCounter, 8302 mSDsCounter, 0 mSdLazyCounter, 7852 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 8961 SdHoareTripleChecker+Invalid, 7863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 7852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:25,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 8961 Invalid, 7863 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 7852 Invalid, 0 Unknown, 0 Unchecked, 63.8s Time] [2024-11-09 05:13:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-09 05:13:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1180. [2024-11-09 05:13:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 762 states have (on average 1.636482939632546) internal successors, (1247), 1170 states have internal predecessors, (1247), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 05:13:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1260 transitions. [2024-11-09 05:13:25,475 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1260 transitions. Word has length 128 [2024-11-09 05:13:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:25,476 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1260 transitions. [2024-11-09 05:13:25,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.6) internal successors, (112), 22 states have internal predecessors, (112), 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) [2024-11-09 05:13:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1260 transitions. [2024-11-09 05:13:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 05:13:25,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:25,478 INFO L215 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, 1, 1] [2024-11-09 05:13:25,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (51)] Ended with exit code 0 [2024-11-09 05:13:25,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (50)] Ended with exit code 0 [2024-11-09 05:13:25,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2024-11-09 05:13:26,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:26,079 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 05:13:26,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1140763140, now seen corresponding path program 1 times [2024-11-09 05:13:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:13:26,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364530490] [2024-11-09 05:13:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:26,081 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 [2024-11-09 05:13:26,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:13:26,082 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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) [2024-11-09 05:13:26,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/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 (53)] Waiting until timeout for monitored process [2024-11-09 05:13:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:27,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-09 05:13:27,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:27,433 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 [2024-11-09 05:13:28,266 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 [2024-11-09 05:13:28,357 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 05:13:28,357 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 [2024-11-09 05:13:28,465 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 [2024-11-09 05:13:28,497 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 [2024-11-09 05:13:28,986 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 [2024-11-09 05:13:29,002 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 [2024-11-09 05:13:32,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:13:32,288 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 [2024-11-09 05:13:32,306 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 [2024-11-09 05:13:32,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:13:32,865 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 [2024-11-09 05:13:32,883 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 [2024-11-09 05:13:33,324 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:13:33,324 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 [2024-11-09 05:13:33,340 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 [2024-11-09 05:13:33,748 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:13:33,748 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 [2024-11-09 05:13:33,765 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 [2024-11-09 05:13:33,882 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 [2024-11-09 05:13:33,897 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 [2024-11-09 05:13:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 05:13:34,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:13:34,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 05:13:34,577 WARN L851 $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_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-09 05:13:34,693 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11339))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11338) .cse0 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11338) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-09 05:13:34,783 WARN L851 $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_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11339))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11338) .cse1 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11338) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-09 05:13:36,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11337))) (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~mem38#1.base| v_ArrVal_11336) .cse1 v_ArrVal_11338) (select (select (store .cse2 .cse1 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11340))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11337))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11339))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11336) .cse4 v_ArrVal_11338) .cse5 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 05:13:37,145 WARN L851 $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_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11337))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11339))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11336) .cse1 v_ArrVal_11338) .cse2 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11337))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11336) .cse7 v_ArrVal_11338) (select (select (store .cse8 .cse7 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11340))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd (_ bv24 32) .cse6))))))) is different from false [2024-11-09 05:13:41,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11341 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11432))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11337))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11339))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11433) .cse0 v_ArrVal_11336) .cse1 v_ArrVal_11338) .cse2 v_ArrVal_11340) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11341) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11340 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11432))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11337))) (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~mem36#1.base| v_ArrVal_11433) .cse8 v_ArrVal_11336) .cse9 v_ArrVal_11338) (select (select (store .cse10 .cse9 v_ArrVal_11339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11340))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-09 05:13:41,914 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:13:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364530490] [2024-11-09 05:13:41,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364530490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1722186907] [2024-11-09 05:13:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:41,915 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:13:41,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:13:41,917 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:13:41,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f14c14e9-248d-4a9a-b2ea-14140d026731/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process