./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:55:50,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:55:50,383 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:55:50,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:55:50,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:55:50,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:55:50,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:55:50,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:55:50,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:55:50,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:55:50,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:55:50,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:55:50,428 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:55:50,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:55:50,429 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:55:50,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:55:50,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:55:50,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:55:50,432 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:55:50,432 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:55:50,433 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:55:50,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:55:50,435 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:55:50,436 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:55:50,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:55:50,436 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:55:50,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:55:50,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:55:50,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:55:50,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:50,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:55:50,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:55:50,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:55:50,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:55:50,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:55:50,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:55:50,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:55:50,442 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:55:50,443 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-11-06 21:55:50,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:55:50,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:55:50,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:55:50,799 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:55:50,799 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:55:50,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-06 21:55:54,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:55:54,451 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:55:54,458 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-06 21:55:54,474 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data/c070424fd/3e9c8ab932aa468895b8ed98de3fc282/FLAG3d49b3920 [2023-11-06 21:55:54,490 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data/c070424fd/3e9c8ab932aa468895b8ed98de3fc282 [2023-11-06 21:55:54,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:55:54,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:55:54,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:54,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:55:54,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:55:54,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:54" (1/1) ... [2023-11-06 21:55:54,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7595f8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:54, skipping insertion in model container [2023-11-06 21:55:54,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:54" (1/1) ... [2023-11-06 21:55:54,559 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:55:54,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:55,003 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-06 21:55:55,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e31ce0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:55, skipping insertion in model container [2023-11-06 21:55:55,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:55,005 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-06 21:55:55,008 INFO L158 Benchmark]: Toolchain (without parser) took 511.76ms. Allocated memory is still 157.3MB. Free memory was 110.3MB in the beginning and 98.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:55:55,008 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:55:55,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.71ms. Allocated memory is still 157.3MB. Free memory was 110.3MB in the beginning and 98.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:55:55,012 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory was 92.0MB in the beginning and 91.9MB in the end (delta: 26.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.71ms. Allocated memory is still 157.3MB. Free memory was 110.3MB in the beginning and 98.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:55:57,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:55:58,070 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 21:55:58,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:55:58,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:55:58,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:55:58,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:55:58,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:55:58,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:55:58,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:55:58,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:55:58,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:55:58,151 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:55:58,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:55:58,154 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:55:58,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:55:58,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:55:58,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:55:58,157 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:55:58,158 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:55:58,158 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:55:58,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:55:58,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:55:58,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:55:58,161 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:55:58,162 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:55:58,162 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:55:58,163 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:55:58,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:55:58,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:55:58,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:55:58,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:58,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:55:58,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:55:58,168 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:55:58,168 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:55:58,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:55:58,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:55:58,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:55:58,173 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:55:58,174 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:55:58,174 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2023-11-06 21:55:58,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:55:58,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:55:58,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:55:58,672 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:55:58,673 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:55:58,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-06 21:56:01,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:56:02,295 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:56:02,299 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2023-11-06 21:56:02,322 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data/30011b1ad/25295a97d4374ff3a17a4723e651d7b2/FLAG2d1441c36 [2023-11-06 21:56:02,342 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/data/30011b1ad/25295a97d4374ff3a17a4723e651d7b2 [2023-11-06 21:56:02,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:56:02,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:56:02,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:56:02,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:56:02,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:56:02,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:56:02" (1/1) ... [2023-11-06 21:56:02,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b464ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:02, skipping insertion in model container [2023-11-06 21:56:02,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:56:02" (1/1) ... [2023-11-06 21:56:02,434 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:56:02,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:56:02,948 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 21:56:02,961 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:56:03,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:56:03,061 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:56:03,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:56:03,215 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:56:03,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03 WrapperNode [2023-11-06 21:56:03,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:56:03,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:56:03,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:56:03,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:56:03,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,309 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-06 21:56:03,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:56:03,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:56:03,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:56:03,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:56:03,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:56:03,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:56:03,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:56:03,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:56:03,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (1/1) ... [2023-11-06 21:56:03,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:56:03,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:56:03,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:56:03,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:56:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:56:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:56:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-11-06 21:56:03,511 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-11-06 21:56:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:56:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:56:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:56:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:56:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:56:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:56:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 21:56:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:56:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:56:03,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:56:03,688 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:56:03,690 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:56:04,798 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:56:04,811 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:56:04,812 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 21:56:04,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:56:04 BoogieIcfgContainer [2023-11-06 21:56:04,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:56:04,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:56:04,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:56:04,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:56:04,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:56:02" (1/3) ... [2023-11-06 21:56:04,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a12799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:56:04, skipping insertion in model container [2023-11-06 21:56:04,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:56:03" (2/3) ... [2023-11-06 21:56:04,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a12799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:56:04, skipping insertion in model container [2023-11-06 21:56:04,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:56:04" (3/3) ... [2023-11-06 21:56:04,830 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2023-11-06 21:56:04,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:56:04,855 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-11-06 21:56:04,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:56:04,948 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@642c4377, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:56:04,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-11-06 21:56:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 21:56:04,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:04,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 21:56:04,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:04,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash 4960777, now seen corresponding path program 1 times [2023-11-06 21:56:04,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546071312] [2023-11-06 21:56:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:04,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:05,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:05,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 21:56:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 21:56:05,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:05,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:05,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546071312] [2023-11-06 21:56:05,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546071312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:05,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:05,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:56:05,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82853542] [2023-11-06 21:56:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:05,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:56:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:05,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:56:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:56:05,251 INFO L87 Difference]: Start difference. First operand has 195 states, 99 states have (on average 2.090909090909091) internal successors, (207), 191 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:05,304 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2023-11-06 21:56:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:56:05,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 21:56:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:05,325 INFO L225 Difference]: With dead ends: 195 [2023-11-06 21:56:05,326 INFO L226 Difference]: Without dead ends: 193 [2023-11-06 21:56:05,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:56:05,335 INFO L413 NwaCegarLoop]: 207 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, 207 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 [2023-11-06 21:56:05,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-06 21:56:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-11-06 21:56:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0510204081632653) internal successors, (201), 189 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2023-11-06 21:56:05,432 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 4 [2023-11-06 21:56:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:05,432 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2023-11-06 21:56:05,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2023-11-06 21:56:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 21:56:05,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:05,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 21:56:05,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:05,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:05,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:05,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash 4958341, now seen corresponding path program 1 times [2023-11-06 21:56:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306350768] [2023-11-06 21:56:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:05,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:05,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 21:56:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:05,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:56:05,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:05,844 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 21:56:05,913 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:56:05,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-06 21:56:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:05,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:05,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:05,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306350768] [2023-11-06 21:56:05,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306350768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:05,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:05,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:56:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171923033] [2023-11-06 21:56:05,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:05,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:56:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:56:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:56:05,941 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:06,893 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2023-11-06 21:56:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:56:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 21:56:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:06,898 INFO L225 Difference]: With dead ends: 187 [2023-11-06 21:56:06,898 INFO L226 Difference]: Without dead ends: 187 [2023-11-06 21:56:06,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:06,900 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 83 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:06,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 317 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:56:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-06 21:56:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-11-06 21:56:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 98 states have (on average 1.989795918367347) internal successors, (195), 183 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2023-11-06 21:56:06,931 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 4 [2023-11-06 21:56:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:06,933 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2023-11-06 21:56:06,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2023-11-06 21:56:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 21:56:06,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:06,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 21:56:06,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:07,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:07,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:07,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 4958342, now seen corresponding path program 1 times [2023-11-06 21:56:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252466460] [2023-11-06 21:56:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:07,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:07,174 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:07,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 21:56:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:07,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:56:07,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:07,303 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 21:56:07,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 21:56:07,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:07,391 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:56:07,407 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:56:07,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 21:56:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:07,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:07,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:07,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252466460] [2023-11-06 21:56:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252466460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:56:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138204477] [2023-11-06 21:56:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:07,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:56:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:07,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:56:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:56:07,437 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:08,508 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2023-11-06 21:56:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:56:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-06 21:56:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:08,513 INFO L225 Difference]: With dead ends: 203 [2023-11-06 21:56:08,513 INFO L226 Difference]: Without dead ends: 203 [2023-11-06 21:56:08,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:08,515 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:08,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 361 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:56:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-06 21:56:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2023-11-06 21:56:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 103 states have (on average 1.9611650485436893) internal successors, (202), 188 states have internal predecessors, (202), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2023-11-06 21:56:08,529 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 4 [2023-11-06 21:56:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:08,529 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2023-11-06 21:56:08,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2023-11-06 21:56:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 21:56:08,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:08,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 21:56:08,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-06 21:56:08,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:08,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:08,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 153708682, now seen corresponding path program 1 times [2023-11-06 21:56:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754359728] [2023-11-06 21:56:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:08,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:08,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:08,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 21:56:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:08,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 21:56:08,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:08,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 21:56:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:08,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:08,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:08,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754359728] [2023-11-06 21:56:08,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754359728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:08,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:08,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:56:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765102852] [2023-11-06 21:56:08,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:08,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:56:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:56:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:08,864 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:09,291 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2023-11-06 21:56:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:56:09,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 21:56:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:09,294 INFO L225 Difference]: With dead ends: 190 [2023-11-06 21:56:09,294 INFO L226 Difference]: Without dead ends: 190 [2023-11-06 21:56:09,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:09,296 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:09,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 279 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:56:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-06 21:56:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2023-11-06 21:56:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 103 states have (on average 1.9320388349514563) internal successors, (199), 186 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2023-11-06 21:56:09,309 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 5 [2023-11-06 21:56:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:09,309 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2023-11-06 21:56:09,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2023-11-06 21:56:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 21:56:09,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:09,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 21:56:09,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:09,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:09,525 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:09,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash 153708683, now seen corresponding path program 1 times [2023-11-06 21:56:09,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144363752] [2023-11-06 21:56:09,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:09,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:09,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:09,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:09,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 21:56:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:09,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:56:09,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:09,648 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 21:56:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:09,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:09,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144363752] [2023-11-06 21:56:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144363752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:09,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:09,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:56:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107042564] [2023-11-06 21:56:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:09,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:56:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:56:09,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:09,684 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:10,243 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2023-11-06 21:56:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:56:10,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 21:56:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:10,246 INFO L225 Difference]: With dead ends: 188 [2023-11-06 21:56:10,246 INFO L226 Difference]: Without dead ends: 188 [2023-11-06 21:56:10,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:10,248 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:10,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:56:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-06 21:56:10,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2023-11-06 21:56:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 103 states have (on average 1.9029126213592233) internal successors, (196), 184 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2023-11-06 21:56:10,258 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 5 [2023-11-06 21:56:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:10,258 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2023-11-06 21:56:10,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2023-11-06 21:56:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 21:56:10,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:10,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:10,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:10,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:10,473 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:10,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:10,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1301215081, now seen corresponding path program 1 times [2023-11-06 21:56:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320734396] [2023-11-06 21:56:10,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:10,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:10,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:10,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:10,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 21:56:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:10,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 21:56:10,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:10,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 21:56:10,679 INFO L322 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-06 21:56:10,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-06 21:56:10,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:56:10,790 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:56:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:10,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:10,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320734396] [2023-11-06 21:56:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320734396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:10,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:10,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:56:10,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179594117] [2023-11-06 21:56:10,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:10,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:56:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:10,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:56:10,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:56:10,883 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:11,671 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2023-11-06 21:56:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:11,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 21:56:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:11,674 INFO L225 Difference]: With dead ends: 190 [2023-11-06 21:56:11,674 INFO L226 Difference]: Without dead ends: 190 [2023-11-06 21:56:11,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:11,676 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 6 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:11,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 628 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:56:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-06 21:56:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2023-11-06 21:56:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.8942307692307692) internal successors, (197), 185 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 201 transitions. [2023-11-06 21:56:11,686 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 201 transitions. Word has length 10 [2023-11-06 21:56:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:11,686 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 201 transitions. [2023-11-06 21:56:11,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 201 transitions. [2023-11-06 21:56:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 21:56:11,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:11,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:11,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:11,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:11,888 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:11,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash -635255016, now seen corresponding path program 1 times [2023-11-06 21:56:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:11,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970149721] [2023-11-06 21:56:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:11,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:11,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:11,891 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:11,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 21:56:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:11,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:56:11,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:12,013 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:12,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:12,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970149721] [2023-11-06 21:56:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970149721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:12,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:56:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004347193] [2023-11-06 21:56:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:12,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:56:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:56:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:56:12,017 INFO L87 Difference]: Start difference. First operand 189 states and 201 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:12,066 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2023-11-06 21:56:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:56:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 21:56:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:12,069 INFO L225 Difference]: With dead ends: 269 [2023-11-06 21:56:12,069 INFO L226 Difference]: Without dead ends: 269 [2023-11-06 21:56:12,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:12,070 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 84 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:12,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 569 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:56:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2023-11-06 21:56:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2023-11-06 21:56:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 147 states have (on average 1.91156462585034) internal successors, (281), 228 states have internal predecessors, (281), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2023-11-06 21:56:12,082 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 12 [2023-11-06 21:56:12,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:12,082 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2023-11-06 21:56:12,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2023-11-06 21:56:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 21:56:12,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:12,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:12,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-06 21:56:12,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:12,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:12,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937173, now seen corresponding path program 1 times [2023-11-06 21:56:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:12,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563720002] [2023-11-06 21:56:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:12,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:12,302 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:12,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 21:56:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:12,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:56:12,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:12,431 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:56:12,432 INFO L351 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-06 21:56:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:12,450 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:12,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563720002] [2023-11-06 21:56:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563720002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:12,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:56:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442198649] [2023-11-06 21:56:12,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:12,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:56:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:12,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:56:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:12,453 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:12,982 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2023-11-06 21:56:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:56:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 21:56:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:12,986 INFO L225 Difference]: With dead ends: 220 [2023-11-06 21:56:12,986 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 21:56:12,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:12,987 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 64 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:12,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 208 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:56:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 21:56:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2023-11-06 21:56:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.7074829931972788) internal successors, (251), 213 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 255 transitions. [2023-11-06 21:56:12,994 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 255 transitions. Word has length 13 [2023-11-06 21:56:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:12,995 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 255 transitions. [2023-11-06 21:56:12,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 255 transitions. [2023-11-06 21:56:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 21:56:12,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:12,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:13,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:13,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:13,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:13,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1781937174, now seen corresponding path program 1 times [2023-11-06 21:56:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507621906] [2023-11-06 21:56:13,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:13,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:13,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:13,209 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:13,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 21:56:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:13,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:56:13,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:13,342 INFO L351 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 11 treesize of output 5 [2023-11-06 21:56:13,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 21:56:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:13,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:13,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:13,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507621906] [2023-11-06 21:56:13,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507621906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:13,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:13,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:56:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617381326] [2023-11-06 21:56:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:13,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:56:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:56:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:13,367 INFO L87 Difference]: Start difference. First operand 218 states and 255 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:13,882 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2023-11-06 21:56:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:56:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 21:56:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:13,892 INFO L225 Difference]: With dead ends: 205 [2023-11-06 21:56:13,892 INFO L226 Difference]: Without dead ends: 205 [2023-11-06 21:56:13,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:56:13,893 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:13,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 210 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:56:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-06 21:56:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2023-11-06 21:56:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 147 states have (on average 1.5034013605442176) internal successors, (221), 198 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 225 transitions. [2023-11-06 21:56:13,902 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 225 transitions. Word has length 13 [2023-11-06 21:56:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:13,903 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 225 transitions. [2023-11-06 21:56:13,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2023-11-06 21:56:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 21:56:13,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:13,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:13,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:14,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:14,110 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:14,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961989, now seen corresponding path program 1 times [2023-11-06 21:56:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:14,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279958531] [2023-11-06 21:56:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:14,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:14,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:14,113 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:14,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 21:56:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:14,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:56:14,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:14,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-06 21:56:14,257 INFO L351 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 11 treesize of output 7 [2023-11-06 21:56:14,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:56:14,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:56:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:14,340 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:14,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:14,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279958531] [2023-11-06 21:56:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279958531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:14,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:14,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:56:14,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393481573] [2023-11-06 21:56:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:14,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:56:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:14,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:56:14,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:56:14,343 INFO L87 Difference]: Start difference. First operand 203 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:15,298 INFO L93 Difference]: Finished difference Result 260 states and 295 transitions. [2023-11-06 21:56:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:56:15,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-06 21:56:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:15,302 INFO L225 Difference]: With dead ends: 260 [2023-11-06 21:56:15,302 INFO L226 Difference]: Without dead ends: 260 [2023-11-06 21:56:15,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:56:15,303 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 29 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:15,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 419 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:56:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-06 21:56:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2023-11-06 21:56:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 206 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 237 transitions. [2023-11-06 21:56:15,313 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 237 transitions. Word has length 18 [2023-11-06 21:56:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:15,313 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 237 transitions. [2023-11-06 21:56:15,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 237 transitions. [2023-11-06 21:56:15,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 21:56:15,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:15,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:15,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:15,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:15,534 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:15,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1726961990, now seen corresponding path program 1 times [2023-11-06 21:56:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968535857] [2023-11-06 21:56:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:15,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:15,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 21:56:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:15,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 21:56:15,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:15,665 INFO L351 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 11 treesize of output 5 [2023-11-06 21:56:15,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 21:56:15,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 21:56:15,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:56:15,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-06 21:56:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:15,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:56:15,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968535857] [2023-11-06 21:56:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968535857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:56:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:56:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:56:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563719726] [2023-11-06 21:56:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:15,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:56:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:56:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:56:15,853 INFO L87 Difference]: Start difference. First operand 211 states and 237 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:17,008 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2023-11-06 21:56:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:56:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-06 21:56:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:17,011 INFO L225 Difference]: With dead ends: 213 [2023-11-06 21:56:17,011 INFO L226 Difference]: Without dead ends: 213 [2023-11-06 21:56:17,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:56:17,012 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:17,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 526 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 21:56:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-06 21:56:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2023-11-06 21:56:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.4774193548387098) internal successors, (229), 206 states have internal predecessors, (229), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 233 transitions. [2023-11-06 21:56:17,020 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 233 transitions. Word has length 18 [2023-11-06 21:56:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:17,020 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 233 transitions. [2023-11-06 21:56:17,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 233 transitions. [2023-11-06 21:56:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 21:56:17,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:17,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:17,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-06 21:56:17,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:17,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:17,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431927, now seen corresponding path program 1 times [2023-11-06 21:56:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245958784] [2023-11-06 21:56:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:17,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:17,236 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:17,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-06 21:56:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:17,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 21:56:17,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:17,417 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:56:17,418 INFO L351 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 19 treesize of output 22 [2023-11-06 21:56:17,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:56:17,624 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:17,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-06 21:56:17,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-06 21:56:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:56:17,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:22,039 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:22,040 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-11-06 21:56:22,045 INFO L351 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 32 [2023-11-06 21:56:22,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:56:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:22,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245958784] [2023-11-06 21:56:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245958784] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:22,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-11-06 21:56:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337116850] [2023-11-06 21:56:22,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:22,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:56:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:56:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=77, Unknown=4, NotChecked=0, Total=110 [2023-11-06 21:56:22,125 INFO L87 Difference]: Start difference. First operand 211 states and 233 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:24,041 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2023-11-06 21:56:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:56:24,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-06 21:56:24,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:24,044 INFO L225 Difference]: With dead ends: 216 [2023-11-06 21:56:24,044 INFO L226 Difference]: Without dead ends: 216 [2023-11-06 21:56:24,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=36, Invalid=92, Unknown=4, NotChecked=0, Total=132 [2023-11-06 21:56:24,045 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:24,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 639 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 21:56:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-06 21:56:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2023-11-06 21:56:24,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 155 states have (on average 1.4645161290322581) internal successors, (227), 205 states have internal predecessors, (227), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2023-11-06 21:56:24,055 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 24 [2023-11-06 21:56:24,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:24,075 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2023-11-06 21:56:24,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:24,075 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2023-11-06 21:56:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 21:56:24,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:24,077 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:24,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:24,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:24,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:24,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1836431926, now seen corresponding path program 1 times [2023-11-06 21:56:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161126026] [2023-11-06 21:56:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:24,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:24,294 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:24,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-06 21:56:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:24,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 21:56:24,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:24,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 21:56:24,510 INFO L351 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 11 treesize of output 5 [2023-11-06 21:56:24,550 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:56:24,565 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 21:56:24,842 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:24,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:24,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:25,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-06 21:56:25,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-06 21:56:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:25,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:25,621 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_215) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_214) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_215) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-06 21:56:25,718 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_215) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_215) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_214) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-06 21:56:25,806 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_215) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_215 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_215) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_214) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-11-06 21:56:25,833 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:25,834 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-06 21:56:25,839 INFO L351 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 54 treesize of output 36 [2023-11-06 21:56:25,879 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:25,880 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-06 21:56:25,902 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:25,902 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-11-06 21:56:25,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:25,916 INFO L351 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 33 treesize of output 21 [2023-11-06 21:56:25,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:25,927 INFO L351 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 24 treesize of output 12 [2023-11-06 21:56:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 21:56:26,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161126026] [2023-11-06 21:56:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161126026] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:26,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-11-06 21:56:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610325441] [2023-11-06 21:56:26,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:26,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 21:56:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 21:56:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-11-06 21:56:26,045 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:30,197 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2023-11-06 21:56:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:56:30,199 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-06 21:56:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:30,203 INFO L225 Difference]: With dead ends: 224 [2023-11-06 21:56:30,203 INFO L226 Difference]: Without dead ends: 224 [2023-11-06 21:56:30,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2023-11-06 21:56:30,205 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 5 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:30,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1151 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 611 Invalid, 0 Unknown, 253 Unchecked, 3.7s Time] [2023-11-06 21:56:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-11-06 21:56:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2023-11-06 21:56:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 217 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2023-11-06 21:56:30,215 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 24 [2023-11-06 21:56:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:30,216 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2023-11-06 21:56:30,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2023-11-06 21:56:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 21:56:30,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:30,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:30,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:30,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:30,433 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:30,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1476739250, now seen corresponding path program 2 times [2023-11-06 21:56:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:30,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159873960] [2023-11-06 21:56:30,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:56:30,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:30,436 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:30,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-06 21:56:30,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:56:30,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:56:30,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 21:56:30,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:30,751 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 21:56:30,764 INFO L351 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 11 treesize of output 5 [2023-11-06 21:56:30,799 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:56:30,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 21:56:31,068 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:31,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:31,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:31,357 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:31,357 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:31,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:31,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-06 21:56:31,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-06 21:56:31,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:31,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:32,033 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_275) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_275) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_276) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-06 21:56:32,121 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_275) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_276) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_275) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-11-06 21:56:32,213 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_275) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_275) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_276) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-06 21:56:32,522 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_274) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_273) c_create_data_~data~0.base) .cse2) v_ArrVal_275) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_273))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_274) .cse3 v_ArrVal_275) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_276) c_create_data_~data~0.base) .cse2)))))))) is different from false [2023-11-06 21:56:32,936 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_274) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_273) c_create_data_~data~0.base) .cse3) v_ArrVal_275) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_273))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_274) .cse4 v_ArrVal_275) c_create_data_~data~0.base) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_276) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-06 21:56:33,038 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_274) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_273) c_create_data_~data~0.base) .cse2) v_ArrVal_275) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_273))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_274) .cse3 v_ArrVal_275) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_276) c_create_data_~data~0.base) .cse2))))))))) is different from false [2023-11-06 21:56:33,070 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:33,070 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2023-11-06 21:56:33,088 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:33,089 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2023-11-06 21:56:33,099 INFO L351 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 102 treesize of output 84 [2023-11-06 21:56:33,107 INFO L351 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 286 treesize of output 244 [2023-11-06 21:56:33,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2023-11-06 21:56:33,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 21:56:33,161 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-06 21:56:33,206 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:33,207 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-06 21:56:33,242 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:33,243 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-11-06 21:56:33,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:33,258 INFO L351 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 92 treesize of output 56 [2023-11-06 21:56:33,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:33,271 INFO L351 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 24 treesize of output 12 [2023-11-06 21:56:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-11-06 21:56:33,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:33,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159873960] [2023-11-06 21:56:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159873960] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:33,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-11-06 21:56:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175828484] [2023-11-06 21:56:33,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:33,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:56:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:56:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2023-11-06 21:56:33,414 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:38,419 INFO L93 Difference]: Finished difference Result 236 states and 257 transitions. [2023-11-06 21:56:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 21:56:38,420 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-06 21:56:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:38,422 INFO L225 Difference]: With dead ends: 236 [2023-11-06 21:56:38,422 INFO L226 Difference]: Without dead ends: 236 [2023-11-06 21:56:38,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2023-11-06 21:56:38,423 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 13 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 544 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:38,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1257 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 515 Invalid, 0 Unknown, 544 Unchecked, 4.2s Time] [2023-11-06 21:56:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-06 21:56:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-11-06 21:56:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 229 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 255 transitions. [2023-11-06 21:56:38,443 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 255 transitions. Word has length 30 [2023-11-06 21:56:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:38,443 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 255 transitions. [2023-11-06 21:56:38,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 255 transitions. [2023-11-06 21:56:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 21:56:38,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:38,447 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:38,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:38,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:38,663 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:38,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash 35849682, now seen corresponding path program 3 times [2023-11-06 21:56:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833077385] [2023-11-06 21:56:38,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:56:38,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:38,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:38,666 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:38,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-06 21:56:39,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 21:56:39,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:56:39,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 21:56:39,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:39,378 INFO L351 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 11 treesize of output 5 [2023-11-06 21:56:39,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 21:56:39,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 21:56:39,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 21:56:39,484 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:56:39,752 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:39,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:39,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:40,080 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:40,081 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:40,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:40,420 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:40,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:40,433 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:40,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-06 21:56:40,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-06 21:56:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:40,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:41,134 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_354) c_create_data_~data~0.base) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_353) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_354) c_create_data_~data~0.base) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd (_ bv8 32) .cse2 .cse1)))))) is different from false [2023-11-06 21:56:41,224 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_354) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_354) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_353) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-06 21:56:41,309 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_354) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_353) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_354) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) .cse3 .cse2) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2023-11-06 21:56:41,801 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_352))) (let ((.cse0 (select (select .cse3 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_351) .cse0 v_ArrVal_354) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_353) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_351) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_352) c_create_data_~data~0.base) .cse1) v_ArrVal_354) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2023-11-06 21:56:42,193 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_352))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) .cse1 v_ArrVal_354) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_353) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_352) c_create_data_~data~0.base) .cse2) v_ArrVal_354) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2023-11-06 21:56:42,298 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_352))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) .cse1 v_ArrVal_354) c_create_data_~data~0.base) .cse2) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_353) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_351) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_352) c_create_data_~data~0.base) .cse2) v_ArrVal_354) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse5 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse3))))))) is different from false [2023-11-06 21:56:42,860 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_350))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_349) .cse2 v_ArrVal_351) (select (select (store .cse3 .cse2 v_ArrVal_352) c_create_data_~data~0.base) .cse4) v_ArrVal_354))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_350))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_352))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_349) .cse5 v_ArrVal_351) .cse6 v_ArrVal_354) c_create_data_~data~0.base) .cse4) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_353) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2023-11-06 21:56:43,309 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_350))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_349) .cse3 v_ArrVal_351) (select (select (store .cse4 .cse3 v_ArrVal_352) c_create_data_~data~0.base) .cse5) v_ArrVal_354))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_350))) (let ((.cse6 (select (select .cse9 c_create_data_~data~0.base) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_352))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_349) .cse6 v_ArrVal_351) .cse7 v_ArrVal_354) c_create_data_~data~0.base) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_353) c_create_data_~data~0.base) .cse5))))))))))) is different from false [2023-11-06 21:56:43,451 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_350))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_349) .cse2 v_ArrVal_351) (select (select (store .cse3 .cse2 v_ArrVal_352) c_create_data_~data~0.base) .cse4) v_ArrVal_354))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_351 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_352 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_350))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_352))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_349) .cse5 v_ArrVal_351) .cse6 v_ArrVal_354) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_353) c_create_data_~data~0.base) .cse4))))))))))) is different from false [2023-11-06 21:56:43,492 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:43,492 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2023-11-06 21:56:43,513 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:43,513 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2023-11-06 21:56:43,525 INFO L351 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 1130 treesize of output 968 [2023-11-06 21:56:43,548 INFO L351 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 1231 treesize of output 1153 [2023-11-06 21:56:43,563 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 182 [2023-11-06 21:56:43,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2023-11-06 21:56:43,576 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 142 [2023-11-06 21:56:43,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 122 [2023-11-06 21:56:43,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2023-11-06 21:56:43,711 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:43,712 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2023-11-06 21:56:43,733 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:43,734 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2023-11-06 21:56:43,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:43,749 INFO L351 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 460 treesize of output 310 [2023-11-06 21:56:43,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:43,768 INFO L351 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 24 treesize of output 12 [2023-11-06 21:56:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2023-11-06 21:56:43,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:56:43,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833077385] [2023-11-06 21:56:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833077385] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:56:43,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:43,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2023-11-06 21:56:43,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16990024] [2023-11-06 21:56:43,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:56:43,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 21:56:43,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:56:43,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 21:56:43,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600 [2023-11-06 21:56:43,934 INFO L87 Difference]: Start difference. First operand 234 states and 255 transitions. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:56:48,586 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2023-11-06 21:56:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:56:48,588 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-06 21:56:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:56:48,591 INFO L225 Difference]: With dead ends: 248 [2023-11-06 21:56:48,591 INFO L226 Difference]: Without dead ends: 248 [2023-11-06 21:56:48,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=110, Invalid=337, Unknown=9, NotChecked=414, Total=870 [2023-11-06 21:56:48,592 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 13 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 871 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:56:48,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1442 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 472 Invalid, 0 Unknown, 871 Unchecked, 3.5s Time] [2023-11-06 21:56:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-06 21:56:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2023-11-06 21:56:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 241 states have internal predecessors, (263), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 21:56:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 267 transitions. [2023-11-06 21:56:48,602 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 267 transitions. Word has length 36 [2023-11-06 21:56:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:56:48,603 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 267 transitions. [2023-11-06 21:56:48,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 25 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 267 transitions. [2023-11-06 21:56:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 21:56:48,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:56:48,605 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:56:48,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:48,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:48,818 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-11-06 21:56:48,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1496668502, now seen corresponding path program 4 times [2023-11-06 21:56:48,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:56:48,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500338563] [2023-11-06 21:56:48,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:56:48,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:48,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:56:48,820 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:56:48,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f3abb73-306e-4ef9-8142-55134860d310/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-06 21:56:49,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:56:49,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:56:49,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 21:56:49,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:49,257 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-06 21:56:49,281 INFO L351 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 11 treesize of output 5 [2023-11-06 21:56:49,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 21:56:49,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 21:56:49,347 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 21:56:49,638 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:49,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:49,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:49,958 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:49,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:49,971 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:50,372 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:50,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:50,383 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:50,735 INFO L322 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-06 21:56:50,736 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-06 21:56:50,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-06 21:56:50,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-06 21:56:50,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-06 21:56:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:51,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:51,580 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_448) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_448) c_create_data_~data~0.base) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_449) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-11-06 21:56:51,692 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_448) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_449) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_448) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse3) (bvadd (_ bv8 32) .cse0 .cse3))))))) is different from false [2023-11-06 21:56:51,795 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_448) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_448) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_449) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-11-06 21:56:52,065 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_447) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_446) c_create_data_~data~0.base) .cse2) v_ArrVal_448) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_446))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_447) .cse3 v_ArrVal_448) c_create_data_~data~0.base) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_449) c_create_data_~data~0.base) .cse2)))))))) is different from false [2023-11-06 21:56:52,592 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_446))) (let ((.cse1 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_447) .cse1 v_ArrVal_448) c_create_data_~data~0.base) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_449) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_447) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_446) c_create_data_~data~0.base) .cse2) v_ArrVal_448) c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv8 32) .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2023-11-06 21:56:52,700 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_447) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_446) c_create_data_~data~0.base) .cse3) v_ArrVal_448) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_446))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_447) .cse4 v_ArrVal_448) c_create_data_~data~0.base) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_449) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-11-06 21:56:54,864 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_444))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_445) .cse2 v_ArrVal_447) (select (select (store .cse3 .cse2 v_ArrVal_446) c_create_data_~data~0.base) .cse4) v_ArrVal_448))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd .cse0 (_ bv12 32) .cse1) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_444))) (let ((.cse5 (select (select .cse8 c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_446))) (let ((.cse6 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_445) .cse5 v_ArrVal_447) .cse6 v_ArrVal_448) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_449) c_create_data_~data~0.base) .cse4)))))))))) is different from false [2023-11-06 21:56:57,092 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_444))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_446))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_445) .cse2 v_ArrVal_447) .cse3 v_ArrVal_448) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_449) c_create_data_~data~0.base) .cse4)))))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_444))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_445) .cse8 v_ArrVal_447) (select (select (store .cse9 .cse8 v_ArrVal_446) c_create_data_~data~0.base) .cse4) v_ArrVal_448))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd .cse0 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse7))))))) is different from false [2023-11-06 21:56:57,321 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_444))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_446))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv20 32) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_445) .cse2 v_ArrVal_447) .cse3 v_ArrVal_448) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_449) c_create_data_~data~0.base) .cse4)))))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_444))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_445) .cse8 v_ArrVal_447) (select (select (store .cse9 .cse8 v_ArrVal_446) c_create_data_~data~0.base) .cse4) v_ArrVal_448))) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv16 32) .cse0 .cse7) (bvadd (_ bv20 32) .cse0 .cse7))))))) is different from false [2023-11-06 21:56:59,886 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_442))) (let ((.cse0 (select (select .cse7 c_create_data_~data~0.base) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_444))) (let ((.cse1 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_446))) (let ((.cse2 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_443) .cse0 v_ArrVal_445) .cse1 v_ArrVal_447) .cse2 v_ArrVal_448) c_create_data_~data~0.base) .cse3) (_ bv20 32) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_449) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_442))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_444))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_443) .cse9 v_ArrVal_445) .cse10 v_ArrVal_447) (select (select (store .cse11 .cse10 v_ArrVal_446) c_create_data_~data~0.base) .cse3) v_ArrVal_448))))) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) .cse8 .cse4) (bvadd .cse8 (_ bv20 32) .cse4)))))) is different from false [2023-11-06 21:57:02,511 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (and (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_442))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_444))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_443) .cse3 v_ArrVal_445) .cse4 v_ArrVal_447) (select (select (store .cse5 .cse4 v_ArrVal_446) c_create_data_~data~0.base) .cse6) v_ArrVal_448))))) c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd (_ bv20 32) .cse0 .cse1)))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_442))) (let ((.cse8 (select (select .cse13 c_create_data_~data~0.base) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_444))) (let ((.cse9 (select (select .cse12 c_create_data_~data~0.base) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_446))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv20 32) .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_443) .cse8 v_ArrVal_445) .cse9 v_ArrVal_447) .cse10 v_ArrVal_448) c_create_data_~data~0.base) .cse6)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_449) c_create_data_~data~0.base) .cse6))))))))))))) is different from false [2023-11-06 21:57:02,991 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (and (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_442))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_444))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_443) .cse2 v_ArrVal_445) .cse3 v_ArrVal_447) (select (select (store .cse4 .cse3 v_ArrVal_446) c_create_data_~data~0.base) .cse5) v_ArrVal_448))))) c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_442))) (let ((.cse7 (select (select .cse12 c_create_data_~data~0.base) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_444))) (let ((.cse8 (select (select .cse11 c_create_data_~data~0.base) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_446))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (_ bv20 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_443) .cse7 v_ArrVal_445) .cse8 v_ArrVal_447) .cse9 v_ArrVal_448) c_create_data_~data~0.base) .cse5)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_449) c_create_data_~data~0.base) .cse5))))))))))))) is different from false [2023-11-06 21:57:03,102 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:57:03,103 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 354 [2023-11-06 21:57:03,178 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:57:03,179 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 204 [2023-11-06 21:57:03,273 INFO L351 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 19054376 treesize of output 16609562 [2023-11-06 21:57:54,791 WARN L293 SmtUtils]: Spent 51.51s on a formula simplification. DAG size of input: 1345 DAG size of output: 392 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:57:55,709 INFO L351 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 2667316 treesize of output 2630374 [2023-11-06 21:57:57,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12421 treesize of output 11805 [2023-11-06 21:57:57,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11805 treesize of output 11493 [2023-11-06 21:57:57,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11493 treesize of output 10081 [2023-11-06 21:57:57,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10081 treesize of output 8821 [2023-11-06 21:57:57,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8821 treesize of output 8489 [2023-11-06 21:57:57,942 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8489 treesize of output 7569 [2023-11-06 21:57:58,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7569 treesize of output 7257 [2023-11-06 21:57:58,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7257 treesize of output 7065