./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 07:48:43,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:48:43,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:48:43,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:48:43,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:48:43,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:48:43,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:48:43,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:48:43,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:48:43,605 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:48:43,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:48:43,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:48:43,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:48:43,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:48:43,608 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:48:43,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:48:43,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:48:43,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:48:43,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:48:43,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:48:43,609 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:48:43,611 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:48:43,612 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:48:43,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:48:43,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:48:43,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:48:43,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:48:43,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:48:43,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:48:43,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:48:43,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:48:43,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:48:43,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:48:43,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:43,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:48:43,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:48:43,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:48:43,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:48:43,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:48:43,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:48:43,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:48:43,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:48:43,616 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-11-09 07:48:43,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:48:43,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:48:43,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:48:43,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:48:43,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:48:43,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-11-09 07:48:45,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:48:45,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:48:45,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-11-09 07:48:45,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54839afaa/bc38d9b15e2e4700b64faf1896c4edfd/FLAG25fb7c2cd [2024-11-09 07:48:45,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54839afaa/bc38d9b15e2e4700b64faf1896c4edfd [2024-11-09 07:48:45,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:48:45,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:48:45,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:45,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:48:45,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:48:45,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:45" (1/1) ... [2024-11-09 07:48:45,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aee1bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:45, skipping insertion in model container [2024-11-09 07:48:45,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:45" (1/1) ... [2024-11-09 07:48:45,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:48:46,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:46,239 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:46,241 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:46,242 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:46,244 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:46,245 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:46,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:46,267 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 07:48:46,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@13cde937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:46, skipping insertion in model container [2024-11-09 07:48:46,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:46,269 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:48:46,270 INFO L158 Benchmark]: Toolchain (without parser) took 378.01ms. Allocated memory is still 151.0MB. Free memory was 79.8MB in the beginning and 63.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,271 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 115.1MB in the end (delta: 275.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:48:46,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.16ms. Allocated memory is still 151.0MB. Free memory was 79.3MB in the beginning and 63.0MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:48:46,274 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.10ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 115.1MB in the end (delta: 275.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.16ms. Allocated memory is still 151.0MB. Free memory was 79.3MB in the beginning and 63.0MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 07:48:48,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:48:48,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:48:48,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:48:48,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:48:48,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:48:48,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:48:48,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:48:48,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:48:48,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:48:48,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:48:48,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:48:48,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:48:48,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:48:48,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:48:48,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:48:48,668 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:48:48,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:48:48,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:48:48,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:48:48,669 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:48:48,671 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:48:48,671 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:48:48,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:48:48,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:48:48,673 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:48:48,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:48:48,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:48:48,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:48:48,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:48:48,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:48:48,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:48:48,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:48:48,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:48:48,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:48:48,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:48,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:48:48,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:48:48,675 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:48:48,675 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:48:48,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:48:48,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:48:48,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:48:48,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:48:48,677 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-11-09 07:48:48,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:48:48,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:48:48,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:48:48,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:48:48,938 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:48:48,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-11-09 07:48:50,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:48:50,752 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:48:50,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11.i [2024-11-09 07:48:50,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9abcec8bd/0ff5deab1e6d4750a0c4f9d95f5704a3/FLAGc0a6c2b38 [2024-11-09 07:48:50,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9abcec8bd/0ff5deab1e6d4750a0c4f9d95f5704a3 [2024-11-09 07:48:50,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:48:50,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:48:50,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:50,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:48:50,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:48:50,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:50" (1/1) ... [2024-11-09 07:48:50,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321b2b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:50, skipping insertion in model container [2024-11-09 07:48:50,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:48:50" (1/1) ... [2024-11-09 07:48:50,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:48:51,141 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,189 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,194 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,194 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,195 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:51,213 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:48:51,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:48:51,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,249 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,254 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,255 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,255 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,255 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:48:51,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:51,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:48:51,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:48:51,361 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:48:51,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51 WrapperNode [2024-11-09 07:48:51,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:48:51,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:51,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:48:51,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:48:51,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,405 INFO L138 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 93 [2024-11-09 07:48:51,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:48:51,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:48:51,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:48:51,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:48:51,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,447 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-11-09 07:48:51,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:48:51,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:48:51,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:48:51,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:48:51,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (1/1) ... [2024-11-09 07:48:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:48:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:48:51,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:48:51,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:48:51,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 07:48:51,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 07:48:51,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2024-11-09 07:48:51,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2024-11-09 07:48:51,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:48:51,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:48:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:48:51,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:48:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:48:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:48:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:48:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 07:48:51,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 07:48:51,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:48:51,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:48:51,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:48:51,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:48:52,043 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-09 07:48:52,043 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:48:52,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:48:52,059 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:48:52,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:52 BoogieIcfgContainer [2024-11-09 07:48:52,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:48:52,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:48:52,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:48:52,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:48:52,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:48:50" (1/3) ... [2024-11-09 07:48:52,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6614b323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:52, skipping insertion in model container [2024-11-09 07:48:52,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:48:51" (2/3) ... [2024-11-09 07:48:52,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6614b323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:48:52, skipping insertion in model container [2024-11-09 07:48:52,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:48:52" (3/3) ... [2024-11-09 07:48:52,067 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11.i [2024-11-09 07:48:52,092 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:48:52,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-11-09 07:48:52,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:48:52,143 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;@42f86282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:48:52,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-09 07:48:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:48:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:48:52,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:52,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:52,155 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-11-09 07:48:52,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1738627509, now seen corresponding path program 1 times [2024-11-09 07:48:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:52,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52992028] [2024-11-09 07:48:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:52,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:52,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:52,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:52,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 07:48:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:52,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:48:52,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:52,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:52,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52992028] [2024-11-09 07:48:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52992028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:48:52,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851835508] [2024-11-09 07:48:52,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:52,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:52,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:52,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:52,364 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 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.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:52,473 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2024-11-09 07:48:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:52,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-09 07:48:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:52,486 INFO L225 Difference]: With dead ends: 149 [2024-11-09 07:48:52,486 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:48:52,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-11-09 07:48:52,491 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 59 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:52,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 325 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:48:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 87. [2024-11-09 07:48:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 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-11-09 07:48:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2024-11-09 07:48:52,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 11 [2024-11-09 07:48:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-09 07:48:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2024-11-09 07:48:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:48:52,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:52,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:52,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 07:48:52,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:52,745 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-11-09 07:48:52,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash -851123828, now seen corresponding path program 1 times [2024-11-09 07:48:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:52,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623239969] [2024-11-09 07:48:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:52,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:52,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:52,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:52,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:48:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:52,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:48:52,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:52,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:52,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623239969] [2024-11-09 07:48:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623239969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:48:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399551766] [2024-11-09 07:48:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:52,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:48:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:48:52,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:52,834 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:53,174 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2024-11-09 07:48:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:48:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-09 07:48:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:53,176 INFO L225 Difference]: With dead ends: 153 [2024-11-09 07:48:53,176 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 07:48:53,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:48:53,177 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 66 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:53,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 300 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:48:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 07:48:53,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2024-11-09 07:48:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:48:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2024-11-09 07:48:53,188 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 11 [2024-11-09 07:48:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:53,188 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2024-11-09 07:48:53,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:48:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2024-11-09 07:48:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:48:53,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:53,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:53,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 07:48:53,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,392 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-11-09 07:48:53,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash -470294884, now seen corresponding path program 1 times [2024-11-09 07:48:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951269512] [2024-11-09 07:48:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:53,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:53,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:53,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:48:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:53,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:48:53,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:48:53,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:53,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951269512] [2024-11-09 07:48:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951269512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:48:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234688085] [2024-11-09 07:48:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:53,487 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-11-09 07:48:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:53,542 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2024-11-09 07:48:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:53,543 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), 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 17 [2024-11-09 07:48:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:53,544 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:48:53,546 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:48:53,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11-09 07:48:53,547 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 50 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:53,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 387 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:48:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2024-11-09 07:48:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 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-11-09 07:48:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-09 07:48:53,567 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 17 [2024-11-09 07:48:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:53,568 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-09 07:48:53,568 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), 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-11-09 07:48:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-09 07:48:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:48:53,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:53,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:53,572 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-11-09 07:48:53,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,770 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-11-09 07:48:53,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash -470294895, now seen corresponding path program 1 times [2024-11-09 07:48:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:53,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073798460] [2024-11-09 07:48:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:53,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:53,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:53,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:53,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:48:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:53,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:48:53,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:53,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:48:53,887 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-09 07:48:53,924 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 07:48:53,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:48:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:48:53,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:54,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073798460] [2024-11-09 07:48:54,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073798460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:54,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:54,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-09 07:48:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037546594] [2024-11-09 07:48:54,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:54,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:48:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:48:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:48:54,081 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-11-09 07:48:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:54,302 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-09 07:48:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:48:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 17 [2024-11-09 07:48:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:54,303 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:48:54,303 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:48:54,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-11-09 07:48:54,304 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 68 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:54,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 200 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 218 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2024-11-09 07:48:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:48:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2024-11-09 07:48:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 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-11-09 07:48:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2024-11-09 07:48:54,310 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 17 [2024-11-09 07:48:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:54,310 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2024-11-09 07:48:54,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-11-09 07:48:54,311 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2024-11-09 07:48:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:48:54,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:54,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:54,319 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-11-09 07:48:54,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:54,513 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-11-09 07:48:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash -470294894, now seen corresponding path program 1 times [2024-11-09 07:48:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:54,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036500074] [2024-11-09 07:48:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:54,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:54,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:54,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:54,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:48:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:54,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:48:54,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:54,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:48:54,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:48:54,670 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-11-09 07:48:54,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:54,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:54,700 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:48:54,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:48:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:48:54,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:54,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:54,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036500074] [2024-11-09 07:48:54,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036500074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:54,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1616253124] [2024-11-09 07:48:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:54,854 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:48:54,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:48:54,856 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-11-09 07:48:54,857 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-11-09 07:48:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:54,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:48:54,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:54,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:48:54,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:48:55,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:48:55,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:48:55,034 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:48:55,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:48:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:48:55,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:55,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1616253124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:55,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:55,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-09 07:48:55,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229598220] [2024-11-09 07:48:55,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:55,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:48:55,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:55,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:48:55,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-09 07:48:55,137 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:55,694 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2024-11-09 07:48:55,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:48:55,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 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 17 [2024-11-09 07:48:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:55,697 INFO L225 Difference]: With dead ends: 203 [2024-11-09 07:48:55,697 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 07:48:55,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-09 07:48:55,698 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 112 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:55,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 622 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 545 Invalid, 0 Unknown, 227 Unchecked, 0.5s Time] [2024-11-09 07:48:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 07:48:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 141. [2024-11-09 07:48:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 123 states have internal predecessors, (161), 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-11-09 07:48:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 193 transitions. [2024-11-09 07:48:55,705 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 193 transitions. Word has length 17 [2024-11-09 07:48:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:55,705 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 193 transitions. [2024-11-09 07:48:55,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 193 transitions. [2024-11-09 07:48:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:48:55,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:55,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:55,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-09 07:48:55,911 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:48:56,108 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-11-09 07:48:56,110 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-11-09 07:48:56,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash -763697902, now seen corresponding path program 1 times [2024-11-09 07:48:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:56,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023650151] [2024-11-09 07:48:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:56,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:56,113 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:56,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:48:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:56,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:48:56,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:56,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:48:56,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:56,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023650151] [2024-11-09 07:48:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023650151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:48:56,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:48:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:48:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060886154] [2024-11-09 07:48:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:48:56,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:48:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:48:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:48:56,179 INFO L87 Difference]: Start difference. First operand 141 states and 193 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:56,201 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2024-11-09 07:48:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:48:56,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2024-11-09 07:48:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:56,202 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:48:56,202 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:48:56,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11-09 07:48:56,203 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:56,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:48:56,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:48:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 07:48:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.619047619047619) internal successors, (136), 107 states have internal predecessors, (136), 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-11-09 07:48:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 158 transitions. [2024-11-09 07:48:56,208 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 158 transitions. Word has length 17 [2024-11-09 07:48:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:56,221 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 158 transitions. [2024-11-09 07:48:56,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:48:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2024-11-09 07:48:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:48:56,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:56,222 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:56,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 07:48:56,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:56,424 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-11-09 07:48:56,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash -806735705, now seen corresponding path program 1 times [2024-11-09 07:48:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:56,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335598364] [2024-11-09 07:48:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:56,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:56,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:48:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:56,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:48:56,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:48:56,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:48:56,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335598364] [2024-11-09 07:48:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335598364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:48:56,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:48:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-09 07:48:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236162465] [2024-11-09 07:48:56,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:48:56,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:48:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:48:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:48:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:48:56,825 INFO L87 Difference]: Start difference. First operand 121 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-11-09 07:48:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:48:56,992 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2024-11-09 07:48:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:48:56,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 18 [2024-11-09 07:48:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:48:56,993 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:48:56,993 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 07:48:56,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 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-11-09 07:48:56,994 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 65 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:48:56,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 279 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:48:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 07:48:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 07:48:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 107 states have internal predecessors, (136), 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-11-09 07:48:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2024-11-09 07:48:56,999 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 18 [2024-11-09 07:48:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:48:56,999 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2024-11-09 07:48:56,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-11-09 07:48:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2024-11-09 07:48:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:48:56,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:48:56,999 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:48:57,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 07:48:57,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:57,203 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-11-09 07:48:57,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:48:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1173731936, now seen corresponding path program 1 times [2024-11-09 07:48:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:48:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885455052] [2024-11-09 07:48:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:48:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:48:57,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:48:57,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:48:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:57,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:48:57,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:57,368 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_18| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_18|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_18| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-09 07:48:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:48:57,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:57,422 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-09 07:48:57,422 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-11-09 07:48:57,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:48:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885455052] [2024-11-09 07:48:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885455052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:48:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1815042787] [2024-11-09 07:48:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:48:57,501 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:48:57,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:48:57,503 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-11-09 07:48:57,504 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-11-09 07:48:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:48:57,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:48:57,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:48:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:48:57,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:48:57,794 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-09 07:48:57,794 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-11-09 07:49:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1815042787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:01,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:01,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-09 07:49:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191088119] [2024-11-09 07:49:01,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:01,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:49:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:49:01,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-09 07:49:01,928 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-11-09 07:49:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:02,474 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2024-11-09 07:49:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:49:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 21 [2024-11-09 07:49:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:02,476 INFO L225 Difference]: With dead ends: 177 [2024-11-09 07:49:02,476 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 07:49:02,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:49:02,477 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 184 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:02,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 512 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 452 Invalid, 0 Unknown, 158 Unchecked, 0.5s Time] [2024-11-09 07:49:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 07:49:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 117. [2024-11-09 07:49:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 103 states have internal predecessors, (130), 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-11-09 07:49:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2024-11-09 07:49:02,482 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 21 [2024-11-09 07:49:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:02,482 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2024-11-09 07:49:02,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-11-09 07:49:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2024-11-09 07:49:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:49:02,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:02,483 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-11-09 07:49:02,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-09 07:49:02,688 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:02,887 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-11-09 07:49:02,888 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-11-09 07:49:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash -624729604, now seen corresponding path program 1 times [2024-11-09 07:49:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550077586] [2024-11-09 07:49:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:02,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:02,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:02,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:02,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:49:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:02,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:49:02,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:02,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:03,023 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-11-09 07:49:03,040 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:49:03,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 07:49:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-11-09 07:49:03,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:03,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550077586] [2024-11-09 07:49:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550077586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:49:03,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-09 07:49:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358771649] [2024-11-09 07:49:03,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:03,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:49:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:49:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-09 07:49:03,163 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-11-09 07:49:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:03,379 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2024-11-09 07:49:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:03,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 25 [2024-11-09 07:49:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:03,382 INFO L225 Difference]: With dead ends: 142 [2024-11-09 07:49:03,382 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 07:49:03,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 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-11-09 07:49:03,384 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 49 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:03,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 299 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 258 Invalid, 0 Unknown, 112 Unchecked, 0.2s Time] [2024-11-09 07:49:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 07:49:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2024-11-09 07:49:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 113 states have internal predecessors, (148), 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-11-09 07:49:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2024-11-09 07:49:03,393 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 25 [2024-11-09 07:49:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:03,393 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2024-11-09 07:49:03,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-11-09 07:49:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2024-11-09 07:49:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:49:03,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:03,399 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-11-09 07:49:03,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:03,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:03,600 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-11-09 07:49:03,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash -624729603, now seen corresponding path program 1 times [2024-11-09 07:49:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:03,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288085591] [2024-11-09 07:49:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:03,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:03,602 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:03,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:49:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:03,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:49:03,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:03,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-11-09 07:49:03,745 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-11-09 07:49:03,763 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:49:03,764 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-11-09 07:49:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:49:03,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:03,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:03,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288085591] [2024-11-09 07:49:03,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288085591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:03,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [729105377] [2024-11-09 07:49:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:03,914 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:03,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:03,920 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-11-09 07:49:03,921 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-11-09 07:49:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:04,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:49:04,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:04,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:49:04,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:04,185 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-11-09 07:49:04,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:04,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:04,208 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:04,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-09 07:49:04,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [729105377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:04,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-09 07:49:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601714712] [2024-11-09 07:49:04,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:04,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:49:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:49:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2024-11-09 07:49:04,331 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 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-11-09 07:49:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:04,863 INFO L93 Difference]: Finished difference Result 229 states and 299 transitions. [2024-11-09 07:49:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:49:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 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 25 [2024-11-09 07:49:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:04,865 INFO L225 Difference]: With dead ends: 229 [2024-11-09 07:49:04,865 INFO L226 Difference]: Without dead ends: 229 [2024-11-09 07:49:04,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=224, Unknown=3, NotChecked=62, Total=342 [2024-11-09 07:49:04,865 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 116 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:04,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 716 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 511 Invalid, 0 Unknown, 370 Unchecked, 0.5s Time] [2024-11-09 07:49:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-09 07:49:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 184. [2024-11-09 07:49:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 161 states have internal predecessors, (225), 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-11-09 07:49:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2024-11-09 07:49:04,886 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 25 [2024-11-09 07:49:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:04,886 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2024-11-09 07:49:04,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 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-11-09 07:49:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2024-11-09 07:49:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:49:04,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:04,887 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-11-09 07:49:04,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-09 07:49:05,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:05,288 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-11-09 07:49:05,291 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-11-09 07:49:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1130288229, now seen corresponding path program 1 times [2024-11-09 07:49:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699577087] [2024-11-09 07:49:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:05,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:05,293 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:05,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 07:49:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:05,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:05,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:49:05,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:05,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:05,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699577087] [2024-11-09 07:49:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699577087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:05,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097650310] [2024-11-09 07:49:05,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:05,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:05,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:05,386 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-11-09 07:49:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:05,407 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2024-11-09 07:49:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:05,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2024-11-09 07:49:05,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:05,408 INFO L225 Difference]: With dead ends: 119 [2024-11-09 07:49:05,408 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:49:05,409 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-11-09 07:49:05,409 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:05,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:49:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 07:49:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 103 states have internal predecessors, (128), 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-11-09 07:49:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2024-11-09 07:49:05,412 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 25 [2024-11-09 07:49:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:05,413 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2024-11-09 07:49:05,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-11-09 07:49:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2024-11-09 07:49:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:49:05,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:05,413 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-11-09 07:49:05,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 07:49:05,616 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-11-09 07:49:05,617 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-09 07:49:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2108218693, now seen corresponding path program 1 times [2024-11-09 07:49:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949508915] [2024-11-09 07:49:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:05,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:05,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:05,620 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-11-09 07:49:05,621 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-11-09 07:49:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:05,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:49:05,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:49:05,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:05,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949508915] [2024-11-09 07:49:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949508915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155086225] [2024-11-09 07:49:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:05,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:49:05,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:49:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:49:05,685 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-11-09 07:49:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:05,714 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2024-11-09 07:49:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:49:05,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 26 [2024-11-09 07:49:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:05,715 INFO L225 Difference]: With dead ends: 149 [2024-11-09 07:49:05,715 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 07:49:05,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-11-09 07:49:05,715 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 38 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:05,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 301 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:49:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 07:49:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2024-11-09 07:49:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 103 states have internal predecessors, (127), 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-11-09 07:49:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-11-09 07:49:05,719 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 26 [2024-11-09 07:49:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:05,719 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-11-09 07:49:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-11-09 07:49:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-11-09 07:49:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:49:05,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:05,720 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] [2024-11-09 07:49:05,726 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:05,923 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-11-09 07:49:05,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-09 07:49:05,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1299244922, now seen corresponding path program 1 times [2024-11-09 07:49:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:05,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014890401] [2024-11-09 07:49:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:05,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:05,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:05,927 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:05,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 07:49:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:05,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:49:05,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:49:06,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:49:06,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014890401] [2024-11-09 07:49:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014890401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:49:06,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:06,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-09 07:49:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076795209] [2024-11-09 07:49:06,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:06,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:49:06,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:06,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:49:06,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:49:06,313 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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-11-09 07:49:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:06,441 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2024-11-09 07:49:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:49:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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 26 [2024-11-09 07:49:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:06,443 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:49:06,443 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:49:06,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 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-11-09 07:49:06,443 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 158 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:06,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:49:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:49:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 07:49:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 102 states have internal predecessors, (124), 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-11-09 07:49:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2024-11-09 07:49:06,447 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 26 [2024-11-09 07:49:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:06,447 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2024-11-09 07:49:06,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 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-11-09 07:49:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2024-11-09 07:49:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:49:06,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:06,448 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, 1] [2024-11-09 07:49:06,452 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-11-09 07:49:06,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:06,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-09 07:49:06,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash 930272189, now seen corresponding path program 1 times [2024-11-09 07:49:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:06,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460781892] [2024-11-09 07:49:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:06,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:06,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:06,652 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:06,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 07:49:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:06,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:49:06,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:06,750 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-11-09 07:49:06,775 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:49:06,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 07:49:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:49:06,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:49:06,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460781892] [2024-11-09 07:49:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460781892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:49:06,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:49:06,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:49:06,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969144622] [2024-11-09 07:49:06,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:49:06,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:49:06,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:06,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:49:06,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-09 07:49:06,812 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-11-09 07:49:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:06,958 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2024-11-09 07:49:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:49:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 27 [2024-11-09 07:49:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:06,960 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:49:06,960 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 07:49:06,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 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-11-09 07:49:06,961 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 61 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:06,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 236 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 139 Invalid, 0 Unknown, 136 Unchecked, 0.1s Time] [2024-11-09 07:49:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 07:49:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2024-11-09 07:49:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 101 states have internal predecessors, (122), 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-11-09 07:49:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2024-11-09 07:49:06,966 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 27 [2024-11-09 07:49:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:06,966 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2024-11-09 07:49:06,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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-11-09 07:49:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2024-11-09 07:49:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:49:06,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:06,967 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, 1] [2024-11-09 07:49:06,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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:07,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:07,168 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-09 07:49:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 930272190, now seen corresponding path program 1 times [2024-11-09 07:49:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035414516] [2024-11-09 07:49:07,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:07,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:07,172 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-11-09 07:49:07,173 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-11-09 07:49:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:07,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:49:07,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:07,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:49:07,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:07,398 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-11-09 07:49:07,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:07,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:07,428 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:07,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:07,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:07,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:07,497 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:07,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-09 07:49:07,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:11,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035414516] [2024-11-09 07:49:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035414516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [996468547] [2024-11-09 07:49:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:11,726 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:49:11,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-09 07:49:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:11,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:49:11,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:11,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:11,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:49:11,951 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:49:11,951 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 13 [2024-11-09 07:49:11,962 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:11,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:12,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:12,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:12,042 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:12,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-09 07:49:12,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:12,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [996468547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:12,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2024-11-09 07:49:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068524897] [2024-11-09 07:49:12,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:12,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:49:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:12,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:49:12,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=150, Unknown=2, NotChecked=24, Total=210 [2024-11-09 07:49:12,174 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-11-09 07:49:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:12,858 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2024-11-09 07:49:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:49:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 27 [2024-11-09 07:49:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:12,859 INFO L225 Difference]: With dead ends: 167 [2024-11-09 07:49:12,859 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 07:49:12,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=57, Invalid=251, Unknown=2, NotChecked=32, Total=342 [2024-11-09 07:49:12,860 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 108 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:12,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 660 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 634 Invalid, 0 Unknown, 184 Unchecked, 0.6s Time] [2024-11-09 07:49:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 07:49:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2024-11-09 07:49:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 100 states have internal predecessors, (120), 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-11-09 07:49:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2024-11-09 07:49:12,863 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 27 [2024-11-09 07:49:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:12,863 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2024-11-09 07:49:12,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-11-09 07:49:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2024-11-09 07:49:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:49:12,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:12,864 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, 1, 1, 1] [2024-11-09 07:49:12,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-09 07:49:13,068 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 (19)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:13,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-11-09 07:49:13,267 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-11-09 07:49:13,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash 638376382, now seen corresponding path program 1 times [2024-11-09 07:49:13,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:13,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780491864] [2024-11-09 07:49:13,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:13,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:13,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:13,269 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-11-09 07:49:13,271 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-11-09 07:49:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:13,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:49:13,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:13,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:49:13,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:13,513 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 07:49:13,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2024-11-09 07:49:13,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:49:13,607 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-11-09 07:49:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:49:13,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:13,785 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-11-09 07:49:13,785 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-11-09 07:49:13,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:13,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780491864] [2024-11-09 07:49:13,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780491864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:13,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2138600146] [2024-11-09 07:49:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:13,841 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:13,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:13,843 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-11-09 07:49:13,844 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-11-09 07:49:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:13,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:49:13,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:13,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:14,096 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:14,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:14,172 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-11-09 07:49:18,228 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-11-09 07:49:18,364 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:49:18,364 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-11-09 07:49:18,460 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-11-09 07:49:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 07:49:18,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:18,486 INFO L349 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2024-11-09 07:49:18,486 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-11-09 07:49:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2138600146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:18,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-09 07:49:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265349951] [2024-11-09 07:49:18,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:18,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:49:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:49:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=827, Unknown=10, NotChecked=58, Total=992 [2024-11-09 07:49:18,570 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 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-11-09 07:49:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:49:32,235 INFO L93 Difference]: Finished difference Result 154 states and 185 transitions. [2024-11-09 07:49:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:49:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 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 29 [2024-11-09 07:49:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:49:32,237 INFO L225 Difference]: With dead ends: 154 [2024-11-09 07:49:32,237 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 07:49:32,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=384, Invalid=2157, Unknown=13, NotChecked=98, Total=2652 [2024-11-09 07:49:32,238 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 258 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:49:32,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1155 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1111 Invalid, 0 Unknown, 140 Unchecked, 1.0s Time] [2024-11-09 07:49:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 07:49:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 85. [2024-11-09 07:49:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 73 states have internal predecessors, (79), 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-11-09 07:49:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-11-09 07:49:32,241 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 29 [2024-11-09 07:49:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:49:32,241 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-11-09 07:49:32,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 21 states have internal predecessors, (37), 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-11-09 07:49:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-11-09 07:49:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:49:32,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:49:32,242 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, 1, 1, 1] [2024-11-09 07:49:32,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-09 07:49:32,449 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 (21)] Ended with exit code 0 [2024-11-09 07:49:32,645 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-11-09 07:49:32,646 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-11-09 07:49:32,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:49:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash 638376383, now seen corresponding path program 1 times [2024-11-09 07:49:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:49:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402706940] [2024-11-09 07:49:32,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:32,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:49:32,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:49:32,651 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:49:32,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 07:49:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:32,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:49:32,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:32,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:32,779 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 07:49:32,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 07:49:32,819 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-11-09 07:49:32,829 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-11-09 07:49:33,005 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:49:33,005 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-11-09 07:49:33,014 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-11-09 07:49:33,078 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-11-09 07:49:33,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:49:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:49:33,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:33,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:49:33,371 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-11-09 07:49:33,437 WARN L851 $PredicateComparison]: unable to prove that (and (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_272 (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_272) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_271 (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_271) |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_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|)))) is different from false [2024-11-09 07:49:33,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:49:33,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402706940] [2024-11-09 07:49:33,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402706940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:33,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1235614759] [2024-11-09 07:49:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:49:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:49:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:49:33,495 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-11-09 07:49:33,496 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-11-09 07:49:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:49:33,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:49:33,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:49:33,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:49:33,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:49:37,920 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 07:49:37,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 07:49:38,058 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-11-09 07:49:38,064 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-11-09 07:49:38,129 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-11-09 07:49:38,133 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-11-09 07:49:38,218 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-11-09 07:49:38,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:49:38,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:49:38,274 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-09 07:49:38,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 07:49:38,463 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2024-11-09 07:49:38,463 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-11-09 07:49:38,489 INFO L349 Elim1Store]: treesize reduction 29, result has 31.0 percent of original size [2024-11-09 07:49:38,490 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-11-09 07:49:38,532 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-11-09 07:49:38,668 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-11-09 07:49:38,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:49:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:49:38,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:49:38,774 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (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_298) |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_297) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_298 (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_298) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-11-09 07:49:38,861 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_89| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_89|))) (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_301 (_ 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_298) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (select (store |c_#length| |v_ldv_malloc_#res.base_89| v_ArrVal_301) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_297) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))))) (or (forall ((v_ArrVal_298 (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_298) |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_ldv_malloc_#res.base_89| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_89|)))))) is different from false [2024-11-09 07:49:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1235614759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:49:38,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:49:38,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2024-11-09 07:49:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35700435] [2024-11-09 07:49:38,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:49:38,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:49:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:49:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:49:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=952, Unknown=5, NotChecked=260, Total=1332 [2024-11-09 07:49:38,866 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 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-11-09 07:49:42,910 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-11-09 07:49:46,921 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-11-09 07:49:51,009 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-11-09 07:49:55,784 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-11-09 07:50:00,214 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-11-09 07:50:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:50:00,294 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2024-11-09 07:50:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:50:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 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 29 [2024-11-09 07:50:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:50:00,295 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:50:00,295 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:50:00,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=223, Invalid=1428, Unknown=5, NotChecked=324, Total=1980 [2024-11-09 07:50:00,296 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 188 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 31 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:50:00,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 640 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 909 Invalid, 5 Unknown, 111 Unchecked, 21.0s Time] [2024-11-09 07:50:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:50:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2024-11-09 07:50:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 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-11-09 07:50:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2024-11-09 07:50:00,299 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 29 [2024-11-09 07:50:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:50:00,299 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2024-11-09 07:50:00,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 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-11-09 07:50:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-09 07:50:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:50:00,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:50:00,300 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, 1] [2024-11-09 07:50:00,303 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-11-09 07:50:00,506 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 [2024-11-09 07:50:00,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:00,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-11-09 07:50:00,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:50:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1844886222, now seen corresponding path program 1 times [2024-11-09 07:50:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:50:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885883465] [2024-11-09 07:50:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:00,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:50:00,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:50:00,711 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:50:00,712 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 (25)] Waiting until timeout for monitored process [2024-11-09 07:50:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:00,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 07:50:00,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:05,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:50:05,253 INFO L349 Elim1Store]: treesize reduction 86, result has 8.5 percent of original size [2024-11-09 07:50:05,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 80 [2024-11-09 07:50:13,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:50:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885883465] [2024-11-09 07:50:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885883465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:50:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [682076685] [2024-11-09 07:50:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:50:13,498 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 07:50:13,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 07:50:13,499 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 07:50:13,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2024-11-09 07:50:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:50:13,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:50:13,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:50:26,409 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)) (_ bv0 1)) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_26| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~cfg~1#1.base_28| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_26|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_28| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_26| (_ bv0 1))) (not (= (_ bv0 32) |v_ULTIMATE.start_entry_point_~c11~0#1.base_26|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_26| (_ bv1 1)) |v_ULTIMATE.start_entry_point_~cfg~1#1.base_28| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_26|))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_28|))))) is different from true [2024-11-09 07:50:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:50:26,428 INFO L311 TraceCheckSpWp]: Computing backward predicates...