./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:05:34,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:05:35,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 05:05:35,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:05:35,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:05:35,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:05:35,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:05:35,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:05:35,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:05:35,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:05:35,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:05:35,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:05:35,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:05:35,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:05:35,112 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:05:35,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:05:35,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:05:35,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:05:35,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:05:35,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:05:35,113 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:05:35,113 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:05:35,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:05:35,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:05:35,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:05:35,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:05:35,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:35,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:05:35,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:05:35,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:05:35,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:05:35,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:35,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:05:35,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:05:35,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 05:05:35,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 05:05:35,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:05:35,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:05:35,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:05:35,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:05:35,117 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer 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 -> 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 [2024-11-28 05:05:35,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:05:35,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:05:35,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:05:35,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:05:35,468 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:05:35,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2024-11-28 05:05:38,636 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/c054c25ee/bbb204efe2f64efb961a99bab348f6fe/FLAGceb3c57d6 [2024-11-28 05:05:38,998 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:05:38,999 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2024-11-28 05:05:39,015 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/c054c25ee/bbb204efe2f64efb961a99bab348f6fe/FLAGceb3c57d6 [2024-11-28 05:05:39,036 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/c054c25ee/bbb204efe2f64efb961a99bab348f6fe [2024-11-28 05:05:39,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:05:39,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:05:39,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:05:39,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:05:39,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:05:39,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:05:39" (1/1) ... [2024-11-28 05:05:39,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c84459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:39, skipping insertion in model container [2024-11-28 05:05:39,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:05:39" (1/1) ... [2024-11-28 05:05:39,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:05:39,546 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,581 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,586 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,591 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,606 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,625 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,626 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,630 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,632 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,634 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,635 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,641 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:39,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:05:39,665 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-28 05:05:39,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3e885fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:39, skipping insertion in model container [2024-11-28 05:05:39,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:05:39,668 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-28 05:05:39,670 INFO L158 Benchmark]: Toolchain (without parser) took 629.00ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 73.1MB in the end (delta: 17.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:05:39,671 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 05:05:39,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.04ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 73.1MB in the end (delta: 17.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 05:05:39,675 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.50ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 74.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.04ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 73.1MB in the end (delta: 17.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 764]: 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 05:05:42,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 05:05:42,508 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 05:05:42,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 05:05:42,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 05:05:42,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 05:05:42,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 05:05:42,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 05:05:42,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 05:05:42,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 05:05:42,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 05:05:42,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 05:05:42,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 05:05:42,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 05:05:42,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 05:05:42,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 05:05:42,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 05:05:42,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 05:05:42,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 05:05:42,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 05:05:42,574 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 05:05:42,574 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 05:05:42,574 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 05:05:42,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 05:05:42,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:42,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 05:05:42,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:42,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 05:05:42,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB 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 -> Automizer 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 -> 98addbea2d7583a98dfe535f8a62b1da98b67168a60a4eb76b7c658a539d3a89 [2024-11-28 05:05:43,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 05:05:43,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 05:05:43,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 05:05:43,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 05:05:43,018 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 05:05:43,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2024-11-28 05:05:46,148 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/9cd16d73d/dc14fba2d6084626a7deb6e25f7c931e/FLAGffd9fea99 [2024-11-28 05:05:46,601 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 05:05:46,602 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-2.i [2024-11-28 05:05:46,621 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/9cd16d73d/dc14fba2d6084626a7deb6e25f7c931e/FLAGffd9fea99 [2024-11-28 05:05:46,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/data/9cd16d73d/dc14fba2d6084626a7deb6e25f7c931e [2024-11-28 05:05:46,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 05:05:46,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 05:05:46,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 05:05:46,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 05:05:46,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 05:05:46,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:05:46" (1/1) ... [2024-11-28 05:05:46,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eef5429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:46, skipping insertion in model container [2024-11-28 05:05:46,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:05:46" (1/1) ... [2024-11-28 05:05:46,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:05:47,263 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,330 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,335 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,341 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,350 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,375 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,377 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,379 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,381 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,383 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,383 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,390 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:05:47,409 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-28 05:05:47,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 05:05:47,457 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,480 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,483 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,492 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,506 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,539 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,540 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,549 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,550 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,551 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,552 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,558 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 05:05:47,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:05:47,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 05:05:47,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 05:05:47,778 INFO L204 MainTranslator]: Completed translation [2024-11-28 05:05:47,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47 WrapperNode [2024-11-28 05:05:47,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 05:05:47,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 05:05:47,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 05:05:47,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 05:05:47,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:47,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:47,886 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 784 [2024-11-28 05:05:47,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 05:05:47,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 05:05:47,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 05:05:47,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 05:05:47,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:47,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:47,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,017 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-28 05:05:48,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 05:05:48,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 05:05:48,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 05:05:48,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 05:05:48,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (1/1) ... [2024-11-28 05:05:48,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 05:05:48,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:48,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 05:05:48,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 05:05:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 05:05:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 05:05:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 05:05:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 05:05:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-28 05:05:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-28 05:05:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-28 05:05:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-28 05:05:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-28 05:05:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-28 05:05:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 05:05:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 05:05:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 05:05:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 05:05:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 05:05:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 05:05:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 05:05:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 05:05:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 05:05:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 05:05:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 05:05:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 05:05:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 05:05:48,548 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 05:05:48,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 05:05:48,555 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:05:48,635 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-28 05:05:53,214 INFO L? ?]: Removed 906 outVars from TransFormulas that were not future-live. [2024-11-28 05:05:53,214 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 05:05:53,255 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 05:05:53,259 INFO L312 CfgBuilder]: Removed 23 assume(true) statements. [2024-11-28 05:05:53,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:05:53 BoogieIcfgContainer [2024-11-28 05:05:53,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 05:05:53,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 05:05:53,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 05:05:53,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 05:05:53,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:05:46" (1/3) ... [2024-11-28 05:05:53,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cea5e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:05:53, skipping insertion in model container [2024-11-28 05:05:53,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:05:47" (2/3) ... [2024-11-28 05:05:53,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cea5e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:05:53, skipping insertion in model container [2024-11-28 05:05:53,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:05:53" (3/3) ... [2024-11-28 05:05:53,277 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-2.i [2024-11-28 05:05:53,297 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 05:05:53,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test1-2.i that has 4 procedures, 863 locations, 1 initial locations, 25 loop locations, and 425 error locations. [2024-11-28 05:05:53,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 05:05:53,413 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=PETRI_NET, 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;@72f1a82a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 05:05:53,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-28 05:05:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:05:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:53,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:53,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:53,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:05:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103276, now seen corresponding path program 1 times [2024-11-28 05:05:53,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:05:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397814570] [2024-11-28 05:05:53,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:53,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:53,464 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:53,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 05:05:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:53,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 05:05:53,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:53,677 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-28 05:05:53,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:05:53,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:05:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397814570] [2024-11-28 05:05:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397814570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:53,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:05:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166806393] [2024-11-28 05:05:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:53,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 05:05:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:05:53,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 05:05:53,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:05:53,720 INFO L87 Difference]: Start difference. First operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:53,802 INFO L93 Difference]: Finished difference Result 848 states and 905 transitions. [2024-11-28 05:05:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 05:05:53,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 05:05:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:53,830 INFO L225 Difference]: With dead ends: 848 [2024-11-28 05:05:53,834 INFO L226 Difference]: Without dead ends: 846 [2024-11-28 05:05:53,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 05:05:53,843 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:53,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:05:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-28 05:05:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2024-11-28 05:05:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 414 states have (on average 2.1183574879227054) internal successors, (877), 840 states have internal predecessors, (877), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:05:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 903 transitions. [2024-11-28 05:05:53,969 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 903 transitions. Word has length 6 [2024-11-28 05:05:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:53,969 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 903 transitions. [2024-11-28 05:05:53,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 903 transitions. [2024-11-28 05:05:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:53,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:53,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:53,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 05:05:54,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:54,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:05:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103338, now seen corresponding path program 1 times [2024-11-28 05:05:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:05:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273942069] [2024-11-28 05:05:54,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:54,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:54,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:54,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:54,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 05:05:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:54,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:05:54,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:54,392 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-28 05:05:54,424 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-28 05:05:54,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:05:54,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:05:54,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273942069] [2024-11-28 05:05:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273942069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:54,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:54,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:05:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952268637] [2024-11-28 05:05:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:05:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:05:54,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:05:54,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:05:54,431 INFO L87 Difference]: Start difference. First operand 846 states and 903 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:56,575 INFO L93 Difference]: Finished difference Result 800 states and 858 transitions. [2024-11-28 05:05:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:05:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 05:05:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:56,580 INFO L225 Difference]: With dead ends: 800 [2024-11-28 05:05:56,580 INFO L226 Difference]: Without dead ends: 800 [2024-11-28 05:05:56,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 05:05:56,581 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 536 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:56,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 662 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 05:05:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-28 05:05:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 797. [2024-11-28 05:05:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 414 states have (on average 2.0) internal successors, (828), 791 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:05:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 854 transitions. [2024-11-28 05:05:56,612 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 854 transitions. Word has length 6 [2024-11-28 05:05:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:56,612 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 854 transitions. [2024-11-28 05:05:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 854 transitions. [2024-11-28 05:05:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:56,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:56,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:56,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 05:05:56,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:56,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:05:56,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:56,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1422103339, now seen corresponding path program 1 times [2024-11-28 05:05:56,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:05:56,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831836835] [2024-11-28 05:05:56,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:56,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:56,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:56,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 05:05:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:56,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:05:56,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:56,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:05:57,024 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-28 05:05:57,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:05:57,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:05:57,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831836835] [2024-11-28 05:05:57,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831836835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:57,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:57,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:05:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219561504] [2024-11-28 05:05:57,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:57,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:05:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:05:57,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:05:57,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:05:57,026 INFO L87 Difference]: Start difference. First operand 797 states and 854 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:05:59,404 INFO L93 Difference]: Finished difference Result 873 states and 934 transitions. [2024-11-28 05:05:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:05:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 05:05:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:05:59,412 INFO L225 Difference]: With dead ends: 873 [2024-11-28 05:05:59,412 INFO L226 Difference]: Without dead ends: 873 [2024-11-28 05:05:59,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 05:05:59,413 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 264 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:05:59,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1052 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 05:05:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-11-28 05:05:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 824. [2024-11-28 05:05:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 451 states have (on average 1.9778270509977827) internal successors, (892), 818 states have internal predecessors, (892), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:05:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 918 transitions. [2024-11-28 05:05:59,457 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 918 transitions. Word has length 6 [2024-11-28 05:05:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:05:59,457 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 918 transitions. [2024-11-28 05:05:59,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:05:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 918 transitions. [2024-11-28 05:05:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 05:05:59,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:05:59,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 05:05:59,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 05:05:59,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:59,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:05:59,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:05:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1423050696, now seen corresponding path program 1 times [2024-11-28 05:05:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:05:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476976912] [2024-11-28 05:05:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:05:59,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:05:59,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:05:59,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:05:59,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 05:05:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:05:59,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 05:05:59,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:05:59,865 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-28 05:05:59,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:05:59,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:05:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476976912] [2024-11-28 05:05:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476976912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:05:59,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:05:59,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:05:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190100687] [2024-11-28 05:05:59,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:05:59,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:05:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:05:59,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:05:59,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:05:59,869 INFO L87 Difference]: Start difference. First operand 824 states and 918 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:00,938 INFO L93 Difference]: Finished difference Result 1127 states and 1263 transitions. [2024-11-28 05:06:00,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:06:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-28 05:06:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:00,946 INFO L225 Difference]: With dead ends: 1127 [2024-11-28 05:06:00,948 INFO L226 Difference]: Without dead ends: 1127 [2024-11-28 05:06:00,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 05:06:00,950 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 323 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2483 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:00,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2483 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 05:06:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-11-28 05:06:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 911. [2024-11-28 05:06:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 538 states have (on average 1.929368029739777) internal successors, (1038), 905 states have internal predecessors, (1038), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1064 transitions. [2024-11-28 05:06:00,988 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1064 transitions. Word has length 6 [2024-11-28 05:06:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:00,989 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1064 transitions. [2024-11-28 05:06:00,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1064 transitions. [2024-11-28 05:06:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 05:06:00,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:00,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:06:01,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 05:06:01,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:01,190 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr423ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:01,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1290386196, now seen corresponding path program 1 times [2024-11-28 05:06:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:01,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511708501] [2024-11-28 05:06:01,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:01,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:01,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:01,194 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:01,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 05:06:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:01,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 05:06:01,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:01,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-28 05:06:01,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:01,359 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:01,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511708501] [2024-11-28 05:06:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511708501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:01,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:01,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 05:06:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336410768] [2024-11-28 05:06:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:01,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 05:06:01,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:01,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 05:06:01,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 05:06:01,360 INFO L87 Difference]: Start difference. First operand 911 states and 1064 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:02,882 INFO L93 Difference]: Finished difference Result 913 states and 1065 transitions. [2024-11-28 05:06:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 05:06:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 05:06:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:02,887 INFO L225 Difference]: With dead ends: 913 [2024-11-28 05:06:02,887 INFO L226 Difference]: Without dead ends: 905 [2024-11-28 05:06:02,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-28 05:06:02,888 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 1 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:02,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1317 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 05:06:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-28 05:06:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2024-11-28 05:06:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 532 states have (on average 1.9379699248120301) internal successors, (1031), 899 states have internal predecessors, (1031), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1057 transitions. [2024-11-28 05:06:02,915 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1057 transitions. Word has length 11 [2024-11-28 05:06:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:02,915 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1057 transitions. [2024-11-28 05:06:02,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1057 transitions. [2024-11-28 05:06:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:06:02,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:02,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:06:02,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 05:06:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:03,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262039, now seen corresponding path program 1 times [2024-11-28 05:06:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886704055] [2024-11-28 05:06:03,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:03,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:03,126 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:03,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:06:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:03,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:06:03,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:03,308 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-28 05:06:03,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-28 05:06:03,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:03,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886704055] [2024-11-28 05:06:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886704055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873215329] [2024-11-28 05:06:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:03,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:06:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:03,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:06:03,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:06:03,366 INFO L87 Difference]: Start difference. First operand 905 states and 1057 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:05,994 INFO L93 Difference]: Finished difference Result 890 states and 1019 transitions. [2024-11-28 05:06:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:06:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 05:06:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:05,999 INFO L225 Difference]: With dead ends: 890 [2024-11-28 05:06:05,999 INFO L226 Difference]: Without dead ends: 890 [2024-11-28 05:06:06,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:06,000 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 587 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:06,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 967 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 05:06:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-28 05:06:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 882. [2024-11-28 05:06:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 532 states have (on average 1.8515037593984962) internal successors, (985), 876 states have internal predecessors, (985), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1011 transitions. [2024-11-28 05:06:06,026 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1011 transitions. Word has length 12 [2024-11-28 05:06:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1011 transitions. [2024-11-28 05:06:06,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1011 transitions. [2024-11-28 05:06:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 05:06:06,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:06,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 05:06:06,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 05:06:06,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:06,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:06,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1783262040, now seen corresponding path program 1 times [2024-11-28 05:06:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590455058] [2024-11-28 05:06:06,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:06,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:06,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:06,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:06,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 05:06:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:06,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:06:06,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:06,418 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-28 05:06:06,555 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-28 05:06:06,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:06,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590455058] [2024-11-28 05:06:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590455058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 05:06:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404904396] [2024-11-28 05:06:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:06:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:06,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:06:06,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:06:06,560 INFO L87 Difference]: Start difference. First operand 882 states and 1011 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:09,955 INFO L93 Difference]: Finished difference Result 1063 states and 1183 transitions. [2024-11-28 05:06:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:06:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-28 05:06:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:09,959 INFO L225 Difference]: With dead ends: 1063 [2024-11-28 05:06:09,959 INFO L226 Difference]: Without dead ends: 1063 [2024-11-28 05:06:09,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:09,960 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 389 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:09,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1579 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-28 05:06:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-11-28 05:06:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 998. [2024-11-28 05:06:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 648 states have (on average 1.7361111111111112) internal successors, (1125), 992 states have internal predecessors, (1125), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1151 transitions. [2024-11-28 05:06:09,988 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1151 transitions. Word has length 12 [2024-11-28 05:06:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:09,988 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1151 transitions. [2024-11-28 05:06:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 05:06:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1151 transitions. [2024-11-28 05:06:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 05:06:09,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:09,990 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 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-28 05:06:10,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 05:06:10,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:10,195 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:10,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1048779893, now seen corresponding path program 1 times [2024-11-28 05:06:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513950058] [2024-11-28 05:06:10,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:10,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:10,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:10,198 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:10,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 05:06:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:10,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 05:06:10,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:10,453 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-28 05:06:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:10,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 05:06:11,489 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:11,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513950058] [2024-11-28 05:06:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513950058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:06:11,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 05:06:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430140704] [2024-11-28 05:06:11,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:11,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:06:11,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:11,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:06:11,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:06:11,492 INFO L87 Difference]: Start difference. First operand 998 states and 1151 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 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-28 05:06:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:20,502 INFO L93 Difference]: Finished difference Result 1425 states and 1679 transitions. [2024-11-28 05:06:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:06:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-28 05:06:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:20,511 INFO L225 Difference]: With dead ends: 1425 [2024-11-28 05:06:20,511 INFO L226 Difference]: Without dead ends: 1425 [2024-11-28 05:06:20,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-28 05:06:20,514 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 1087 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:20,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2481 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-28 05:06:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-11-28 05:06:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1164. [2024-11-28 05:06:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 814 states have (on average 1.6695331695331694) internal successors, (1359), 1158 states have internal predecessors, (1359), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1385 transitions. [2024-11-28 05:06:20,549 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1385 transitions. Word has length 31 [2024-11-28 05:06:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:20,549 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1385 transitions. [2024-11-28 05:06:20,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 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-28 05:06:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1385 transitions. [2024-11-28 05:06:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 05:06:20,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:20,556 INFO L218 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] [2024-11-28 05:06:20,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 05:06:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:20,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -717313938, now seen corresponding path program 1 times [2024-11-28 05:06:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241095145] [2024-11-28 05:06:20,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:20,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:20,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:20,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:20,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 05:06:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:21,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:06:21,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:21,101 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-28 05:06:21,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:21,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241095145] [2024-11-28 05:06:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241095145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:06:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914412706] [2024-11-28 05:06:21,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:06:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:06:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:06:21,107 INFO L87 Difference]: Start difference. First operand 1164 states and 1385 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-28 05:06:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:21,251 INFO L93 Difference]: Finished difference Result 849 states and 945 transitions. [2024-11-28 05:06:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:06:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-28 05:06:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:21,259 INFO L225 Difference]: With dead ends: 849 [2024-11-28 05:06:21,259 INFO L226 Difference]: Without dead ends: 849 [2024-11-28 05:06:21,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-28 05:06:21,263 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 56 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:21,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2204 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 05:06:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-28 05:06:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 847. [2024-11-28 05:06:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 520 states have (on average 1.7634615384615384) internal successors, (917), 841 states have internal predecessors, (917), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 943 transitions. [2024-11-28 05:06:21,285 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 943 transitions. Word has length 47 [2024-11-28 05:06:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:21,286 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 943 transitions. [2024-11-28 05:06:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-28 05:06:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 943 transitions. [2024-11-28 05:06:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 05:06:21,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:21,291 INFO L218 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] [2024-11-28 05:06:21,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 05:06:21,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:21,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:21,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 489889826, now seen corresponding path program 1 times [2024-11-28 05:06:21,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:21,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665993920] [2024-11-28 05:06:21,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:21,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:21,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:21,499 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:21,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 05:06:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:21,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 05:06:21,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:21,837 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-28 05:06:22,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:06:22,666 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-28 05:06:22,696 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:06:22,696 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-28 05:06:22,706 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-28 05:06:22,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:22,707 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665993920] [2024-11-28 05:06:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665993920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:22,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:22,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:06:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965576626] [2024-11-28 05:06:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:22,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:22,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:22,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:22,709 INFO L87 Difference]: Start difference. First operand 847 states and 943 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-28 05:06:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:25,717 INFO L93 Difference]: Finished difference Result 809 states and 905 transitions. [2024-11-28 05:06:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 05:06:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-28 05:06:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:25,721 INFO L225 Difference]: With dead ends: 809 [2024-11-28 05:06:25,721 INFO L226 Difference]: Without dead ends: 809 [2024-11-28 05:06:25,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 05:06:25,722 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 452 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:25,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 800 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-28 05:06:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-28 05:06:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 772. [2024-11-28 05:06:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 483 states have (on average 1.6666666666666667) internal successors, (805), 766 states have internal predecessors, (805), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 831 transitions. [2024-11-28 05:06:25,741 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 831 transitions. Word has length 55 [2024-11-28 05:06:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:25,741 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 831 transitions. [2024-11-28 05:06:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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-28 05:06:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 831 transitions. [2024-11-28 05:06:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 05:06:25,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:25,743 INFO L218 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-28 05:06:25,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 05:06:25,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:25,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:25,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash 225246615, now seen corresponding path program 1 times [2024-11-28 05:06:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:25,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401010608] [2024-11-28 05:06:25,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:25,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:25,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:25,948 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:25,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 05:06:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:26,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 05:06:26,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:26,254 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-28 05:06:26,276 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-28 05:06:26,316 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-28 05:06:26,333 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-28 05:06:26,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:26,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401010608] [2024-11-28 05:06:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401010608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:26,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:26,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:06:26,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427536607] [2024-11-28 05:06:26,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:26,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:26,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:26,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:26,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:26,336 INFO L87 Difference]: Start difference. First operand 772 states and 831 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-28 05:06:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:28,963 INFO L93 Difference]: Finished difference Result 771 states and 830 transitions. [2024-11-28 05:06:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:06:28,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-28 05:06:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:28,966 INFO L225 Difference]: With dead ends: 771 [2024-11-28 05:06:28,966 INFO L226 Difference]: Without dead ends: 771 [2024-11-28 05:06:28,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-28 05:06:28,967 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 2 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:28,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1906 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 05:06:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-28 05:06:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2024-11-28 05:06:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 483 states have (on average 1.6645962732919255) internal successors, (804), 765 states have internal predecessors, (804), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 830 transitions. [2024-11-28 05:06:28,985 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 830 transitions. Word has length 60 [2024-11-28 05:06:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:28,985 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 830 transitions. [2024-11-28 05:06:28,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-28 05:06:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 830 transitions. [2024-11-28 05:06:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 05:06:28,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:28,986 INFO L218 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-28 05:06:29,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 05:06:29,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:29,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:29,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash 225246616, now seen corresponding path program 1 times [2024-11-28 05:06:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1367199199] [2024-11-28 05:06:29,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:29,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:29,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:29,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:29,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 05:06:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:29,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 05:06:29,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:29,487 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-28 05:06:29,524 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-28 05:06:29,539 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-28 05:06:29,635 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-28 05:06:29,668 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-28 05:06:29,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:29,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367199199] [2024-11-28 05:06:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367199199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:29,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:29,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:06:29,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505009998] [2024-11-28 05:06:29,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:29,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 05:06:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:29,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 05:06:29,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 05:06:29,671 INFO L87 Difference]: Start difference. First operand 771 states and 830 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-28 05:06:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:32,870 INFO L93 Difference]: Finished difference Result 770 states and 829 transitions. [2024-11-28 05:06:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 05:06:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-28 05:06:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:32,873 INFO L225 Difference]: With dead ends: 770 [2024-11-28 05:06:32,873 INFO L226 Difference]: Without dead ends: 770 [2024-11-28 05:06:32,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-28 05:06:32,874 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 1 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:32,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1929 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 05:06:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-28 05:06:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2024-11-28 05:06:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 482 states have (on average 1.66597510373444) internal successors, (803), 764 states have internal predecessors, (803), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-28 05:06:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 829 transitions. [2024-11-28 05:06:32,890 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 829 transitions. Word has length 60 [2024-11-28 05:06:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:32,891 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 829 transitions. [2024-11-28 05:06:32,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-28 05:06:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 829 transitions. [2024-11-28 05:06:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:06:32,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:32,892 INFO L218 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] [2024-11-28 05:06:32,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 05:06:33,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:33,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:33,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash 610113022, now seen corresponding path program 1 times [2024-11-28 05:06:33,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:33,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931370222] [2024-11-28 05:06:33,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:33,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:33,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:33,098 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:33,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 05:06:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:33,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:06:33,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:33,401 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-28 05:06:33,519 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-28 05:06:33,536 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-28 05:06:33,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:33,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:33,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931370222] [2024-11-28 05:06:33,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931370222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:33,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:33,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 05:06:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468092740] [2024-11-28 05:06:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:33,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 05:06:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:33,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 05:06:33,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 05:06:33,539 INFO L87 Difference]: Start difference. First operand 770 states and 829 transitions. Second operand has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-28 05:06:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:37,486 INFO L93 Difference]: Finished difference Result 782 states and 844 transitions. [2024-11-28 05:06:37,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 05:06:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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 68 [2024-11-28 05:06:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:37,489 INFO L225 Difference]: With dead ends: 782 [2024-11-28 05:06:37,489 INFO L226 Difference]: Without dead ends: 782 [2024-11-28 05:06:37,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 05:06:37,490 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 12 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:37,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2926 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-28 05:06:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-28 05:06:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 776. [2024-11-28 05:06:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 487 states have (on average 1.6632443531827514) internal successors, (810), 769 states have internal predecessors, (810), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 5 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-28 05:06:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 839 transitions. [2024-11-28 05:06:37,518 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 839 transitions. Word has length 68 [2024-11-28 05:06:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:37,519 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 839 transitions. [2024-11-28 05:06:37,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 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-28 05:06:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 839 transitions. [2024-11-28 05:06:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-28 05:06:37,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:37,520 INFO L218 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] [2024-11-28 05:06:37,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 05:06:37,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:37,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:37,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 610113023, now seen corresponding path program 1 times [2024-11-28 05:06:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:37,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853544088] [2024-11-28 05:06:37,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:37,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:37,725 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:37,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 05:06:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:38,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 05:06:38,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:38,037 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-28 05:06:38,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 05:06:38,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853544088] [2024-11-28 05:06:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853544088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 05:06:38,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 05:06:38,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 05:06:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370819039] [2024-11-28 05:06:38,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 05:06:38,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 05:06:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:38,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 05:06:38,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 05:06:38,040 INFO L87 Difference]: Start difference. First operand 776 states and 839 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-28 05:06:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:38,097 INFO L93 Difference]: Finished difference Result 773 states and 833 transitions. [2024-11-28 05:06:38,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 05:06:38,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2024-11-28 05:06:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:38,101 INFO L225 Difference]: With dead ends: 773 [2024-11-28 05:06:38,102 INFO L226 Difference]: Without dead ends: 773 [2024-11-28 05:06:38,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-28 05:06:38,107 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 0 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2191 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-28 05:06:38,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2191 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 05:06:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-11-28 05:06:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2024-11-28 05:06:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 484 states have (on average 1.665289256198347) internal successors, (806), 767 states have internal predecessors, (806), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:06:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 833 transitions. [2024-11-28 05:06:38,131 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 833 transitions. Word has length 68 [2024-11-28 05:06:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:38,132 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 833 transitions. [2024-11-28 05:06:38,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-28 05:06:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 833 transitions. [2024-11-28 05:06:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-28 05:06:38,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:38,133 INFO L218 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] [2024-11-28 05:06:38,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 05:06:38,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:38,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:38,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1266022057, now seen corresponding path program 1 times [2024-11-28 05:06:38,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:38,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727894813] [2024-11-28 05:06:38,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:06:38,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:38,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:38,337 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:38,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 05:06:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:06:38,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 05:06:38,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:06:38,678 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-28 05:06:38,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:06:38,795 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-28 05:06:38,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:06:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727894813] [2024-11-28 05:06:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727894813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:06:38,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:06:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-28 05:06:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978265083] [2024-11-28 05:06:38,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:06:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 05:06:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:06:38,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 05:06:38,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-28 05:06:38,797 INFO L87 Difference]: Start difference. First operand 773 states and 833 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-28 05:06:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:06:39,061 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2024-11-28 05:06:39,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:06:39,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 69 [2024-11-28 05:06:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:06:39,066 INFO L225 Difference]: With dead ends: 785 [2024-11-28 05:06:39,066 INFO L226 Difference]: Without dead ends: 785 [2024-11-28 05:06:39,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 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-28 05:06:39,069 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 5 mSDsluCounter, 4367 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5099 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:06:39,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5099 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 05:06:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-28 05:06:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2024-11-28 05:06:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 493 states have (on average 1.6653144016227182) internal successors, (821), 776 states have internal predecessors, (821), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:06:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 848 transitions. [2024-11-28 05:06:39,091 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 848 transitions. Word has length 69 [2024-11-28 05:06:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:06:39,093 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 848 transitions. [2024-11-28 05:06:39,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-28 05:06:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 848 transitions. [2024-11-28 05:06:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-28 05:06:39,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:06:39,094 INFO L218 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] [2024-11-28 05:06:39,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 05:06:39,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:39,295 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:06:39,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:06:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash 93070398, now seen corresponding path program 2 times [2024-11-28 05:06:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:06:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655461284] [2024-11-28 05:06:39,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:06:39,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:06:39,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:06:39,299 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:06:39,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 05:07:01,011 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:07:01,011 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:07:01,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-28 05:07:01,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:01,198 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:07:01,198 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-28 05:07:01,224 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-28 05:07:01,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:01,473 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-28 05:07:01,545 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-28 05:07:01,584 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-28 05:07:01,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:01,751 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 05:07:01,751 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-28 05:07:01,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_849) |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-28 05:07:01,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:07:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655461284] [2024-11-28 05:07:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655461284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2089693091] [2024-11-28 05:07:01,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:07:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:07:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:07:01,776 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:07:01,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-28 05:07:03,299 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:07:03,299 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:07:03,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 05:07:03,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:03,628 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-28 05:07:03,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:04,135 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-28 05:07:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2089693091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:07:04,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:07:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-11-28 05:07:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740722510] [2024-11-28 05:07:04,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:04,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:07:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:07:04,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:07:04,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2024-11-28 05:07:04,138 INFO L87 Difference]: Start difference. First operand 783 states and 848 transitions. Second operand has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 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-28 05:07:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:17,009 INFO L93 Difference]: Finished difference Result 799 states and 870 transitions. [2024-11-28 05:07:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 05:07:17,010 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 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 72 [2024-11-28 05:07:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:17,021 INFO L225 Difference]: With dead ends: 799 [2024-11-28 05:07:17,021 INFO L226 Difference]: Without dead ends: 793 [2024-11-28 05:07:17,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=392, Invalid=2161, Unknown=1, NotChecked=98, Total=2652 [2024-11-28 05:07:17,022 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 495 mSDsluCounter, 6226 mSDsCounter, 0 mSdLazyCounter, 4788 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 6722 SdHoareTripleChecker+Invalid, 4820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:17,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 6722 Invalid, 4820 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 4788 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-28 05:07:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-28 05:07:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2024-11-28 05:07:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 502 states have (on average 1.655378486055777) internal successors, (831), 784 states have internal predecessors, (831), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:07:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 858 transitions. [2024-11-28 05:07:17,040 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 858 transitions. Word has length 72 [2024-11-28 05:07:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:17,041 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 858 transitions. [2024-11-28 05:07:17,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 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-28 05:07:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 858 transitions. [2024-11-28 05:07:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-28 05:07:17,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:17,042 INFO L218 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] [2024-11-28 05:07:17,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 05:07:17,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-28 05:07:17,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:07:17,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:07:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 785046943, now seen corresponding path program 1 times [2024-11-28 05:07:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:07:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154038516] [2024-11-28 05:07:17,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:07:17,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:17,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:17,447 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:17,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 05:07:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:07:17,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 05:07:17,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:18,036 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-28 05:07:18,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:19,018 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-28 05:07:19,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:07:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154038516] [2024-11-28 05:07:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154038516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:07:19,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:07:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-28 05:07:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964451515] [2024-11-28 05:07:19,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:07:19,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 05:07:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:07:19,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 05:07:19,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-28 05:07:19,021 INFO L87 Difference]: Start difference. First operand 791 states and 858 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-28 05:07:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:07:21,689 INFO L93 Difference]: Finished difference Result 815 states and 897 transitions. [2024-11-28 05:07:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 05:07:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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 78 [2024-11-28 05:07:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:07:21,693 INFO L225 Difference]: With dead ends: 815 [2024-11-28 05:07:21,693 INFO L226 Difference]: Without dead ends: 809 [2024-11-28 05:07:21,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 05:07:21,695 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 18 mSDsluCounter, 8746 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 9478 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:07:21,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 9478 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 05:07:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-28 05:07:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2024-11-28 05:07:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 520 states have (on average 1.6423076923076922) internal successors, (854), 802 states have internal predecessors, (854), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:07:21,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 881 transitions. [2024-11-28 05:07:21,714 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 881 transitions. Word has length 78 [2024-11-28 05:07:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:07:21,714 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 881 transitions. [2024-11-28 05:07:21,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-28 05:07:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 881 transitions. [2024-11-28 05:07:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-28 05:07:21,715 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:07:21,716 INFO L218 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] [2024-11-28 05:07:21,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-28 05:07:21,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:21,917 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:07:21,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:07:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2050705313, now seen corresponding path program 2 times [2024-11-28 05:07:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:07:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370393614] [2024-11-28 05:07:21,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:07:21,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:07:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:07:21,920 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:07:21,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 05:07:50,402 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:07:50,402 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:07:50,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 05:07:50,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:50,584 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:07:50,585 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-28 05:07:50,596 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-28 05:07:50,631 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-28 05:07:50,648 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-28 05:07:50,793 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-28 05:07:50,801 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-28 05:07:51,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:07:51,512 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-28 05:07:51,530 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-28 05:07:51,597 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-28 05:07:51,606 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-28 05:07:51,655 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-28 05:07:51,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:07:52,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:07:52,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:07:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370393614] [2024-11-28 05:07:52,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370393614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:07:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1205979856] [2024-11-28 05:07:52,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 05:07:52,418 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:07:52,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:07:52,421 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:07:52,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-28 05:07:54,054 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:07:54,054 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:07:54,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-28 05:07:54,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:07:55,871 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-28 05:07:55,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:00,020 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-28 05:08:00,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1205979856] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:08:00,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:08:00,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 26, 26] total 58 [2024-11-28 05:08:00,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347506877] [2024-11-28 05:08:00,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:00,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-28 05:08:00,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:08:00,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-28 05:08:00,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2024-11-28 05:08:00,024 INFO L87 Difference]: Start difference. First operand 809 states and 881 transitions. Second operand has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 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-28 05:08:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:08:44,919 INFO L93 Difference]: Finished difference Result 856 states and 958 transitions. [2024-11-28 05:08:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-28 05:08:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 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 90 [2024-11-28 05:08:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:08:44,922 INFO L225 Difference]: With dead ends: 856 [2024-11-28 05:08:44,923 INFO L226 Difference]: Without dead ends: 844 [2024-11-28 05:08:44,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=3205, Invalid=15430, Unknown=1, NotChecked=270, Total=18906 [2024-11-28 05:08:44,927 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 508 mSDsluCounter, 13485 mSDsCounter, 0 mSdLazyCounter, 10589 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 13987 SdHoareTripleChecker+Invalid, 10618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2024-11-28 05:08:44,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 13987 Invalid, 10618 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 10589 Invalid, 0 Unknown, 0 Unchecked, 30.7s Time] [2024-11-28 05:08:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-28 05:08:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2024-11-28 05:08:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 556 states have (on average 1.6133093525179856) internal successors, (897), 837 states have internal predecessors, (897), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:08:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 924 transitions. [2024-11-28 05:08:44,952 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 924 transitions. Word has length 90 [2024-11-28 05:08:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:08:44,953 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 924 transitions. [2024-11-28 05:08:44,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.017543859649123) internal successors, (172), 58 states have internal predecessors, (172), 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-28 05:08:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 924 transitions. [2024-11-28 05:08:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 05:08:44,955 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:08:44,955 INFO L218 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] [2024-11-28 05:08:44,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 05:08:45,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-28 05:08:45,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:08:45,356 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:08:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:08:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2037270199, now seen corresponding path program 1 times [2024-11-28 05:08:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:08:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866972450] [2024-11-28 05:08:45,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:08:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:08:45,359 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:08:45,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 05:08:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:45,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-28 05:08:45,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:45,983 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-28 05:08:46,137 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:08:46,137 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-28 05:08:46,165 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-28 05:08:46,896 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:46,897 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-28 05:08:47,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:47,029 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-28 05:08:47,050 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-28 05:08:47,078 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-28 05:08:47,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:47,227 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2050) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:08:47,801 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-28 05:08:47,801 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-28 05:08:47,811 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2050 (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$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2096))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem32#1.base|)) is different from false [2024-11-28 05:08:47,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:08:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866972450] [2024-11-28 05:08:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866972450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1884375327] [2024-11-28 05:08:47,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:08:47,814 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:08:47,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:08:47,816 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:08:47,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-28 05:08:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:08:51,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:08:51,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:08:51,537 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:08:51,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-28 05:08:52,067 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:08:52,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-28 05:08:52,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-28 05:08:52,530 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 34 treesize of output 16 [2024-11-28 05:08:54,643 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:54,644 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 54 treesize of output 51 [2024-11-28 05:08:54,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:08:54,984 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 54 treesize of output 51 [2024-11-28 05:08:55,044 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 43 treesize of output 19 [2024-11-28 05:08:55,131 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-28 05:08:55,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:08:55,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2548 (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$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_2548))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2050)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:08:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1884375327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:08:55,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:08:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 20 [2024-11-28 05:08:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805009211] [2024-11-28 05:08:55,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:08:55,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 05:08:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:08:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 05:08:55,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=414, Unknown=11, NotChecked=132, Total=650 [2024-11-28 05:08:55,816 INFO L87 Difference]: Start difference. First operand 844 states and 924 transitions. Second operand has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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-28 05:09:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:09,080 INFO L93 Difference]: Finished difference Result 1544 states and 1694 transitions. [2024-11-28 05:09:09,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 05:09:09,081 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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 115 [2024-11-28 05:09:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:09,086 INFO L225 Difference]: With dead ends: 1544 [2024-11-28 05:09:09,086 INFO L226 Difference]: Without dead ends: 1544 [2024-11-28 05:09:09,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=202, Invalid=1056, Unknown=14, NotChecked=210, Total=1482 [2024-11-28 05:09:09,087 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1005 mSDsluCounter, 4560 mSDsCounter, 0 mSdLazyCounter, 5028 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 5078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:09,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 4952 Invalid, 5078 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 5028 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2024-11-28 05:09:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-28 05:09:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 843. [2024-11-28 05:09:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 556 states have (on average 1.6115107913669064) internal successors, (896), 836 states have internal predecessors, (896), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:09:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 923 transitions. [2024-11-28 05:09:09,111 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 923 transitions. Word has length 115 [2024-11-28 05:09:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 923 transitions. [2024-11-28 05:09:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.888888888888889) internal successors, (142), 20 states have internal predecessors, (142), 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-28 05:09:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 923 transitions. [2024-11-28 05:09:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-28 05:09:09,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:09,113 INFO L218 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] [2024-11-28 05:09:09,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2024-11-28 05:09:09,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 05:09:09,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:09,514 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:09:09,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2037270198, now seen corresponding path program 1 times [2024-11-28 05:09:09,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:09:09,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245728621] [2024-11-28 05:09:09,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:09,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:09,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:09,517 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:09,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 05:09:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:10,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-28 05:09:10,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:10,168 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-28 05:09:10,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 05:09:10,383 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:09:10,383 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-28 05:09:10,415 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-28 05:09:10,426 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-28 05:09:10,576 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-28 05:09:10,585 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-28 05:09:11,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:11,659 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-28 05:09:11,679 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-28 05:09:11,808 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:11,808 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-28 05:09:11,819 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-28 05:09:11,867 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-28 05:09:11,879 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-28 05:09:11,923 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-28 05:09:11,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:12,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-28 05:09:12,157 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_3001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 05:09:14,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3092) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3000 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3093))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3092) .cse2 v_ArrVal_3000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_3001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 05:09:14,028 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:09:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245728621] [2024-11-28 05:09:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245728621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [185121357] [2024-11-28 05:09:14,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:14,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:09:14,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:09:14,031 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:09:14,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-28 05:09:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:17,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-28 05:09:17,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:17,925 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-28 05:09:18,115 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:09:18,116 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-28 05:09:18,126 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-28 05:09:18,152 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-28 05:09:18,166 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-28 05:09:18,261 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-28 05:09:18,270 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-28 05:09:19,303 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:19,304 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-28 05:09:19,316 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-28 05:09:19,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:19,411 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-28 05:09:19,422 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-28 05:09:19,456 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-28 05:09:19,465 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-28 05:09:19,466 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-28 05:09:19,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:19,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3545) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-28 05:09:19,571 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3545) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2024-11-28 05:09:21,319 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3638))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3637) .cse0 v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3545) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3546 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3637) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_3638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-28 05:09:21,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [185121357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:21,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:09:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-28 05:09:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403286799] [2024-11-28 05:09:21,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:09:21,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 05:09:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:09:21,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 05:09:21,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2024-11-28 05:09:21,329 INFO L87 Difference]: Start difference. First operand 843 states and 923 transitions. Second operand has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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-28 05:09:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:28,785 INFO L93 Difference]: Finished difference Result 842 states and 922 transitions. [2024-11-28 05:09:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 05:09:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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 115 [2024-11-28 05:09:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:28,791 INFO L225 Difference]: With dead ends: 842 [2024-11-28 05:09:28,791 INFO L226 Difference]: Without dead ends: 842 [2024-11-28 05:09:28,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2024-11-28 05:09:28,792 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 414 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:28,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2118 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-28 05:09:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-28 05:09:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2024-11-28 05:09:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 556 states have (on average 1.6097122302158273) internal successors, (895), 835 states have internal predecessors, (895), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:09:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 922 transitions. [2024-11-28 05:09:28,820 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 922 transitions. Word has length 115 [2024-11-28 05:09:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:28,821 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 922 transitions. [2024-11-28 05:09:28,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.875) internal successors, (71), 10 states have internal predecessors, (71), 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-28 05:09:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 922 transitions. [2024-11-28 05:09:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 05:09:28,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:28,823 INFO L218 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] [2024-11-28 05:09:28,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-28 05:09:29,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-28 05:09:29,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:29,224 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:09:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -133341691, now seen corresponding path program 1 times [2024-11-28 05:09:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:09:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845858612] [2024-11-28 05:09:29,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:29,227 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:29,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-28 05:09:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:29,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-28 05:09:29,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:30,105 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:09:30,105 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-28 05:09:30,132 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-28 05:09:30,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:30,857 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-28 05:09:30,981 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:30,982 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-28 05:09:31,081 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:31,081 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-28 05:09:31,101 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-28 05:09:31,131 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-28 05:09:31,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:31,196 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4058) |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-28 05:09:31,207 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:09:31,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4057 (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$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4057))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4058)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:09:31,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4057 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4057))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4058)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:09:31,811 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2024-11-28 05:09:31,811 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-28 05:09:31,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4104 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem32#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$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4104))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4057)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4058)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-28 05:09:31,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:09:31,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845858612] [2024-11-28 05:09:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845858612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:31,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1856792905] [2024-11-28 05:09:31,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:31,833 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:09:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:09:31,838 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:09:31,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-28 05:09:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:09:45,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-28 05:09:45,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:09:45,263 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:09:45,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-28 05:09:45,723 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:09:45,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-28 05:09:45,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-28 05:09:46,087 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 34 treesize of output 16 [2024-11-28 05:09:47,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:47,816 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 54 treesize of output 51 [2024-11-28 05:09:48,073 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:48,074 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 54 treesize of output 51 [2024-11-28 05:09:48,280 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:09:48,281 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 54 treesize of output 51 [2024-11-28 05:09:48,332 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 43 treesize of output 19 [2024-11-28 05:09:48,427 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-28 05:09:48,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:09:48,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4526) |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-28 05:09:48,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:09:48,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4525 (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$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4525))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4526)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:09:48,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4525 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4525))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4526)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:09:48,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4572 (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$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_4572))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4525)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4526)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:09:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1856792905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:09:49,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:09:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22 [2024-11-28 05:09:49,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166570334] [2024-11-28 05:09:49,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:09:49,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 05:09:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:09:49,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 05:09:49,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=464, Unknown=10, NotChecked=530, Total=1122 [2024-11-28 05:09:49,006 INFO L87 Difference]: Start difference. First operand 842 states and 922 transitions. Second operand has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 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-28 05:09:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:09:59,237 INFO L93 Difference]: Finished difference Result 1540 states and 1690 transitions. [2024-11-28 05:09:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 05:09:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 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 118 [2024-11-28 05:09:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:09:59,241 INFO L225 Difference]: With dead ends: 1540 [2024-11-28 05:09:59,241 INFO L226 Difference]: Without dead ends: 1540 [2024-11-28 05:09:59,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=238, Invalid=1198, Unknown=10, NotChecked=810, Total=2256 [2024-11-28 05:09:59,242 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1698 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-28 05:09:59,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 3690 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-11-28 05:09:59,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-28 05:09:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 841. [2024-11-28 05:09:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 556 states have (on average 1.6079136690647482) internal successors, (894), 834 states have internal predecessors, (894), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:09:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 921 transitions. [2024-11-28 05:09:59,262 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 921 transitions. Word has length 118 [2024-11-28 05:09:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:09:59,263 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 921 transitions. [2024-11-28 05:09:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.4) internal successors, (148), 22 states have internal predecessors, (148), 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-28 05:09:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 921 transitions. [2024-11-28 05:09:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-28 05:09:59,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:09:59,265 INFO L218 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] [2024-11-28 05:09:59,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2024-11-28 05:09:59,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-28 05:09:59,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:59,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:09:59,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:09:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash -133341690, now seen corresponding path program 1 times [2024-11-28 05:09:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:09:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822852368] [2024-11-28 05:09:59,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:09:59,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:09:59,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:09:59,670 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:09:59,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-28 05:10:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:10:00,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-28 05:10:00,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:10:00,466 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-28 05:10:00,621 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:10:00,621 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-28 05:10:00,627 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-28 05:10:00,653 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-28 05:10:00,664 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-28 05:10:00,776 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-28 05:10:00,782 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-28 05:10:01,595 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:01,596 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-28 05:10:01,606 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-28 05:10:01,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:01,730 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-28 05:10:01,740 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-28 05:10:01,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:01,849 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-28 05:10:01,859 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-28 05:10:01,887 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-28 05:10:01,895 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-28 05:10:01,929 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-28 05:10:01,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:10:02,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-28 05:10:02,121 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 05:10:02,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5039))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5040) .cse0 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5040) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-28 05:10:04,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5133))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5134) .cse1 v_ArrVal_5040) (select (select (store .cse2 .cse1 v_ArrVal_5039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_5041))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_5040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5133))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_5039))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5134) .cse4 v_ArrVal_5040) .cse5 v_ArrVal_5041) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5042) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 05:10:04,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:10:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822852368] [2024-11-28 05:10:04,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822852368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:10:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1273360921] [2024-11-28 05:10:04,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:10:04,524 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:10:04,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:10:04,526 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:10:04,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-28 05:10:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:10:19,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-28 05:10:19,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:10:19,631 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-28 05:10:19,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 5 [2024-11-28 05:10:19,802 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:10:19,802 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-28 05:10:19,818 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-28 05:10:19,824 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-28 05:10:19,911 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-28 05:10:19,917 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-28 05:10:20,889 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:20,890 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-28 05:10:20,908 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-28 05:10:21,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:21,015 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-28 05:10:21,025 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-28 05:10:21,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:21,097 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-28 05:10:21,108 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-28 05:10:21,140 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-28 05:10:21,148 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-28 05:10:21,154 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-28 05:10:21,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:10:21,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-28 05:10:21,250 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-28 05:10:21,343 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5601))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5602) .cse0 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5602) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5601) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-28 05:10:21,434 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5602) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5601) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5601))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5602) .cse3 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-28 05:10:23,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5696))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_5601))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5695) .cse0 v_ArrVal_5602) .cse1 v_ArrVal_5604) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5603) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_5601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5602 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5604 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5696))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_5695) .cse6 v_ArrVal_5602) (select (select (store .cse7 .cse6 v_ArrVal_5601) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_5604))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-28 05:10:23,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1273360921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:10:23,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:10:23,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-28 05:10:23,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552624076] [2024-11-28 05:10:23,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:10:23,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 05:10:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:10:23,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 05:10:23,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=146, Unknown=16, NotChecked=288, Total=506 [2024-11-28 05:10:23,334 INFO L87 Difference]: Start difference. First operand 841 states and 921 transitions. Second operand has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 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-28 05:10:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:10:31,096 INFO L93 Difference]: Finished difference Result 840 states and 920 transitions. [2024-11-28 05:10:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 05:10:31,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 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 118 [2024-11-28 05:10:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:10:31,101 INFO L225 Difference]: With dead ends: 840 [2024-11-28 05:10:31,101 INFO L226 Difference]: Without dead ends: 840 [2024-11-28 05:10:31,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=300, Unknown=17, NotChecked=396, Total=812 [2024-11-28 05:10:31,104 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 412 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2526 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-28 05:10:31,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 2121 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2526 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-28 05:10:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-28 05:10:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2024-11-28 05:10:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 556 states have (on average 1.606115107913669) internal successors, (893), 833 states have internal predecessors, (893), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:10:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 920 transitions. [2024-11-28 05:10:31,120 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 920 transitions. Word has length 118 [2024-11-28 05:10:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:10:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 920 transitions. [2024-11-28 05:10:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.222222222222221) internal successors, (74), 11 states have internal predecessors, (74), 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-28 05:10:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 920 transitions. [2024-11-28 05:10:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 05:10:31,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:10:31,123 INFO L218 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] [2024-11-28 05:10:31,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-28 05:10:31,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-28 05:10:31,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:10:31,524 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:10:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:10:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 462736112, now seen corresponding path program 1 times [2024-11-28 05:10:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:10:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733757446] [2024-11-28 05:10:31,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:10:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:10:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:10:31,528 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:10:31,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-28 05:10:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:10:32,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 05:10:32,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:10:32,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-28 05:10:32,514 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:10:32,514 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-28 05:10:32,532 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-28 05:10:32,890 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:32,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 05:10:32,954 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:32,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 05:10:33,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:33,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 05:10:33,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:33,097 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-28 05:10:33,162 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-28 05:10:33,204 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-28 05:10:33,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:10:33,284 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 05:10:33,285 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-28 05:10:33,292 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6133) |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-28 05:10:33,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-28 05:10:33,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6132)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-28 05:10:33,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:10:33,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6131))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 05:10:33,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6131))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:10:33,859 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6179))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6131)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6132)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6133) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 05:10:33,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:10:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733757446] [2024-11-28 05:10:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733757446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:10:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60552891] [2024-11-28 05:10:33,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:10:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:10:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:10:33,864 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:10:33,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-28 05:10:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:10:53,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 05:10:53,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:10:53,559 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:10:53,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-28 05:10:53,966 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:10:53,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-28 05:10:54,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-28 05:10:54,363 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 34 treesize of output 16 [2024-11-28 05:10:56,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:56,425 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 54 treesize of output 51 [2024-11-28 05:10:56,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:56,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 54 treesize of output 51 [2024-11-28 05:10:56,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:56,919 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 54 treesize of output 51 [2024-11-28 05:10:57,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:10:57,123 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 54 treesize of output 51 [2024-11-28 05:10:57,177 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 43 treesize of output 19 [2024-11-28 05:10:57,278 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-28 05:10:57,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:10:57,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6617) |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-28 05:10:57,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:10:57,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6616))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:10:57,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 05:10:57,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (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$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6615))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:10:57,410 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6615))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-28 05:10:57,947 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6663 (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$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_6663))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6615)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6616)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:10:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [60552891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:10:57,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:10:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2024-11-28 05:10:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482673795] [2024-11-28 05:10:57,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:10:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 05:10:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:10:57,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 05:10:57,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=508, Unknown=14, NotChecked=826, Total=1482 [2024-11-28 05:10:57,954 INFO L87 Difference]: Start difference. First operand 840 states and 920 transitions. Second operand has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 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-28 05:11:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:11:13,529 INFO L93 Difference]: Finished difference Result 1536 states and 1686 transitions. [2024-11-28 05:11:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 05:11:13,529 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 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 121 [2024-11-28 05:11:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:11:13,532 INFO L225 Difference]: With dead ends: 1536 [2024-11-28 05:11:13,532 INFO L226 Difference]: Without dead ends: 1536 [2024-11-28 05:11:13,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=230, Invalid=1072, Unknown=14, NotChecked=1134, Total=2450 [2024-11-28 05:11:13,533 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1336 mSDsluCounter, 5109 mSDsCounter, 0 mSdLazyCounter, 5536 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 5600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 5536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:11:13,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 5500 Invalid, 5600 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 5536 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2024-11-28 05:11:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-28 05:11:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 839. [2024-11-28 05:11:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 556 states have (on average 1.60431654676259) internal successors, (892), 832 states have internal predecessors, (892), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:11:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 919 transitions. [2024-11-28 05:11:13,548 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 919 transitions. Word has length 121 [2024-11-28 05:11:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:11:13,549 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 919 transitions. [2024-11-28 05:11:13,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.333333333333333) internal successors, (154), 24 states have internal predecessors, (154), 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-28 05:11:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 919 transitions. [2024-11-28 05:11:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-28 05:11:13,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:11:13,551 INFO L218 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] [2024-11-28 05:11:13,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-28 05:11:13,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2024-11-28 05:11:13,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:11:13,952 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:11:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:11:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 462736113, now seen corresponding path program 1 times [2024-11-28 05:11:13,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:11:13,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34576419] [2024-11-28 05:11:13,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:13,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:11:13,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:11:13,955 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:11:13,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-28 05:11:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:14,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-28 05:11:14,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:11:15,087 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:11:15,087 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-28 05:11:15,100 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-28 05:11:15,144 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-28 05:11:15,151 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-28 05:11:15,315 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-28 05:11:15,321 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-28 05:11:16,254 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:16,255 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-28 05:11:16,266 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-28 05:11:16,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:16,413 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-28 05:11:16,425 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-28 05:11:16,580 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:16,580 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-28 05:11:16,591 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-28 05:11:16,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:16,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-28 05:11:16,736 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-28 05:11:16,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-28 05:11:16,781 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-28 05:11:16,822 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-28 05:11:16,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:11:17,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:11:17,051 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-28 05:11:17,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7146))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7147) .cse0 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7147) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-28 05:11:17,159 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7146))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7147) .cse1 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7147) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2024-11-28 05:11:17,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7145))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7146))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7144) .cse0 v_ArrVal_7147) .cse1 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7145))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7144) .cse6 v_ArrVal_7147) (select (select (store .cse7 .cse6 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7148))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-28 05:11:17,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7145))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7144) .cse2 v_ArrVal_7147) (select (select (store .cse3 .cse2 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7148))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7145))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_7146))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7144) .cse5 v_ArrVal_7147) .cse6 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-28 05:11:23,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7240))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7145))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7241) .cse1 v_ArrVal_7144) .cse2 v_ArrVal_7147) (select (select (store .cse3 .cse2 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7148))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7147 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7240))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_7145))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_7146))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7241) .cse6 v_ArrVal_7144) .cse7 v_ArrVal_7147) .cse8 v_ArrVal_7148) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_7149) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-28 05:11:23,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:11:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34576419] [2024-11-28 05:11:23,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34576419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:11:23,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1283682041] [2024-11-28 05:11:23,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:11:23,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:11:23,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:11:23,475 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:11:23,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-28 05:11:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:11:45,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-28 05:11:45,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:11:45,287 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-28 05:11:47,399 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:11:47,399 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-28 05:11:47,475 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-28 05:11:47,591 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-28 05:11:47,670 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-28 05:11:48,299 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-28 05:11:48,340 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-28 05:11:55,768 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:55,768 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-28 05:11:55,843 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-28 05:11:56,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:56,563 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-28 05:11:56,640 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-28 05:11:57,230 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:57,231 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-28 05:11:57,316 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-28 05:11:57,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:11:57,888 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-28 05:11:57,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-28 05:11:58,221 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-28 05:11:58,295 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-28 05:11:58,296 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-28 05:11:58,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:11:58,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:11:58,806 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-28 05:11:59,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7725) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7726))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7725) .cse2 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-28 05:11:59,166 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7726))) (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$#1.offset| .cse0 v_ArrVal_7725) .cse1 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7725) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-28 05:11:59,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7723))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7724) .cse1 v_ArrVal_7725) (select (select (store .cse2 .cse1 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7728))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7723))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7726))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7724) .cse4 v_ArrVal_7725) .cse5 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-28 05:11:59,552 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7723))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7726))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7724) .cse1 v_ArrVal_7725) .cse2 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7723))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7724) .cse7 v_ArrVal_7725) (select (select (store .cse8 .cse7 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7728))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2024-11-28 05:12:05,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7819))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_7723))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_7726))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7820) .cse0 v_ArrVal_7724) .cse1 v_ArrVal_7725) .cse2 v_ArrVal_7728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7727) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_7819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7820 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7819))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_7723))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_7820) .cse8 v_ArrVal_7724) .cse9 v_ArrVal_7725) (select (select (store .cse10 .cse9 v_ArrVal_7726) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7728))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2024-11-28 05:12:05,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1283682041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:12:05,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:12:05,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-28 05:12:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519874620] [2024-11-28 05:12:05,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:12:05,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 05:12:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:12:05,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 05:12:05,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=14, NotChecked=518, Total=756 [2024-11-28 05:12:05,974 INFO L87 Difference]: Start difference. First operand 839 states and 919 transitions. Second operand has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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-28 05:13:04,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:13:04,782 INFO L93 Difference]: Finished difference Result 838 states and 918 transitions. [2024-11-28 05:13:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 05:13:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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 121 [2024-11-28 05:13:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:13:04,785 INFO L225 Difference]: With dead ends: 838 [2024-11-28 05:13:04,785 INFO L226 Difference]: Without dead ends: 838 [2024-11-28 05:13:04,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=14, NotChecked=714, Total=1190 [2024-11-28 05:13:04,786 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 410 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.2s IncrementalHoareTripleChecker+Time [2024-11-28 05:13:04,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2413 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 56.2s Time] [2024-11-28 05:13:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-28 05:13:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-28 05:13:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 556 states have (on average 1.6025179856115108) internal successors, (891), 831 states have internal predecessors, (891), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:13:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 918 transitions. [2024-11-28 05:13:04,801 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 918 transitions. Word has length 121 [2024-11-28 05:13:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:13:04,801 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 918 transitions. [2024-11-28 05:13:04,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.0) internal successors, (80), 12 states have internal predecessors, (80), 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-28 05:13:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 918 transitions. [2024-11-28 05:13:04,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 05:13:04,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:13:04,803 INFO L218 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-28 05:13:04,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2024-11-28 05:13:05,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-28 05:13:05,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:13:05,204 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:13:05,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:13:05,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1575542130, now seen corresponding path program 1 times [2024-11-28 05:13:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:13:05,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753312179] [2024-11-28 05:13:05,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:05,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:13:05,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:13:05,207 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:13:05,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-28 05:13:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:06,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-28 05:13:06,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:13:06,260 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-28 05:13:08,205 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:13:08,206 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-28 05:13:08,411 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-28 05:13:11,966 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:11,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 05:13:12,588 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:12,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 05:13:13,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:13,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 05:13:14,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:14,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-28 05:13:14,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:14,778 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-28 05:13:15,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-28 05:13:16,072 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-28 05:13:16,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-28 05:13:16,105 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-28 05:13:16,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:13:17,248 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-28 05:13:17,249 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-28 05:13:17,307 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem37#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8275) |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-28 05:13:17,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-28 05:13:17,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8274)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-28 05:13:17,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 05:13:17,678 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8273))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:13:17,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 05:13:17,873 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8272))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 05:13:17,956 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8272))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-28 05:13:20,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_8322))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8272)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8273)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8274)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-28 05:13:20,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:13:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753312179] [2024-11-28 05:13:20,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753312179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:13:20,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [126221527] [2024-11-28 05:13:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:13:20,181 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:13:20,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:13:20,183 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:13:20,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-11-28 05:13:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:13:32,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-28 05:13:32,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:13:32,703 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-28 05:13:32,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-28 05:13:37,115 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-28 05:13:37,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-28 05:13:37,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-28 05:13:40,034 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 34 treesize of output 16 [2024-11-28 05:13:54,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:54,326 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 54 treesize of output 51 [2024-11-28 05:13:56,272 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:56,272 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 54 treesize of output 51 [2024-11-28 05:13:57,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:57,754 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 54 treesize of output 51 [2024-11-28 05:13:59,131 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:13:59,132 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 54 treesize of output 51 [2024-11-28 05:14:00,620 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:14:00,621 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 54 treesize of output 51 [2024-11-28 05:14:00,989 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 43 treesize of output 19 [2024-11-28 05:14:02,852 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2024-11-28 05:14:02,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 52 [2024-11-28 05:14:02,986 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-28 05:14:02,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:14:03,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8778) |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-28 05:14:03,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8778) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-28 05:14:03,841 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (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$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8777))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:14:03,922 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-28 05:14:04,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8776 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8776))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:14:04,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8776))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-28 05:14:04,238 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8775 (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$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8775))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8776)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:14:04,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8775 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8775))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8776)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8777)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8778)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:14:07,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [126221527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:14:07,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 05:14:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-11-28 05:14:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295407748] [2024-11-28 05:14:07,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 05:14:07,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 05:14:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 05:14:07,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 05:14:07,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=700, Unknown=17, NotChecked=1190, Total=2070 [2024-11-28 05:14:07,186 INFO L87 Difference]: Start difference. First operand 838 states and 918 transitions. Second operand has 27 states, 24 states have (on average 6.75) internal successors, (162), 26 states have internal predecessors, (162), 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-28 05:15:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 05:15:40,021 INFO L93 Difference]: Finished difference Result 1532 states and 1682 transitions. [2024-11-28 05:15:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 05:15:40,022 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 6.75) internal successors, (162), 26 states have internal predecessors, (162), 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-28 05:15:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 05:15:40,027 INFO L225 Difference]: With dead ends: 1532 [2024-11-28 05:15:40,027 INFO L226 Difference]: Without dead ends: 1532 [2024-11-28 05:15:40,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 235 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=274, Invalid=1417, Unknown=17, NotChecked=1598, Total=3306 [2024-11-28 05:15:40,029 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1663 mSDsluCounter, 4675 mSDsCounter, 0 mSdLazyCounter, 5194 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 5065 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 5194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.9s IncrementalHoareTripleChecker+Time [2024-11-28 05:15:40,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 5065 Invalid, 5276 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [82 Valid, 5194 Invalid, 0 Unknown, 0 Unchecked, 88.9s Time] [2024-11-28 05:15:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-28 05:15:40,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 837. [2024-11-28 05:15:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 556 states have (on average 1.6007194244604317) internal successors, (890), 830 states have internal predecessors, (890), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-28 05:15:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 917 transitions. [2024-11-28 05:15:40,041 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 917 transitions. Word has length 125 [2024-11-28 05:15:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 05:15:40,041 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 917 transitions. [2024-11-28 05:15:40,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 6.75) internal successors, (162), 26 states have internal predecessors, (162), 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-28 05:15:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 917 transitions. [2024-11-28 05:15:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-28 05:15:40,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 05:15:40,042 INFO L218 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-28 05:15:40,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2024-11-28 05:15:40,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2024-11-28 05:15:40,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 05:15:40,443 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-28 05:15:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 05:15:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1575542131, now seen corresponding path program 1 times [2024-11-28 05:15:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 05:15:40,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589292379] [2024-11-28 05:15:40,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:15:40,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 05:15:40,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 05:15:40,446 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 05:15:40,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-28 05:15:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:15:41,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-28 05:15:41,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:15:43,040 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:15:43,040 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-28 05:15:43,105 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-28 05:15:43,402 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-28 05:15:43,473 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-28 05:15:44,429 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-28 05:15:44,463 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-28 05:15:53,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:53,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 75 treesize of output 68 [2024-11-28 05:15:53,248 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-28 05:15:54,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:54,757 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 75 treesize of output 68 [2024-11-28 05:15:54,823 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-28 05:15:56,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:56,006 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 75 treesize of output 68 [2024-11-28 05:15:56,074 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-28 05:15:57,258 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:57,258 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 75 treesize of output 68 [2024-11-28 05:15:57,355 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-28 05:15:58,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:15:58,631 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 75 treesize of output 68 [2024-11-28 05:15:58,697 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-28 05:15:59,061 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 44 treesize of output 20 [2024-11-28 05:15:59,157 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-28 05:15:59,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:15:59,947 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 05:15:59,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-28 05:16:00,128 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-28 05:16:00,128 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-28 05:16:00,565 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-28 05:16:00,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:16:08,886 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-28 05:16:09,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9327))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9328) .cse0 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse2 .cse0 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9328) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false [2024-11-28 05:16:09,553 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9328) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9327))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9328) .cse3 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse4 .cse3 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-28 05:16:10,042 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9325))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9327))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9326) .cse0 v_ArrVal_9328) .cse1 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse3 .cse1 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9325))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9326) .cse6 v_ArrVal_9328) (select (select (store .cse7 .cse6 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9330))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd .cse5 (_ bv4 32)))))))) is different from false [2024-11-28 05:16:10,319 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9325))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9327))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9326) .cse1 v_ArrVal_9328) .cse2 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse4 .cse2 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9325))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9326) .cse7 v_ArrVal_9328) (select (select (store .cse8 .cse7 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9330))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-28 05:16:10,791 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9324))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9325))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9323) .cse1 v_ArrVal_9326) .cse2 v_ArrVal_9328) (select (select (store .cse3 .cse2 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9324))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9325))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9327))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9323) .cse6 v_ArrVal_9326) .cse7 v_ArrVal_9328) .cse8 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse9 .cse8 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false [2024-11-28 05:16:11,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9324))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_9325))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_9327))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9323) .cse1 v_ArrVal_9326) .cse2 v_ArrVal_9328) .cse3 v_ArrVal_9330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse5 .cse3 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9324))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_9325))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9323) .cse9 v_ArrVal_9326) .cse10 v_ArrVal_9328) (select (select (store .cse11 .cse10 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false [2024-11-28 05:16:16,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:16:16,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 795 treesize of output 819 [2024-11-28 05:16:22,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_prenex_33 (_ BitVec 32))) (or (= v_prenex_33 |c_ULTIMATE.start_main_#t~mem32#1.base|) (forall ((v_prenex_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (_ BitVec 32)) (v_prenex_41 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_40))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_prenex_39))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_prenex_37))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_prenex_35))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_prenex_38) .cse0 v_prenex_41) .cse1 v_prenex_36) .cse2 v_prenex_34) .cse3 v_prenex_32) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| v_prenex_33 v_ArrVal_9331) (select (select (store .cse5 .cse3 v_ArrVal_9329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9325 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9422))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_9324))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_9325))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_9423) .cse10 v_ArrVal_9323) .cse11 v_ArrVal_9326) .cse12 v_ArrVal_9328) (select (select (store .cse13 .cse12 v_ArrVal_9327) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9330))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))))) is different from false [2024-11-28 05:16:22,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 05:16:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589292379] [2024-11-28 05:16:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589292379] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 05:16:22,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [494156198] [2024-11-28 05:16:22,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 05:16:22,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 05:16:22,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 05:16:22,704 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 05:16:22,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c62f8254-41be-43af-a262-b5b35a2ce1fc/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-28 05:18:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 05:18:18,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-11-28 05:18:18,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:18:18,819 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-28 05:18:25,317 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 05:18:25,318 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-28 05:18:25,750 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-28 05:18:27,462 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-28 05:18:27,640 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-28 05:18:34,653 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 35 treesize of output 17 [2024-11-28 05:18:34,764 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-28 05:19:15,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:15,239 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 75 treesize of output 68 [2024-11-28 05:19:15,475 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-28 05:19:21,005 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:21,006 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 75 treesize of output 68 [2024-11-28 05:19:21,172 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-28 05:19:24,891 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:24,891 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 75 treesize of output 68 [2024-11-28 05:19:25,062 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-28 05:19:28,814 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:28,815 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 75 treesize of output 68 [2024-11-28 05:19:28,984 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-28 05:19:32,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-28 05:19:32,672 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 75 treesize of output 68 [2024-11-28 05:19:32,838 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-28 05:19:33,704 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 44 treesize of output 20 [2024-11-28 05:19:33,789 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-28 05:19:36,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 05:19:36,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-28 05:19:37,056 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-28 05:19:37,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-28 05:19:37,147 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-28 05:19:37,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:19:40,920 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))))) is different from false [2024-11-28 05:19:41,471 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-28 05:19:42,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9928))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9927) .cse0 v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse2 .cse0 v_ArrVal_9929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2024-11-28 05:19:43,271 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9928))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9927) .cse1 v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse3 .cse1 v_ArrVal_9929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))) (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))))))) is different from false [2024-11-28 05:19:50,695 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9925))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9926) .cse2 v_ArrVal_9927) (select (select (store .cse3 .cse2 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9930))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))) (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9925))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9928))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9926) .cse5 v_ArrVal_9927) .cse6 v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse7 .cse6 v_ArrVal_9929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) is different from false [2024-11-28 05:19:51,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32)) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_9331 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9924))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9925))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9928))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9923) .cse0 v_ArrVal_9926) .cse1 v_ArrVal_9927) .cse2 v_ArrVal_9930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc39#1.base_8| v_ArrVal_9331) (select (select (store .cse4 .cse2 v_ArrVal_9929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc39#1.base_8| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc39#1.base_8|)))) (forall ((v_ArrVal_9928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9923 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9930 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9924))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9925))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9923) .cse8 v_ArrVal_9926) .cse9 v_ArrVal_9927) (select (select (store .cse10 .cse9 v_ArrVal_9928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9930))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd .cse7 (_ bv4 32)))))))) is different from false