./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0102-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0102-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:41:00,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:41:00,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:41:00,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:41:00,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:41:00,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:41:00,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:41:00,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:41:00,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:41:00,388 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:41:00,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:41:00,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:41:00,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:41:00,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:41:00,391 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:41:00,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:41:00,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:41:00,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:41:00,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:41:00,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:41:00,396 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:41:00,396 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:41:00,397 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:41:00,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:41:00,401 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:41:00,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:41:00,401 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:41:00,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:41:00,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:41:00,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:41:00,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:41:00,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:41:00,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:41:00,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:00,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:41:00,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:41:00,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:41:00,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:41:00,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:41:00,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:41:00,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:41:00,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:41:00,405 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2024-11-19 06:41:00,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:41:00,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:41:00,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:41:00,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:41:00,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:41:00,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-2.i [2024-11-19 06:41:02,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:41:02,469 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:41:02,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2024-11-19 06:41:02,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb24c1b8/74119814894042fab4ea91f152b255da/FLAGb181005d7 [2024-11-19 06:41:02,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb24c1b8/74119814894042fab4ea91f152b255da [2024-11-19 06:41:02,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:41:02,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:41:02,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:02,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:41:02,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:41:02,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:02" (1/1) ... [2024-11-19 06:41:02,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2235c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:02, skipping insertion in model container [2024-11-19 06:41:02,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:02" (1/1) ... [2024-11-19 06:41:02,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:41:02,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:02,941 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:41:02,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3522b55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:02, skipping insertion in model container [2024-11-19 06:41:02,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:02,943 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:41:02,945 INFO L158 Benchmark]: Toolchain (without parser) took 440.17ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 99.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:41:02,946 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:41:02,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 99.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:41:02,948 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.16ms. Allocated memory is still 117.4MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.89ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 99.9MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: 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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0102-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:41:05,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:41:05,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:41:05,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:41:05,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:41:05,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:41:05,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:41:05,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:41:05,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:41:05,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:41:05,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:41:05,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:41:05,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:41:05,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:41:05,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:41:05,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:41:05,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:41:05,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:41:05,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:41:05,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:41:05,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:41:05,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:41:05,159 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:41:05,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:41:05,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:41:05,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:41:05,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:41:05,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:41:05,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:41:05,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:41:05,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:41:05,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:41:05,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:41:05,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:41:05,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:41:05,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:05,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:41:05,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:41:05,164 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:41:05,164 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:41:05,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:41:05,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:41:05,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:41:05,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:41:05,166 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2024-11-19 06:41:05,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:41:05,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:41:05,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:41:05,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:41:05,537 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:41:05,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-2.i [2024-11-19 06:41:06,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:41:07,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:41:07,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2024-11-19 06:41:07,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd657d4b0/d873cba2e8ed4d578aa5750dafb04ef6/FLAG5923cddb2 [2024-11-19 06:41:07,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd657d4b0/d873cba2e8ed4d578aa5750dafb04ef6 [2024-11-19 06:41:07,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:41:07,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:41:07,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:07,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:41:07,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:41:07,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:07,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ca7848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07, skipping insertion in model container [2024-11-19 06:41:07,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:07,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:41:07,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:07,764 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:41:07,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:41:07,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:07,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:41:07,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:07,952 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:41:07,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07 WrapperNode [2024-11-19 06:41:07,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:07,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:07,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:41:07,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:41:07,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:07,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,015 INFO L138 Inliner]: procedures = 136, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-19 06:41:08,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:08,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:41:08,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:41:08,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:41:08,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,063 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2024-11-19 06:41:08,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:41:08,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:41:08,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:41:08,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:41:08,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (1/1) ... [2024-11-19 06:41:08,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:08,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:08,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:41:08,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:41:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2024-11-19 06:41:08,173 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2024-11-19 06:41:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:41:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:41:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2024-11-19 06:41:08,173 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2024-11-19 06:41:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:41:08,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:41:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:41:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:41:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:41:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:41:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:41:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:41:08,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:41:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:41:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:41:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:41:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:41:08,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:41:08,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:41:08,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:41:08,807 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-19 06:41:08,807 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:41:08,820 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:41:08,821 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 06:41:08,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:08 BoogieIcfgContainer [2024-11-19 06:41:08,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:41:08,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:41:08,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:41:08,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:41:08,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:41:07" (1/3) ... [2024-11-19 06:41:08,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6ebcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:08, skipping insertion in model container [2024-11-19 06:41:08,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:07" (2/3) ... [2024-11-19 06:41:08,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6ebcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:08, skipping insertion in model container [2024-11-19 06:41:08,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:08" (3/3) ... [2024-11-19 06:41:08,830 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-2.i [2024-11-19 06:41:08,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:41:08,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-11-19 06:41:08,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:41:08,901 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17d7ad63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:41:08,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-19 06:41:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 47 states have (on average 1.872340425531915) internal successors, (88), 78 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:41:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 06:41:08,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:08,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 06:41:08,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 80247087, now seen corresponding path program 1 times [2024-11-19 06:41:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:08,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149332483] [2024-11-19 06:41:08,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:08,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:08,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:08,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:41:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:09,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:41:09,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:09,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:09,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:09,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149332483] [2024-11-19 06:41:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149332483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:09,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315624915] [2024-11-19 06:41:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:09,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:41:09,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:41:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:09,086 INFO L87 Difference]: Start difference. First operand has 85 states, 47 states have (on average 1.872340425531915) internal successors, (88), 78 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:09,112 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-19 06:41:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:41:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 06:41:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:09,129 INFO L225 Difference]: With dead ends: 85 [2024-11-19 06:41:09,130 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 06:41:09,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:09,138 INFO L432 NwaCegarLoop]: 90 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, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:09,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 06:41:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 06:41:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:41:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-19 06:41:09,179 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 5 [2024-11-19 06:41:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:09,180 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-19 06:41:09,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-19 06:41:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:09,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:09,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:09,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:41:09,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:09,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:09,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -210880887, now seen corresponding path program 1 times [2024-11-19 06:41:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:09,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383578311] [2024-11-19 06:41:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:09,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:09,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:09,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:09,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:41:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:09,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:41:09,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:09,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:09,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:09,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:09,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383578311] [2024-11-19 06:41:09,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383578311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:09,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:09,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:41:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583623776] [2024-11-19 06:41:09,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:09,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:41:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:41:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:09,586 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:09,857 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-19 06:41:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:41:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2024-11-19 06:41:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:09,868 INFO L225 Difference]: With dead ends: 81 [2024-11-19 06:41:09,869 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 06:41:09,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:09,871 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 25 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:09,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 06:41:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 06:41:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 74 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:41:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-19 06:41:09,889 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 7 [2024-11-19 06:41:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:09,890 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-19 06:41:09,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-19 06:41:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:09,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:09,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:09,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:41:10,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:10,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:10,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -210880886, now seen corresponding path program 1 times [2024-11-19 06:41:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585097223] [2024-11-19 06:41:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:10,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:10,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:10,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:10,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:41:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:10,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:41:10,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:10,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:10,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:10,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:10,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585097223] [2024-11-19 06:41:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585097223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:10,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:10,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:41:10,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611865304] [2024-11-19 06:41:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:10,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:41:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:10,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:41:10,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:10,265 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:10,536 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-19 06:41:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:41:10,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2024-11-19 06:41:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:10,539 INFO L225 Difference]: With dead ends: 85 [2024-11-19 06:41:10,541 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 06:41:10,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:10,542 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:10,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 243 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 06:41:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-11-19 06:41:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.653061224489796) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:41:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-19 06:41:10,555 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 7 [2024-11-19 06:41:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:10,556 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-19 06:41:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-19 06:41:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:41:10,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:10,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:10,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:41:10,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:10,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_sub_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1931367567, now seen corresponding path program 1 times [2024-11-19 06:41:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011965031] [2024-11-19 06:41:10,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:10,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:10,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:10,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:10,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:41:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:10,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:41:10,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:10,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:10,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:10,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011965031] [2024-11-19 06:41:10,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011965031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:10,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:10,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773830089] [2024-11-19 06:41:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:10,868 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:10,957 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-19 06:41:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-19 06:41:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:10,970 INFO L225 Difference]: With dead ends: 83 [2024-11-19 06:41:10,970 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 06:41:10,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:10,972 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:10,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 06:41:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 06:41:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 75 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:41:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-19 06:41:10,979 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 11 [2024-11-19 06:41:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:10,980 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-19 06:41:10,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-19 06:41:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:41:10,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:10,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:10,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-19 06:41:11,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:11,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:11,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1931367566, now seen corresponding path program 1 times [2024-11-19 06:41:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742748468] [2024-11-19 06:41:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:11,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:11,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:11,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:41:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:11,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:41:11,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:11,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:11,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:11,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742748468] [2024-11-19 06:41:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742748468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:11,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544797568] [2024-11-19 06:41:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:11,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:11,308 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:11,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:11,432 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-19 06:41:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:11,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-19 06:41:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:11,437 INFO L225 Difference]: With dead ends: 82 [2024-11-19 06:41:11,437 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 06:41:11,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:11,439 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:11,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 06:41:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 06:41:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 74 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:41:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-19 06:41:11,451 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 11 [2024-11-19 06:41:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:11,452 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-19 06:41:11,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-19 06:41:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:41:11,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:11,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:11,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:41:11,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:11,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1989184481, now seen corresponding path program 1 times [2024-11-19 06:41:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406429039] [2024-11-19 06:41:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:11,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:11,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:11,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:41:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:11,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:41:11,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:11,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:11,869 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:41:11,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 06:41:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:11,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:11,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:11,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406429039] [2024-11-19 06:41:11,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406429039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:11,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:11,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953505143] [2024-11-19 06:41:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:11,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:11,967 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:12,504 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2024-11-19 06:41:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:41:12,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 06:41:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:12,505 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:41:12,505 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:41:12,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:41:12,507 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 38 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:12,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 275 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:41:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:41:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2024-11-19 06:41:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 83 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:41:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-11-19 06:41:12,520 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 14 [2024-11-19 06:41:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:12,521 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-11-19 06:41:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-11-19 06:41:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:41:12,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:12,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:12,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:41:12,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:12,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1989184480, now seen corresponding path program 1 times [2024-11-19 06:41:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701650992] [2024-11-19 06:41:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:12,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:12,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:12,725 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:12,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:41:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:12,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:41:12,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:12,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:12,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:13,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:41:13,017 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:41:13,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:41:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:13,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:13,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:13,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701650992] [2024-11-19 06:41:13,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701650992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:13,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:13,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276987525] [2024-11-19 06:41:13,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:13,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:13,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:13,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:13,104 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:13,564 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2024-11-19 06:41:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:13,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 06:41:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:13,565 INFO L225 Difference]: With dead ends: 119 [2024-11-19 06:41:13,565 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 06:41:13,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:41:13,566 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:13,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 307 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:41:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 06:41:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2024-11-19 06:41:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 100 states have internal predecessors, (122), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:41:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2024-11-19 06:41:13,578 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 14 [2024-11-19 06:41:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:13,578 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2024-11-19 06:41:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2024-11-19 06:41:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:41:13,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:13,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:13,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-19 06:41:13,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:13,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_add_tailErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:13,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash -345839264, now seen corresponding path program 1 times [2024-11-19 06:41:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:13,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415657143] [2024-11-19 06:41:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:13,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:13,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:13,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:41:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:13,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:41:13,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:13,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:13,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:13,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415657143] [2024-11-19 06:41:13,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415657143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:13,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419230986] [2024-11-19 06:41:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:13,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:13,905 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:14,007 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-11-19 06:41:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:41:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:14,009 INFO L225 Difference]: With dead ends: 110 [2024-11-19 06:41:14,009 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 06:41:14,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:14,010 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:14,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 176 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 06:41:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 06:41:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.6081081081081081) internal successors, (119), 99 states have internal predecessors, (119), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:41:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2024-11-19 06:41:14,019 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 16 [2024-11-19 06:41:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2024-11-19 06:41:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2024-11-19 06:41:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:41:14,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:14,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:14,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 06:41:14,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:14,221 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:14,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -345839263, now seen corresponding path program 1 times [2024-11-19 06:41:14,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:14,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149953290] [2024-11-19 06:41:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:14,224 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:14,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:41:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:14,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:41:14,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:14,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:14,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:14,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149953290] [2024-11-19 06:41:14,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149953290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:14,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:14,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:41:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845156074] [2024-11-19 06:41:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:14,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:41:14,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:14,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:41:14,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:14,435 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:14,709 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2024-11-19 06:41:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:41:14,710 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:41:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:14,711 INFO L225 Difference]: With dead ends: 116 [2024-11-19 06:41:14,711 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 06:41:14,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:41:14,712 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:14,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 538 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 06:41:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2024-11-19 06:41:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 99 states have internal predecessors, (118), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:41:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2024-11-19 06:41:14,719 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 16 [2024-11-19 06:41:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:14,719 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2024-11-19 06:41:14,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2024-11-19 06:41:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:41:14,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:14,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:14,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 06:41:14,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:14,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:14,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2131082580, now seen corresponding path program 1 times [2024-11-19 06:41:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732774562] [2024-11-19 06:41:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:14,923 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:14,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:41:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:15,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:41:15,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:15,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:15,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:15,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732774562] [2024-11-19 06:41:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732774562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:15,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:15,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:41:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470757599] [2024-11-19 06:41:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:15,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:15,071 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:15,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:15,278 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2024-11-19 06:41:15,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:41:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 06:41:15,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:15,279 INFO L225 Difference]: With dead ends: 115 [2024-11-19 06:41:15,279 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 06:41:15,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:15,280 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 24 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:15,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 251 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 06:41:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2024-11-19 06:41:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.527027027027027) internal successors, (113), 98 states have internal predecessors, (113), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:41:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2024-11-19 06:41:15,284 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 17 [2024-11-19 06:41:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:15,285 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2024-11-19 06:41:15,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2024-11-19 06:41:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:41:15,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:15,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:15,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 06:41:15,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:15,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:15,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2131082579, now seen corresponding path program 1 times [2024-11-19 06:41:15,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:15,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046370522] [2024-11-19 06:41:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:15,489 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:15,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:41:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:15,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:41:15,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:15,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:15,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:15,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:15,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046370522] [2024-11-19 06:41:15,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046370522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:15,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:15,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:41:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706872076] [2024-11-19 06:41:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:41:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:41:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:41:15,712 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:15,992 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2024-11-19 06:41:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:41:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 06:41:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:15,993 INFO L225 Difference]: With dead ends: 113 [2024-11-19 06:41:15,994 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 06:41:15,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:15,994 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 19 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:15,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 266 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 06:41:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-19 06:41:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.472972972972973) internal successors, (109), 98 states have internal predecessors, (109), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:41:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-11-19 06:41:15,998 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 17 [2024-11-19 06:41:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:15,999 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-11-19 06:41:15,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-11-19 06:41:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:41:15,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:16,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:16,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:16,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:16,203 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 729041295, now seen corresponding path program 1 times [2024-11-19 06:41:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:16,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207044731] [2024-11-19 06:41:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:16,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:16,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:16,206 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:16,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:41:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:16,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:41:16,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:16,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:16,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:41:16,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 06:41:16,503 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:41:16,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:41:16,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-19 06:41:16,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:41:16,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-19 06:41:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:16,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:16,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207044731] [2024-11-19 06:41:16,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207044731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:16,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:16,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:41:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605309355] [2024-11-19 06:41:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:16,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:41:16,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:16,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:41:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:41:16,700 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:17,615 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2024-11-19 06:41:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:41:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 06:41:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:17,618 INFO L225 Difference]: With dead ends: 133 [2024-11-19 06:41:17,618 INFO L226 Difference]: Without dead ends: 133 [2024-11-19 06:41:17,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:41:17,619 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:17,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 524 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:41:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-19 06:41:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-19 06:41:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 118 states have internal predecessors, (133), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 06:41:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2024-11-19 06:41:17,626 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 19 [2024-11-19 06:41:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:17,626 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2024-11-19 06:41:17,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2024-11-19 06:41:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:41:17,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:17,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:17,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:17,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:17,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:17,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 729041296, now seen corresponding path program 1 times [2024-11-19 06:41:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:17,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918122963] [2024-11-19 06:41:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:17,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:17,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:17,833 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:17,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:41:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:18,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 06:41:18,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:18,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:18,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:18,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:18,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:18,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:41:18,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:41:18,261 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:41:18,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:41:18,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:41:18,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:41:18,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:41:18,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 06:41:18,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:41:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:18,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:18,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918122963] [2024-11-19 06:41:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918122963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:41:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222508068] [2024-11-19 06:41:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:18,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:41:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:41:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:41:18,626 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:19,512 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2024-11-19 06:41:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:41:19,512 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 06:41:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:19,513 INFO L225 Difference]: With dead ends: 131 [2024-11-19 06:41:19,513 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 06:41:19,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:41:19,514 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:19,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 398 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:41:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 06:41:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-19 06:41:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 118 states have internal predecessors, (132), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 06:41:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2024-11-19 06:41:19,519 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 19 [2024-11-19 06:41:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:19,519 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2024-11-19 06:41:19,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2024-11-19 06:41:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:41:19,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:19,521 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:19,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-11-19 06:41:19,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:19,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:19,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:19,722 INFO L85 PathProgramCache]: Analyzing trace with hash -210567605, now seen corresponding path program 1 times [2024-11-19 06:41:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617717101] [2024-11-19 06:41:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:19,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:19,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:19,726 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:19,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:41:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:19,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:41:19,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:19,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:19,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:19,972 WARN L873 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)) (= (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (select |c_#length| |create_sub_list_insert_sub_~sub~0#1.base|)) |c_#length|))) is different from true [2024-11-19 06:41:19,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:41:20,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:20,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:41:20,069 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:41:20,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:41:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:20,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:20,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:20,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617717101] [2024-11-19 06:41:20,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617717101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:20,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1180527371] [2024-11-19 06:41:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:41:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:41:20,378 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:41:20,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-19 06:41:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:20,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:41:20,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:20,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:20,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:20,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:41:21,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:21,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:41:21,152 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:41:21,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:41:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:21,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1180527371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:21,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2024-11-19 06:41:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635788292] [2024-11-19 06:41:21,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:41:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:21,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:41:21,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=265, Unknown=1, NotChecked=32, Total=342 [2024-11-19 06:41:21,552 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:41:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:22,570 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2024-11-19 06:41:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:41:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2024-11-19 06:41:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:22,572 INFO L225 Difference]: With dead ends: 148 [2024-11-19 06:41:22,572 INFO L226 Difference]: Without dead ends: 148 [2024-11-19 06:41:22,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=520, Unknown=1, NotChecked=46, Total=650 [2024-11-19 06:41:22,573 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:22,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 446 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 0 Unknown, 93 Unchecked, 0.7s Time] [2024-11-19 06:41:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-19 06:41:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2024-11-19 06:41:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.386138613861386) internal successors, (140), 124 states have internal predecessors, (140), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-19 06:41:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2024-11-19 06:41:22,578 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 30 [2024-11-19 06:41:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2024-11-19 06:41:22,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:41:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2024-11-19 06:41:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:41:22,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:22,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:22,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-19 06:41:22,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:41:22,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:22,981 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:22,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1752194753, now seen corresponding path program 1 times [2024-11-19 06:41:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878277030] [2024-11-19 06:41:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:22,983 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:22,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 06:41:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:23,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 06:41:23,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:23,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:23,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:41:23,383 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:41:23,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:41:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:23,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:26,517 INFO L378 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 52 treesize of output 48 [2024-11-19 06:41:26,747 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-19 06:41:26,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 06:41:26,777 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-19 06:41:26,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 06:41:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:26,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878277030] [2024-11-19 06:41:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878277030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:26,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2024-11-19 06:41:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019102692] [2024-11-19 06:41:26,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:26,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:41:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:41:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:41:26,796 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:41:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:29,463 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2024-11-19 06:41:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:41:29,464 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2024-11-19 06:41:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:29,465 INFO L225 Difference]: With dead ends: 144 [2024-11-19 06:41:29,465 INFO L226 Difference]: Without dead ends: 144 [2024-11-19 06:41:29,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 06:41:29,466 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 94 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:29,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 722 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 06:41:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-19 06:41:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2024-11-19 06:41:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.36) internal successors, (136), 122 states have internal predecessors, (136), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-19 06:41:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2024-11-19 06:41:29,471 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 37 [2024-11-19 06:41:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:29,472 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2024-11-19 06:41:29,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 18 states have internal predecessors, (43), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:41:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2024-11-19 06:41:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:41:29,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:29,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:29,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:29,674 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1419243695, now seen corresponding path program 1 times [2024-11-19 06:41:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:29,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936456338] [2024-11-19 06:41:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:29,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:29,676 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:29,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 06:41:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:30,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-19 06:41:30,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:30,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:30,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:30,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:30,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:41:30,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:41:30,264 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:41:30,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:41:30,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:41:30,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:41:30,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:41:30,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:41:31,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 73 [2024-11-19 06:41:31,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:31,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-11-19 06:41:31,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-19 06:41:31,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:41:31,615 INFO L349 Elim1Store]: treesize reduction 156, result has 25.4 percent of original size [2024-11-19 06:41:31,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 76 [2024-11-19 06:41:31,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-19 06:41:32,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-19 06:41:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:32,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:33,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:33,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936456338] [2024-11-19 06:41:33,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936456338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:33,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [293107731] [2024-11-19 06:41:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:33,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:41:33,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:41:33,496 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:41:33,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-19 06:41:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:34,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-19 06:41:34,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:34,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:34,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:34,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:34,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:41:34,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:41:34,198 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:41:34,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:41:34,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:41:34,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:41:34,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:41:34,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:41:34,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:41:34,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 73 [2024-11-19 06:41:34,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:34,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-11-19 06:41:34,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-19 06:41:35,103 INFO L349 Elim1Store]: treesize reduction 156, result has 25.4 percent of original size [2024-11-19 06:41:35,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 76 [2024-11-19 06:41:35,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-19 06:41:35,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2024-11-19 06:41:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:35,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:36,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [293107731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:36,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:36,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2024-11-19 06:41:36,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716992107] [2024-11-19 06:41:36,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:36,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:41:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:41:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:41:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=831, Unknown=14, NotChecked=0, Total=930 [2024-11-19 06:41:36,356 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:41:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:40,497 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2024-11-19 06:41:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 06:41:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-19 06:41:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:40,499 INFO L225 Difference]: With dead ends: 152 [2024-11-19 06:41:40,499 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 06:41:40,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=219, Invalid=1923, Unknown=20, NotChecked=0, Total=2162 [2024-11-19 06:41:40,501 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 37 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:40,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 715 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 836 Invalid, 2 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 06:41:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 06:41:40,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-19 06:41:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 135 states have internal predecessors, (149), 9 states have call successors, (9), 9 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-19 06:41:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2024-11-19 06:41:40,509 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 36 [2024-11-19 06:41:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:40,510 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2024-11-19 06:41:40,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:41:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2024-11-19 06:41:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:41:40,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:40,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:40,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-19 06:41:40,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 06:41:40,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:40,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:41:40,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1419243696, now seen corresponding path program 1 times [2024-11-19 06:41:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:41:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790018005] [2024-11-19 06:41:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:40,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:41:40,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:41:40,920 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:41:40,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 06:41:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:41,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-19 06:41:41,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:41,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:41,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:41,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:41,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:41:41,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:41:41,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:41,478 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:41:41,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:41:41,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:41:41,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:41:41,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:41:41,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:41:43,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 123 [2024-11-19 06:41:43,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2024-11-19 06:41:43,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:43,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 15 [2024-11-19 06:41:43,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2024-11-19 06:41:43,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:43,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-11-19 06:41:43,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-19 06:41:43,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:43,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:43,712 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:41:43,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-19 06:41:43,768 INFO L349 Elim1Store]: treesize reduction 72, result has 22.6 percent of original size [2024-11-19 06:41:43,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 44 [2024-11-19 06:41:43,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-19 06:41:43,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:41:44,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-19 06:41:44,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:41:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:44,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:50,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:41:50,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790018005] [2024-11-19 06:41:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790018005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:50,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1573514303] [2024-11-19 06:41:50,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:50,608 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 06:41:50,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 06:41:50,610 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 06:41:50,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-19 06:41:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:51,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-19 06:41:51,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:51,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:41:51,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:51,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:41:51,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:41:51,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:41:51,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:51,517 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:41:51,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:41:51,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:41:51,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:41:51,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:41:51,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:41:55,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 130 [2024-11-19 06:41:55,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:55,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2024-11-19 06:41:55,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-19 06:41:55,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2024-11-19 06:41:55,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:55,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 15 [2024-11-19 06:41:55,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2024-11-19 06:41:55,890 INFO L349 Elim1Store]: treesize reduction 72, result has 22.6 percent of original size [2024-11-19 06:41:55,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 44 [2024-11-19 06:41:55,911 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 06:41:55,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-19 06:41:56,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-19 06:41:56,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:41:56,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:41:56,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2024-11-19 06:41:56,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:41:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:56,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:56,379 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1071 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1072) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1071) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1072 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1072) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2024-11-19 06:42:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1573514303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:01,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2024-11-19 06:42:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613020651] [2024-11-19 06:42:01,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 06:42:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:42:01,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 06:42:01,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1211, Unknown=18, NotChecked=70, Total=1406 [2024-11-19 06:42:01,378 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:13,300 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2024-11-19 06:42:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 06:42:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-19 06:42:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:13,302 INFO L225 Difference]: With dead ends: 155 [2024-11-19 06:42:13,302 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 06:42:13,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=203, Invalid=2133, Unknown=20, NotChecked=94, Total=2450 [2024-11-19 06:42:13,303 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:13,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 603 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 06:42:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 06:42:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-19 06:42:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 138 states have internal predecessors, (150), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-19 06:42:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-19 06:42:13,310 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 36 [2024-11-19 06:42:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:13,310 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-19 06:42:13,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 25 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-19 06:42:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 06:42:13,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:13,314 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:13,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:13,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2024-11-19 06:42:13,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 06:42:13,714 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:42:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -231978304, now seen corresponding path program 1 times [2024-11-19 06:42:13,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:42:13,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546350353] [2024-11-19 06:42:13,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:13,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:42:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:42:13,717 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:42:13,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 06:42:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:13,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:42:13,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:42:14,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:14,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:42:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546350353] [2024-11-19 06:42:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546350353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:14,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:42:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108088247] [2024-11-19 06:42:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:14,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:42:14,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:42:14,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:42:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:42:14,087 INFO L87 Difference]: Start difference. First operand 155 states and 169 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:14,446 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2024-11-19 06:42:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:42:14,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-19 06:42:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:14,448 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:42:14,448 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:42:14,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:42:14,448 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 32 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:14,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 714 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:42:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:42:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-19 06:42:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 138 states have internal predecessors, (148), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-19 06:42:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2024-11-19 06:42:14,454 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 39 [2024-11-19 06:42:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:14,454 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2024-11-19 06:42:14,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2024-11-19 06:42:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:42:14,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:14,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:14,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:14,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:42:14,660 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-19 06:42:14,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash -263292975, now seen corresponding path program 1 times [2024-11-19 06:42:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:42:14,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498450501] [2024-11-19 06:42:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:42:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:42:14,662 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:42:14,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 06:42:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:15,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 06:42:15,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:15,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:42:15,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:42:15,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 06:42:15,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:42:15,310 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:42:15,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:42:15,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:42:15,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 06:42:15,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 06:42:15,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:42:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:42:15,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:15,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:15,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-19 06:42:16,192 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1283) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1283) |c_create_sub_list_insert_sub_~head#1.base|) .cse1) (_ bv4 32)) (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (forall ((v_ArrVal_1284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1284) |c_create_sub_list_insert_sub_~head#1.base|) .cse1) |c_create_sub_list_insert_sub_~head#1.base|)))) is different from false [2024-11-19 06:42:16,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_46| (_ BitVec 32))) (or (forall ((v_ArrVal_1283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_46| v_ArrVal_1283) |c_create_sub_list_~sub#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_46|))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_46| (_ BitVec 32))) (or (forall ((v_ArrVal_1283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_46| v_ArrVal_1283) |c_create_sub_list_~sub#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_46|))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_46| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_46|))) (forall ((v_ArrVal_1284 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_46| v_ArrVal_1284) |c_create_sub_list_~sub#1.base|) .cse0) |c_create_sub_list_~sub#1.base|)))))) is different from false [2024-11-19 06:42:16,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-19 06:42:16,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-11-19 06:42:16,568 INFO L378 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 15 treesize of output 11 [2024-11-19 06:42:16,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:16,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-19 06:42:16,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:16,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2024-11-19 06:42:16,629 INFO L378 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 7 treesize of output 3 [2024-11-19 06:42:16,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:16,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2024-11-19 06:42:16,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:16,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2024-11-19 06:42:17,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:17,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 62 [2024-11-19 06:42:17,476 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-19 06:42:17,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 06:42:17,512 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2024-11-19 06:42:17,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 06:42:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:42:17,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:42:17,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498450501] [2024-11-19 06:42:17,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498450501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:42:17,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:17,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2024-11-19 06:42:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162755477] [2024-11-19 06:42:17,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:17,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-19 06:42:17,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:42:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-19 06:42:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=735, Unknown=4, NotChecked=110, Total=930 [2024-11-19 06:42:17,548 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 31 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:42:21,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 06:42:25,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]