./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.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 d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:45:24,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:45:24,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:45:24,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:45:24,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:45:24,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:45:24,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:45:24,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:45:24,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:45:24,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:45:24,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:45:24,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:45:24,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:45:24,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:45:24,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:45:24,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:45:24,856 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:45:24,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:45:24,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:45:24,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:45:24,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:45:24,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:45:24,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:45:24,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:45:24,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:45:24,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:45:24,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:45:24,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:45:24,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:45:24,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:45:24,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:45:24,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:45:24,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:45:24,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:45:24,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:45:24,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:45:24,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:45:24,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:45:24,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:45:24,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:45:24,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:45:24,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:45:24,869 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 -> d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc [2024-10-13 10:45:25,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:45:25,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:45:25,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:45:25,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:45:25,169 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:45:25,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-10-13 10:45:26,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:45:26,964 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:45:26,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-10-13 10:45:26,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243810ff9/eca2eb5b21da4e04965e5b9ba201e6fd/FLAGf0819e739 [2024-10-13 10:45:26,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243810ff9/eca2eb5b21da4e04965e5b9ba201e6fd [2024-10-13 10:45:27,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:45:27,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:45:27,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:27,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:45:27,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:45:27,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:27" (1/1) ... [2024-10-13 10:45:27,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ad417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:27, skipping insertion in model container [2024-10-13 10:45:27,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:27" (1/1) ... [2024-10-13 10:45:27,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:45:27,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:27,540 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-10-13 10:45:27,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3a209886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:27, skipping insertion in model container [2024-10-13 10:45:27,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:27,541 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:45:27,543 INFO L158 Benchmark]: Toolchain (without parser) took 539.12ms. Allocated memory is still 148.9MB. Free memory was 92.4MB in the beginning and 76.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:45:27,544 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 148.9MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:45:27,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.43ms. Allocated memory is still 148.9MB. Free memory was 92.0MB in the beginning and 76.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 10:45:27,546 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.60ms. Allocated memory is still 148.9MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.43ms. Allocated memory is still 148.9MB. Free memory was 92.0MB in the beginning and 76.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.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 d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:45:29,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:45:29,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 10:45:29,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:45:29,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:45:29,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:45:29,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:45:29,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:45:29,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:45:29,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:45:29,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:45:29,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:45:29,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:45:29,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:45:29,720 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:45:29,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:45:29,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:45:29,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:45:29,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:45:29,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:45:29,722 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:45:29,725 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:45:29,726 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:45:29,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:45:29,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:45:29,727 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:45:29,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:45:29,727 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:45:29,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:45:29,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:45:29,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:45:29,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:45:29,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:45:29,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:45:29,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:45:29,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:45:29,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:45:29,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:45:29,730 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:45:29,731 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:29,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:45:29,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:45:29,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:45:29,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:45:29,733 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:45:29,733 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 -> d286f1bc6bef2af97aa9bf8e95cd227fcca3bcb186ca467ee6b24a6fc8e433bc [2024-10-13 10:45:30,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:45:30,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:45:30,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:45:30,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:45:30,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:45:30,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-10-13 10:45:31,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:45:31,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:45:31,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-10-13 10:45:31,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deadca52a/1c4ee91c0ae04508846959c8960f1c67/FLAG03cfefa3c [2024-10-13 10:45:31,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deadca52a/1c4ee91c0ae04508846959c8960f1c67 [2024-10-13 10:45:31,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:45:31,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:45:31,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:31,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:45:31,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:45:31,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:31" (1/1) ... [2024-10-13 10:45:31,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b47cddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31, skipping insertion in model container [2024-10-13 10:45:31,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:31" (1/1) ... [2024-10-13 10:45:32,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:45:32,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:32,459 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:45:32,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:45:32,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:32,549 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:45:32,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:45:32,659 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:45:32,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32 WrapperNode [2024-10-13 10:45:32,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:45:32,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:45:32,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:45:32,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:45:32,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,728 INFO L138 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 93 [2024-10-13 10:45:32,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:45:32,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:45:32,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:45:32,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:45:32,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,769 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-13 10:45:32,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:45:32,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:45:32,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:45:32,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:45:32,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (1/1) ... [2024-10-13 10:45:32,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:45:32,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:45:32,829 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-10-13 10:45:32,833 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-10-13 10:45:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 10:45:32,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 10:45:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2024-10-13 10:45:32,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2024-10-13 10:45:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:45:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:45:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:45:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:45:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:45:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:45:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:45:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 10:45:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 10:45:32,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:45:32,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:45:33,054 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:45:33,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:45:33,472 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-10-13 10:45:33,473 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:45:33,524 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:45:33,525 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 10:45:33,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:33 BoogieIcfgContainer [2024-10-13 10:45:33,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:45:33,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:45:33,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:45:33,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:45:33,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:45:31" (1/3) ... [2024-10-13 10:45:33,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac6c1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:33, skipping insertion in model container [2024-10-13 10:45:33,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:32" (2/3) ... [2024-10-13 10:45:33,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac6c1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:33, skipping insertion in model container [2024-10-13 10:45:33,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:33" (3/3) ... [2024-10-13 10:45:33,535 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11.i [2024-10-13 10:45:33,553 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:45:33,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-13 10:45:33,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:45:33,613 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;@2b5efc6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:45:33,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-10-13 10:45:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 66 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:45:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:45:33,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:33,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:33,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:33,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash -70758869, now seen corresponding path program 1 times [2024-10-13 10:45:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:33,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768281349] [2024-10-13 10:45:33,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:33,646 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-10-13 10:45:33,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:33,647 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-10-13 10:45:33,648 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-10-13 10:45:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:33,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:45:33,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:33,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:33,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768281349] [2024-10-13 10:45:33,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768281349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:33,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:33,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352445501] [2024-10-13 10:45:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:33,860 INFO L87 Difference]: Start difference. First operand has 75 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 66 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:45:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:34,028 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2024-10-13 10:45:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 10:45:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:34,043 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:45:34,044 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 10:45:34,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:34,052 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 53 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:34,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 263 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:45:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 10:45:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 78. [2024-10-13 10:45:34,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 68 states have internal predecessors, (74), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-13 10:45:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2024-10-13 10:45:34,104 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 10 [2024-10-13 10:45:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:34,105 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2024-10-13 10:45:34,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:45:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2024-10-13 10:45:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:45:34,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:34,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:34,114 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-10-13 10:45:34,313 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-10-13 10:45:34,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:34,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash 816744812, now seen corresponding path program 1 times [2024-10-13 10:45:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846630440] [2024-10-13 10:45:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:34,315 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-10-13 10:45:34,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:34,318 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-10-13 10:45:34,320 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-10-13 10:45:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:34,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:45:34,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:34,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-10-13 10:45:34,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:34,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846630440] [2024-10-13 10:45:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846630440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:34,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:34,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:45:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38875945] [2024-10-13 10:45:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:34,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:45:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:34,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:45:34,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:45:34,437 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:45:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:34,732 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2024-10-13 10:45:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:45:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-13 10:45:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:34,734 INFO L225 Difference]: With dead ends: 138 [2024-10-13 10:45:34,734 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 10:45:34,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-13 10:45:34,736 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 58 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:34,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 257 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:45:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 10:45:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 74. [2024-10-13 10:45:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 39 states have (on average 1.794871794871795) internal successors, (70), 65 states have internal predecessors, (70), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:45:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-13 10:45:34,756 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 10 [2024-10-13 10:45:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:34,756 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-13 10:45:34,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:45:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-13 10:45:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:34,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:34,757 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:34,762 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-10-13 10:45:34,960 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-10-13 10:45:34,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:34,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -826532228, now seen corresponding path program 1 times [2024-10-13 10:45:34,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:34,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876382895] [2024-10-13 10:45:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:34,962 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-10-13 10:45:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:34,966 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-10-13 10:45:34,967 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-10-13 10:45:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:35,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:45:35,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:35,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:35,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876382895] [2024-10-13 10:45:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876382895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:35,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:35,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248976620] [2024-10-13 10:45:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:35,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:35,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:35,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:35,058 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:45:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:35,166 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2024-10-13 10:45:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:35,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-13 10:45:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:35,169 INFO L225 Difference]: With dead ends: 123 [2024-10-13 10:45:35,170 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 10:45:35,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:35,171 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:35,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 292 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:45:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 10:45:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2024-10-13 10:45:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 68 states have internal predecessors, (73), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-13 10:45:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-10-13 10:45:35,186 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 16 [2024-10-13 10:45:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:35,187 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-10-13 10:45:35,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:45:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-10-13 10:45:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:35,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:35,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:35,193 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:45:35,388 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-10-13 10:45:35,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:35,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -826532239, now seen corresponding path program 1 times [2024-10-13 10:45:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137988794] [2024-10-13 10:45:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:35,390 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-10-13 10:45:35,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:35,397 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-10-13 10:45:35,398 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-10-13 10:45:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:35,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:45:35,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:35,502 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-10-13 10:45:35,660 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-13 10:45:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 10:45:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:35,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:40,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137988794] [2024-10-13 10:45:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137988794] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:45:40,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-10-13 10:45:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14240681] [2024-10-13 10:45:40,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:40,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:45:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:40,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:45:40,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:45:40,340 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:40,854 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2024-10-13 10:45:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:45:40,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-10-13 10:45:40,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:40,856 INFO L225 Difference]: With dead ends: 103 [2024-10-13 10:45:40,856 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 10:45:40,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:45:40,858 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:40,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 301 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:45:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 10:45:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-10-13 10:45:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 76 states have internal predecessors, (87), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-13 10:45:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2024-10-13 10:45:40,872 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 16 [2024-10-13 10:45:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2024-10-13 10:45:40,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2024-10-13 10:45:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:40,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:40,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:40,879 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 (5)] Ended with exit code 0 [2024-10-13 10:45:41,077 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-10-13 10:45:41,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:41,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:41,078 INFO L85 PathProgramCache]: Analyzing trace with hash -826532238, now seen corresponding path program 1 times [2024-10-13 10:45:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066895843] [2024-10-13 10:45:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:41,079 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-10-13 10:45:41,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:41,080 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-10-13 10:45:41,082 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-10-13 10:45:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:41,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:45:41,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:41,155 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-10-13 10:45:41,161 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-10-13 10:45:41,314 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-13 10:45:41,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:41,353 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-10-13 10:45:41,367 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:41,368 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-10-13 10:45:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:45:41,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:41,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066895843] [2024-10-13 10:45:41,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066895843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408859507] [2024-10-13 10:45:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:41,613 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:41,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:41,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:41,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 10:45:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:41,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:45:41,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:41,729 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-10-13 10:45:41,738 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-10-13 10:45:41,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:41,841 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-10-13 10:45:41,854 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:41,854 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-10-13 10:45:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:45:41,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [408859507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:46,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:46,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 10:45:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848688136] [2024-10-13 10:45:46,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:46,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:45:46,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:46,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:45:46,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-13 10:45:46,019 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:45:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:46,806 INFO L93 Difference]: Finished difference Result 182 states and 213 transitions. [2024-10-13 10:45:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:45:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-13 10:45:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:46,808 INFO L225 Difference]: With dead ends: 182 [2024-10-13 10:45:46,808 INFO L226 Difference]: Without dead ends: 182 [2024-10-13 10:45:46,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-10-13 10:45:46,809 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 98 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:46,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 441 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 481 Invalid, 0 Unknown, 206 Unchecked, 0.7s Time] [2024-10-13 10:45:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-13 10:45:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 123. [2024-10-13 10:45:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.7654320987654322) internal successors, (143), 105 states have internal predecessors, (143), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 15 states have call predecessors, (20), 12 states have call successors, (20) [2024-10-13 10:45:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-10-13 10:45:46,821 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 16 [2024-10-13 10:45:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:46,821 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-10-13 10:45:46,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:45:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-10-13 10:45:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:45:46,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:46,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:46,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-13 10:45:47,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 (6)] Ended with exit code 0 [2024-10-13 10:45:47,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-13 10:45:47,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:47,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1119935246, now seen corresponding path program 1 times [2024-10-13 10:45:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:47,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091232879] [2024-10-13 10:45:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:47,225 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-10-13 10:45:47,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:47,226 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-10-13 10:45:47,227 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-10-13 10:45:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:47,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:45:47,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:47,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:47,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:47,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091232879] [2024-10-13 10:45:47,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091232879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:47,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:47,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929032691] [2024-10-13 10:45:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:47,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:47,331 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:45:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:47,408 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2024-10-13 10:45:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-13 10:45:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:47,409 INFO L225 Difference]: With dead ends: 108 [2024-10-13 10:45:47,410 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 10:45:47,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:47,411 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:47,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:45:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 10:45:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 10:45:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 92 states have internal predecessors, (121), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-13 10:45:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 143 transitions. [2024-10-13 10:45:47,425 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 143 transitions. Word has length 16 [2024-10-13 10:45:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:47,426 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 143 transitions. [2024-10-13 10:45:47,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:45:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2024-10-13 10:45:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:45:47,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:47,426 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:47,433 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-10-13 10:45:47,632 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-10-13 10:45:47,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:47,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1034808519, now seen corresponding path program 1 times [2024-10-13 10:45:47,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:47,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417201495] [2024-10-13 10:45:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:47,634 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-10-13 10:45:47,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:47,635 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-10-13 10:45:47,636 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-10-13 10:45:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:47,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:45:47,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:45:47,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:47,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417201495] [2024-10-13 10:45:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417201495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:45:47,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-13 10:45:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049453829] [2024-10-13 10:45:47,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:47,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:45:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:45:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:45:47,964 INFO L87 Difference]: Start difference. First operand 106 states and 143 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:48,222 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2024-10-13 10:45:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:45:48,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-10-13 10:45:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:48,228 INFO L225 Difference]: With dead ends: 109 [2024-10-13 10:45:48,229 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 10:45:48,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:45:48,229 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 157 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:48,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 212 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:45:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 10:45:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-13 10:45:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.704225352112676) internal successors, (121), 92 states have internal predecessors, (121), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-13 10:45:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2024-10-13 10:45:48,240 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 17 [2024-10-13 10:45:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:48,241 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2024-10-13 10:45:48,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2024-10-13 10:45:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:45:48,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:48,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:48,246 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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:45:48,442 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-10-13 10:45:48,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:48,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1294529984, now seen corresponding path program 1 times [2024-10-13 10:45:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167240036] [2024-10-13 10:45:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:48,444 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-10-13 10:45:48,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:48,446 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-10-13 10:45:48,447 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-10-13 10:45:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:48,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 10:45:48,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:48,641 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_22| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_22|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_22| (_ bv0 1))))) is different from true [2024-10-13 10:45:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:48,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:48,722 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-13 10:45:48,723 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 43 treesize of output 38 [2024-10-13 10:45:52,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:52,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167240036] [2024-10-13 10:45:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167240036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:52,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1294683938] [2024-10-13 10:45:52,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:52,923 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:52,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:52,926 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:52,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-13 10:45:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:53,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:45:53,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:53,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:53,275 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-13 10:45:53,276 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 43 treesize of output 38 [2024-10-13 10:45:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1294683938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:53,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-10-13 10:45:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139344615] [2024-10-13 10:45:53,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:45:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:45:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=86, Unknown=2, NotChecked=18, Total=132 [2024-10-13 10:45:53,414 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:53,903 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2024-10-13 10:45:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:45:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2024-10-13 10:45:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:53,906 INFO L225 Difference]: With dead ends: 156 [2024-10-13 10:45:53,906 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 10:45:53,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=26, Invalid=86, Unknown=2, NotChecked=18, Total=132 [2024-10-13 10:45:53,907 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 48 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:53,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 440 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 387 Invalid, 0 Unknown, 143 Unchecked, 0.5s Time] [2024-10-13 10:45:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 10:45:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2024-10-13 10:45:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 88 states have internal predecessors, (115), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-13 10:45:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2024-10-13 10:45:53,923 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 20 [2024-10-13 10:45:53,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:53,923 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2024-10-13 10:45:53,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:45:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2024-10-13 10:45:53,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:45:53,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:53,924 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:53,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-13 10:45:54,128 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-10-13 10:45:54,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-13 10:45:54,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:54,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1421459932, now seen corresponding path program 1 times [2024-10-13 10:45:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:54,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535316160] [2024-10-13 10:45:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:54,328 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-10-13 10:45:54,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:54,329 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-10-13 10:45:54,330 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-10-13 10:45:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:54,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:45:54,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:54,401 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-10-13 10:45:54,450 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-13 10:45:54,468 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:45:54,468 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-10-13 10:45:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-10-13 10:45:54,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:54,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535316160] [2024-10-13 10:45:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535316160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:45:54,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-10-13 10:45:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203112954] [2024-10-13 10:45:54,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:54,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:45:54,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:54,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:45:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-10-13 10:45:54,641 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:45:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:54,944 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2024-10-13 10:45:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:45:54,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-13 10:45:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:54,946 INFO L225 Difference]: With dead ends: 127 [2024-10-13 10:45:54,946 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 10:45:54,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-10-13 10:45:54,947 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 46 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:54,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 224 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 207 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2024-10-13 10:45:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 10:45:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2024-10-13 10:45:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.705128205128205) internal successors, (133), 98 states have internal predecessors, (133), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2024-10-13 10:45:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2024-10-13 10:45:54,954 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 24 [2024-10-13 10:45:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2024-10-13 10:45:54,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:45:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2024-10-13 10:45:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:45:54,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:54,955 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:54,960 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 (12)] Ended with exit code 0 [2024-10-13 10:45:55,156 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-10-13 10:45:55,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:55,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1421459933, now seen corresponding path program 1 times [2024-10-13 10:45:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164756146] [2024-10-13 10:45:55,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:55,157 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-10-13 10:45:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:55,158 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-10-13 10:45:55,159 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-10-13 10:45:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:55,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:45:55,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:55,240 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-10-13 10:45:55,347 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-10-13 10:45:55,371 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:45:55,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 10:45:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 10:45:55,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:55,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164756146] [2024-10-13 10:45:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164756146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1106561078] [2024-10-13 10:45:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:45:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:45:55,538 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:45:55,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-13 10:45:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:55,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 10:45:55,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:55,670 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-10-13 10:45:55,678 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-10-13 10:45:55,856 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-13 10:45:55,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:55,879 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-10-13 10:45:55,894 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:55,894 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-10-13 10:45:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-13 10:45:55,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:45:56,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1106561078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:45:56,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:45:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-13 10:45:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087469996] [2024-10-13 10:45:56,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:45:56,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:45:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:45:56,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2024-10-13 10:45:56,076 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:45:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:56,766 INFO L93 Difference]: Finished difference Result 199 states and 269 transitions. [2024-10-13 10:45:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:45:56,767 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 24 [2024-10-13 10:45:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:56,768 INFO L225 Difference]: With dead ends: 199 [2024-10-13 10:45:56,768 INFO L226 Difference]: Without dead ends: 199 [2024-10-13 10:45:56,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=225, Unknown=2, NotChecked=62, Total=342 [2024-10-13 10:45:56,769 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:56,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 758 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 582 Invalid, 0 Unknown, 334 Unchecked, 0.6s Time] [2024-10-13 10:45:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-13 10:45:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 157. [2024-10-13 10:45:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.736842105263158) internal successors, (198), 134 states have internal predecessors, (198), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2024-10-13 10:45:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2024-10-13 10:45:56,777 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 24 [2024-10-13 10:45:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:56,777 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2024-10-13 10:45:56,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-13 10:45:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2024-10-13 10:45:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:45:56,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:56,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:56,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-10-13 10:45:56,982 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-10-13 10:45:57,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-13 10:45:57,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:57,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash 915901307, now seen corresponding path program 1 times [2024-10-13 10:45:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292902803] [2024-10-13 10:45:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:57,180 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-10-13 10:45:57,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:57,183 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-10-13 10:45:57,184 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-10-13 10:45:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:57,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:45:57,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:45:57,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:57,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292902803] [2024-10-13 10:45:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292902803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997411444] [2024-10-13 10:45:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:57,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:45:57,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:57,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:45:57,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:57,293 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:57,366 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2024-10-13 10:45:57,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:45:57,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-13 10:45:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:57,367 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:45:57,367 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 10:45:57,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:45:57,368 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:57,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:45:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 10:45:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 10:45:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 88 states have internal predecessors, (113), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:45:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2024-10-13 10:45:57,376 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 24 [2024-10-13 10:45:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2024-10-13 10:45:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2024-10-13 10:45:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:45:57,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:57,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:57,383 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 (15)] Forceful destruction successful, exit code 0 [2024-10-13 10:45:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-13 10:45:57,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1115588132, now seen corresponding path program 1 times [2024-10-13 10:45:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337375536] [2024-10-13 10:45:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:57,581 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-10-13 10:45:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:57,582 INFO L229 MonitoredProcess]: Starting monitored process 16 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-10-13 10:45:57,583 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 (16)] Waiting until timeout for monitored process [2024-10-13 10:45:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:57,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:45:57,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:57,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:45:57,710 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-13 10:45:57,730 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:45:57,730 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-10-13 10:45:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:45:57,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:45:57,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:45:57,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337375536] [2024-10-13 10:45:57,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337375536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:45:57,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:45:57,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:45:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915573712] [2024-10-13 10:45:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:45:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:45:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:45:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:45:57,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-10-13 10:45:57,756 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:45:57,901 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2024-10-13 10:45:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:45:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-13 10:45:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:45:57,903 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:45:57,903 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:45:57,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-10-13 10:45:57,904 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:45:57,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 212 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2024-10-13 10:45:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:45:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 101. [2024-10-13 10:45:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.608695652173913) internal successors, (111), 87 states have internal predecessors, (111), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:45:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 132 transitions. [2024-10-13 10:45:57,908 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 132 transitions. Word has length 25 [2024-10-13 10:45:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:45:57,908 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 132 transitions. [2024-10-13 10:45:57,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-13 10:45:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 132 transitions. [2024-10-13 10:45:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:45:57,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:45:57,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:45:57,914 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 (16)] Ended with exit code 0 [2024-10-13 10:45:58,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-10-13 10:45:58,113 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:45:58,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:45:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1115588133, now seen corresponding path program 1 times [2024-10-13 10:45:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:45:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636414380] [2024-10-13 10:45:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:45:58,114 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-10-13 10:45:58,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:45:58,116 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-10-13 10:45:58,117 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-10-13 10:45:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:45:58,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:45:58,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:45:58,202 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-10-13 10:45:58,208 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-10-13 10:45:58,304 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-13 10:45:58,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:58,327 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-10-13 10:45:58,340 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:58,341 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-10-13 10:45:58,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:45:58,444 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-10-13 10:45:58,456 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:45:58,456 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-10-13 10:45:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-13 10:45:58,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:02,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:46:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636414380] [2024-10-13 10:46:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636414380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1900384985] [2024-10-13 10:46:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:46:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:46:02,768 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:46:02,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-13 10:46:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:02,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 10:46:02,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:02,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 5 [2024-10-13 10:46:02,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 6 treesize of output 7 [2024-10-13 10:46:03,032 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:46:03,033 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-10-13 10:46:03,043 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-10-13 10:46:03,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:46:03,145 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-10-13 10:46:03,158 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:46:03,158 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-10-13 10:46:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-10-13 10:46:03,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1900384985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:05,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:46:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2024-10-13 10:46:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152479750] [2024-10-13 10:46:05,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:46:05,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:46:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:46:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:46:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=150, Unknown=2, NotChecked=24, Total=210 [2024-10-13 10:46:05,654 INFO L87 Difference]: Start difference. First operand 101 states and 132 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:46:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:46:06,319 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2024-10-13 10:46:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:46:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-10-13 10:46:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:46:06,321 INFO L225 Difference]: With dead ends: 155 [2024-10-13 10:46:06,321 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 10:46:06,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=57, Invalid=251, Unknown=2, NotChecked=32, Total=342 [2024-10-13 10:46:06,322 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 102 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:46:06,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 640 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 531 Invalid, 0 Unknown, 170 Unchecked, 0.5s Time] [2024-10-13 10:46:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 10:46:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 100. [2024-10-13 10:46:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.5797101449275361) internal successors, (109), 86 states have internal predecessors, (109), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:46:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2024-10-13 10:46:06,326 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 25 [2024-10-13 10:46:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:46:06,327 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2024-10-13 10:46:06,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:46:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2024-10-13 10:46:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:46:06,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:46:06,328 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:46:06,334 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 (17)] Ended with exit code 0 [2024-10-13 10:46:06,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-10-13 10:46:06,729 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 10:46:06,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:46:06,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:46:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1115584869, now seen corresponding path program 1 times [2024-10-13 10:46:06,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:46:06,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790676329] [2024-10-13 10:46:06,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:06,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:46:06,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:46:06,733 INFO L229 MonitoredProcess]: Starting monitored process 19 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-10-13 10:46:06,734 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 (19)] Waiting until timeout for monitored process [2024-10-13 10:46:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:06,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:46:06,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:46:06,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:46:06,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:46:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790676329] [2024-10-13 10:46:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790676329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:46:06,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:46:06,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:46:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031909447] [2024-10-13 10:46:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:46:06,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:46:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:46:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:46:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:46:06,819 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:46:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:46:06,899 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2024-10-13 10:46:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:46:06,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-13 10:46:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:46:06,901 INFO L225 Difference]: With dead ends: 127 [2024-10-13 10:46:06,902 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 10:46:06,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:46:06,903 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 30 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:46:06,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 274 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:46:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 10:46:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 100. [2024-10-13 10:46:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.565217391304348) internal successors, (108), 86 states have internal predecessors, (108), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:46:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2024-10-13 10:46:06,908 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 25 [2024-10-13 10:46:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:46:06,908 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2024-10-13 10:46:06,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:46:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2024-10-13 10:46:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:46:06,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:46:06,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:46:06,916 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 (19)] Ended with exit code 0 [2024-10-13 10:46:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-10-13 10:46:07,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:46:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:46:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2003088550, now seen corresponding path program 1 times [2024-10-13 10:46:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:46:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813617412] [2024-10-13 10:46:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:07,113 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-10-13 10:46:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:46:07,114 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-10-13 10:46:07,115 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-10-13 10:46:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:07,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:46:07,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:46:07,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:46:07,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:46:07,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813617412] [2024-10-13 10:46:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813617412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:46:07,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:46:07,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-13 10:46:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857358144] [2024-10-13 10:46:07,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:46:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:46:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:46:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:46:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:46:07,628 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:46:08,008 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2024-10-13 10:46:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:46:08,009 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), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2024-10-13 10:46:08,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:46:08,009 INFO L225 Difference]: With dead ends: 99 [2024-10-13 10:46:08,010 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 10:46:08,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:46:08,010 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 130 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:46:08,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 243 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:46:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 10:46:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 10:46:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 85 states have internal predecessors, (105), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:46:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2024-10-13 10:46:08,014 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 25 [2024-10-13 10:46:08,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:46:08,014 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2024-10-13 10:46:08,014 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), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2024-10-13 10:46:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:46:08,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:46:08,015 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:46:08,020 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 (20)] Ended with exit code 0 [2024-10-13 10:46:08,215 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 [2024-10-13 10:46:08,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:46:08,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:46:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash 223496711, now seen corresponding path program 1 times [2024-10-13 10:46:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:46:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266550791] [2024-10-13 10:46:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:08,216 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-10-13 10:46:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:46:08,217 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10-13 10:46:08,218 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 (21)] Waiting until timeout for monitored process [2024-10-13 10:46:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:08,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:46:08,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:08,344 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-10-13 10:46:08,364 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-10-13 10:46:08,474 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-13 10:46:08,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-10-13 10:46:08,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:46:08,529 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-10-13 10:46:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 10:46:08,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:08,677 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-10-13 10:46:08,678 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 69 treesize of output 68 [2024-10-13 10:46:08,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:46:08,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266550791] [2024-10-13 10:46:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266550791] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:08,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [745435364] [2024-10-13 10:46:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:08,728 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:46:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:46:08,729 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:46:08,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-10-13 10:46:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:08,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:46:08,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:08,855 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-10-13 10:46:08,996 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:46:08,996 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-10-13 10:46:09,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:13,106 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|))) is different from true [2024-10-13 10:46:13,184 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:46:13,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-10-13 10:46:13,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-13 10:46:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-13 10:46:13,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:13,252 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2024-10-13 10:46:13,252 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 23 treesize of output 22 [2024-10-13 10:46:13,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_251 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_251) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) is different from false [2024-10-13 10:46:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [745435364] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:13,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:46:13,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-10-13 10:46:13,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399623206] [2024-10-13 10:46:13,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:46:13,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:46:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:46:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:46:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=575, Unknown=2, NotChecked=98, Total=756 [2024-10-13 10:46:13,277 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 18 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:46:26,573 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2024-10-13 10:46:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 10:46:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 18 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-10-13 10:46:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:46:26,574 INFO L225 Difference]: With dead ends: 136 [2024-10-13 10:46:26,575 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 10:46:26,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=255, Invalid=1470, Unknown=5, NotChecked=162, Total=1892 [2024-10-13 10:46:26,576 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 188 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:46:26,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 842 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 829 Invalid, 0 Unknown, 125 Unchecked, 0.8s Time] [2024-10-13 10:46:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 10:46:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 76. [2024-10-13 10:46:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-13 10:46:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-10-13 10:46:26,579 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2024-10-13 10:46:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:46:26,580 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-10-13 10:46:26,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 18 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-10-13 10:46:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:46:26,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:46:26,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:46:26,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2024-10-13 10:46:26,785 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 (21)] Forceful destruction successful, exit code 0 [2024-10-13 10:46:26,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /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-10-13 10:46:26,982 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:46:26,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:46:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 223496712, now seen corresponding path program 1 times [2024-10-13 10:46:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:46:26,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954121517] [2024-10-13 10:46:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:26,983 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-10-13 10:46:26,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:46:26,984 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-10-13 10:46:26,985 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-10-13 10:46:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:27,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 10:46:27,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:27,067 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-10-13 10:46:27,118 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:46:27,118 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-10-13 10:46:27,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:27,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:27,299 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:46:27,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 10:46:27,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-13 10:46:27,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:46:27,352 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-10-13 10:46:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:46:27,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:27,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:46:27,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 50 treesize of output 54 [2024-10-13 10:46:27,539 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_274) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_8) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset|))) (or (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_8) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_273) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))))) is different from false [2024-10-13 10:46:27,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:46:27,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954121517] [2024-10-13 10:46:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954121517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1458552965] [2024-10-13 10:46:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:46:27,604 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:46:27,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:46:27,606 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:46:27,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-13 10:46:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:46:27,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 10:46:27,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:46:27,807 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-10-13 10:46:27,961 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-10-13 10:46:32,049 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 10:46:32,050 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-10-13 10:46:32,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:32,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:46:32,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-13 10:46:32,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 11 [2024-10-13 10:46:32,436 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)))))) is different from true [2024-10-13 10:46:32,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:46:32,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:46:32,496 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-13 10:46:32,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-13 10:46:32,656 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-10-13 10:46:32,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 60 [2024-10-13 10:46:32,684 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2024-10-13 10:46:32,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 31 treesize of output 29 [2024-10-13 10:46:32,700 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 6 treesize of output 4 [2024-10-13 10:46:32,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:46:32,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:46:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-13 10:46:32,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:46:32,831 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_299) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_300 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_299) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_300) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))))) is different from false [2024-10-13 10:46:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1458552965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:46:33,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:46:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2024-10-13 10:46:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601539038] [2024-10-13 10:46:33,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:46:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:46:33,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:46:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:46:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=660, Unknown=18, NotChecked=162, Total=930 [2024-10-13 10:46:33,290 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:46:37,314 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 [0] [2024-10-13 10:46:41,334 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 [0] [2024-10-13 10:46:45,394 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 [0] [2024-10-13 10:46:50,134 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 [0] [2024-10-13 10:46:54,253 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 [0] [2024-10-13 10:46:58,261 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 [0] [2024-10-13 10:47:02,774 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 [0] [2024-10-13 10:47:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:47:02,850 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-10-13 10:47:02,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:47:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-10-13 10:47:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:47:02,852 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:47:02,852 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 10:47:02,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=166, Invalid=1017, Unknown=19, NotChecked=204, Total=1406 [2024-10-13 10:47:02,853 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 155 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 32 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:47:02,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 485 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 752 Invalid, 7 Unknown, 102 Unchecked, 29.2s Time] [2024-10-13 10:47:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 10:47:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2024-10-13 10:47:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 68 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-13 10:47:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-10-13 10:47:02,857 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 26 [2024-10-13 10:47:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:47:02,857 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-10-13 10:47:02,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 22 states have internal predecessors, (38), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-13 10:47:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-10-13 10:47:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:47:02,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:47:02,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:47:02,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2024-10-13 10:47:03,065 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 (23)] Forceful destruction successful, exit code 0