./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:45:38,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:45:38,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:45:38,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:45:38,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:45:38,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:45:38,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:45:38,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:45:38,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:45:38,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:45:38,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:45:38,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:45:38,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:45:38,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:45:38,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:45:38,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:45:38,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:45:38,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:45:38,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:45:38,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:45:38,402 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:45:38,403 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:45:38,403 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:45:38,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:45:38,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:45:38,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:45:38,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:45:38,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:45:38,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:45:38,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:45:38,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:45:38,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:45:38,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:45:38,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:45:38,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:45:38,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:45:38,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:45:38,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:45:38,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:45:38,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:45:38,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:45:38,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:45:38,409 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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-11-22 18:45:38,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:45:38,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:45:38,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:45:38,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:45:38,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:45:38,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-22 18:45:39,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:45:40,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:45:40,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-22 18:45:40,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf4e8455/509043183ea848efb9de0847fe5d8d62/FLAG03c462586 [2024-11-22 18:45:40,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf4e8455/509043183ea848efb9de0847fe5d8d62 [2024-11-22 18:45:40,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:45:40,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:45:40,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:45:40,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:45:40,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:45:40,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:40" (1/1) ... [2024-11-22 18:45:40,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b51bc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:40, skipping insertion in model container [2024-11-22 18:45:40,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:40" (1/1) ... [2024-11-22 18:45:40,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:45:40,573 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-22 18:45:40,641 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-22 18:45:40,642 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-22 18:45:40,646 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-22 18:45:40,647 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-22 18:45:40,650 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-22 18:45:40,651 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-22 18:45:40,652 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-22 18:45:40,652 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-22 18:45:40,652 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-22 18:45:40,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:45:40,676 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-22 18:45:40,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1746c9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:40, skipping insertion in model container [2024-11-22 18:45:40,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:45:40,677 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:45:40,679 INFO L158 Benchmark]: Toolchain (without parser) took 444.95ms. Allocated memory was 174.1MB in the beginning and 262.1MB in the end (delta: 88.1MB). Free memory was 100.4MB in the beginning and 219.8MB in the end (delta: -119.3MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-22 18:45:40,679 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 174.1MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:45:40,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.82ms. Allocated memory was 174.1MB in the beginning and 262.1MB in the end (delta: 88.1MB). Free memory was 100.1MB in the beginning and 219.8MB in the end (delta: -119.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-22 18:45:40,681 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.15ms. Allocated memory is still 174.1MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.82ms. Allocated memory was 174.1MB in the beginning and 262.1MB in the end (delta: 88.1MB). Free memory was 100.1MB in the beginning and 219.8MB in the end (delta: -119.6MB). Peak memory consumption was 11.3MB. 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:45:42,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:45:42,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 18:45:42,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:45:42,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:45:42,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:45:42,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:45:42,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:45:42,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:45:42,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:45:42,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:45:42,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:45:42,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:45:42,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:45:42,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:45:42,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:45:42,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:45:42,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:45:42,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:45:42,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:45:42,978 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:45:42,980 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:45:42,980 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:45:42,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:45:42,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:45:42,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:45:42,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:45:42,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:45:42,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:45:42,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:45:42,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:45:42,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:45:42,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:45:42,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:45:42,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:45:42,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:45:42,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:45:42,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:45:42,984 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:45:42,984 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:45:42,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:45:42,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:45:42,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:45:42,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:45:42,985 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 -> 7f08d75c904d21d6573220c7737d451cd978e8a22a153e855f8d685d88a1eb60 [2024-11-22 18:45:43,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:45:43,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:45:43,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:45:43,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:45:43,273 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:45:43,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-22 18:45:44,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:45:44,915 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:45:44,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test12-2.i [2024-11-22 18:45:44,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0dc6bf79/98b04a60e0824fa8a254cf9b5e3981b7/FLAG1816bebea [2024-11-22 18:45:45,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0dc6bf79/98b04a60e0824fa8a254cf9b5e3981b7 [2024-11-22 18:45:45,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:45:45,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:45:45,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:45:45,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:45:45,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:45:45,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:45,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99fabc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45, skipping insertion in model container [2024-11-22 18:45:45,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:45,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:45:45,565 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-22 18:45:45,631 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-22 18:45:45,632 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-22 18:45:45,636 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-22 18:45:45,638 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-22 18:45:45,639 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-22 18:45:45,642 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-22 18:45:45,643 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-22 18:45:45,643 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-22 18:45:45,645 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-22 18:45:45,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:45:45,679 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:45:45,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:45:45,707 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-22 18:45:45,731 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-22 18:45:45,735 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-22 18:45:45,737 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-22 18:45:45,738 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-22 18:45:45,741 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-22 18:45:45,742 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-22 18:45:45,742 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-22 18:45:45,742 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-22 18:45:45,743 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-22 18:45:45,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:45:45,749 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:45:45,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:45:45,851 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:45:45,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45 WrapperNode [2024-11-22 18:45:45,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:45:45,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:45:45,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:45:45,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:45:45,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:45,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:45,917 INFO L138 Inliner]: procedures = 179, calls = 145, calls flagged for inlining = 33, calls inlined = 20, statements flattened = 349 [2024-11-22 18:45:45,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:45:45,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:45:45,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:45:45,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:45:45,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:45,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:45,940 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,003 INFO L175 MemorySlicer]: Split 55 memory accesses to 2 slices as follows [10, 45]. 82 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [8, 2]. The 23 writes are split as follows [0, 23]. [2024-11-22 18:45:46,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:45:46,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:45:46,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:45:46,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:45:46,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (1/1) ... [2024-11-22 18:45:46,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:45:46,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:45:46,097 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-22 18:45:46,101 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-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-22 18:45:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-22 18:45:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-11-22 18:45:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-11-22 18:45:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-11-22 18:45:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-11-22 18:45:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-22 18:45:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-22 18:45:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-22 18:45:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-22 18:45:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-22 18:45:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-22 18:45:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2024-11-22 18:45:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#0 [2024-11-22 18:45:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4#1 [2024-11-22 18:45:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:45:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:45:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 18:45:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 18:45:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:45:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 18:45:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 18:45:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 18:45:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 18:45:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#0 [2024-11-22 18:45:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1#1 [2024-11-22 18:45:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:45:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:45:46,291 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:45:46,293 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:45:46,408 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 18:45:46,603 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 18:45:47,406 INFO L? ?]: Removed 414 outVars from TransFormulas that were not future-live. [2024-11-22 18:45:47,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:45:47,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:45:47,425 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:45:47,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:47 BoogieIcfgContainer [2024-11-22 18:45:47,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:45:47,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:45:47,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:45:47,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:45:47,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:45:45" (1/3) ... [2024-11-22 18:45:47,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fcb9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:47, skipping insertion in model container [2024-11-22 18:45:47,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:45" (2/3) ... [2024-11-22 18:45:47,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fcb9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:47, skipping insertion in model container [2024-11-22 18:45:47,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:47" (3/3) ... [2024-11-22 18:45:47,433 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test12-2.i [2024-11-22 18:45:47,444 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:45:47,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 124 error locations. [2024-11-22 18:45:47,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:45:47,485 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;@1a205de8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:45:47,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 124 error locations. [2024-11-22 18:45:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 171 states have (on average 1.8654970760233918) internal successors, (319), 294 states have internal predecessors, (319), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-22 18:45:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:45:47,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:47,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:47,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1462279470, now seen corresponding path program 1 times [2024-11-22 18:45:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:47,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874798342] [2024-11-22 18:45:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:47,506 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-22 18:45:47,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:47,511 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-22 18:45:47,525 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-22 18:45:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:47,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:45:47,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:47,711 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-22 18:45:47,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:45:47,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874798342] [2024-11-22 18:45:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874798342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:45:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:45:47,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:45:47,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92783779] [2024-11-22 18:45:47,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:45:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:45:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:47,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:45:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:45:47,738 INFO L87 Difference]: Start difference. First operand has 313 states, 171 states have (on average 1.8654970760233918) internal successors, (319), 294 states have internal predecessors, (319), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-22 18:45:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:48,458 INFO L93 Difference]: Finished difference Result 412 states and 459 transitions. [2024-11-22 18:45:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:45:48,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-22 18:45:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:48,469 INFO L225 Difference]: With dead ends: 412 [2024-11-22 18:45:48,469 INFO L226 Difference]: Without dead ends: 408 [2024-11-22 18:45:48,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:45:48,484 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 299 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:48,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 501 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 18:45:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-22 18:45:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 344. [2024-11-22 18:45:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 200 states have (on average 1.83) internal successors, (366), 321 states have internal predecessors, (366), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-22 18:45:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 402 transitions. [2024-11-22 18:45:48,533 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 402 transitions. Word has length 11 [2024-11-22 18:45:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:48,533 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 402 transitions. [2024-11-22 18:45:48,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-22 18:45:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 402 transitions. [2024-11-22 18:45:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:45:48,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:48,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:48,538 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-22 18:45:48,735 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-22 18:45:48,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1462279469, now seen corresponding path program 1 times [2024-11-22 18:45:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:48,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472466646] [2024-11-22 18:45:48,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:48,737 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-22 18:45:48,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:48,739 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-22 18:45:48,740 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-22 18:45:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:48,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:45:48,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:48,890 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-22 18:45:48,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:45:48,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:48,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472466646] [2024-11-22 18:45:48,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472466646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:45:48,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:45:48,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:45:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773610852] [2024-11-22 18:45:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:45:48,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:45:48,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:45:48,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:45:48,892 INFO L87 Difference]: Start difference. First operand 344 states and 402 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-22 18:45:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:49,490 INFO L93 Difference]: Finished difference Result 476 states and 564 transitions. [2024-11-22 18:45:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:45:49,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-22 18:45:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:49,492 INFO L225 Difference]: With dead ends: 476 [2024-11-22 18:45:49,492 INFO L226 Difference]: Without dead ends: 476 [2024-11-22 18:45:49,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:45:49,493 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 131 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:49,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 830 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:45:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-22 18:45:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 407. [2024-11-22 18:45:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 256 states have (on average 1.83203125) internal successors, (469), 376 states have internal predecessors, (469), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (29), 23 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-22 18:45:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 520 transitions. [2024-11-22 18:45:49,514 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 520 transitions. Word has length 11 [2024-11-22 18:45:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:49,514 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 520 transitions. [2024-11-22 18:45:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-22 18:45:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 520 transitions. [2024-11-22 18:45:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 18:45:49,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:49,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:49,520 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-22 18:45:49,717 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-22 18:45:49,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1945184146, now seen corresponding path program 1 times [2024-11-22 18:45:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991744018] [2024-11-22 18:45:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:49,719 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-22 18:45:49,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:49,723 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-22 18:45:49,725 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-22 18:45:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:49,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:45:49,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:49,805 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-22 18:45:49,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:45:49,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:49,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991744018] [2024-11-22 18:45:49,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991744018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:45:49,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:45:49,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:45:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661233324] [2024-11-22 18:45:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:45:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:45:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:45:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:45:49,807 INFO L87 Difference]: Start difference. First operand 407 states and 520 transitions. 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-22 18:45:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:49,883 INFO L93 Difference]: Finished difference Result 607 states and 761 transitions. [2024-11-22 18:45:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:45:49,883 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-22 18:45:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:49,885 INFO L225 Difference]: With dead ends: 607 [2024-11-22 18:45:49,885 INFO L226 Difference]: Without dead ends: 607 [2024-11-22 18:45:49,886 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-22 18:45:49,886 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 216 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:49,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1336 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:45:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-22 18:45:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 392. [2024-11-22 18:45:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 241 states have (on average 1.8215767634854771) internal successors, (439), 362 states have internal predecessors, (439), 21 states have call successors, (21), 9 states have call predecessors, (21), 10 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-22 18:45:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 494 transitions. [2024-11-22 18:45:49,911 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 494 transitions. Word has length 11 [2024-11-22 18:45:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:49,911 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 494 transitions. [2024-11-22 18:45:49,911 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-22 18:45:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 494 transitions. [2024-11-22 18:45:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:45:49,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:49,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:49,921 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-22 18:45:50,112 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-22 18:45:50,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:50,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash -796252301, now seen corresponding path program 1 times [2024-11-22 18:45:50,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:50,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856283151] [2024-11-22 18:45:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:50,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:45:50,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:50,120 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-22 18:45:50,122 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-22 18:45:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:50,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:45:50,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:50,405 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-22 18:45:50,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:45:50,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856283151] [2024-11-22 18:45:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856283151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:45:50,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:45:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:45:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650836465] [2024-11-22 18:45:50,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:45:50,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:45:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:50,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:45:50,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:45:50,406 INFO L87 Difference]: Start difference. First operand 392 states and 494 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-22 18:45:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:51,300 INFO L93 Difference]: Finished difference Result 436 states and 541 transitions. [2024-11-22 18:45:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:45:51,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-22 18:45:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:51,304 INFO L225 Difference]: With dead ends: 436 [2024-11-22 18:45:51,304 INFO L226 Difference]: Without dead ends: 436 [2024-11-22 18:45:51,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:45:51,304 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 56 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:51,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1149 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 18:45:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-22 18:45:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 404. [2024-11-22 18:45:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 250 states have (on average 1.804) internal successors, (451), 372 states have internal predecessors, (451), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-22 18:45:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 506 transitions. [2024-11-22 18:45:51,341 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 506 transitions. Word has length 13 [2024-11-22 18:45:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:51,342 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 506 transitions. [2024-11-22 18:45:51,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-22 18:45:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 506 transitions. [2024-11-22 18:45:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:45:51,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:51,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:51,348 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-22 18:45:51,543 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-22 18:45:51,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:51,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash -796252300, now seen corresponding path program 1 times [2024-11-22 18:45:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142943053] [2024-11-22 18:45:51,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:51,544 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-22 18:45:51,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:51,545 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-22 18:45:51,546 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-22 18:45:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:51,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 18:45:51,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:51,808 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-22 18:45:51,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:45:51,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142943053] [2024-11-22 18:45:51,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142943053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:45:51,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:45:51,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:45:51,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182347706] [2024-11-22 18:45:51,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:45:51,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:45:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:51,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:45:51,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:45:51,810 INFO L87 Difference]: Start difference. First operand 404 states and 506 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-22 18:45:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:52,649 INFO L93 Difference]: Finished difference Result 424 states and 522 transitions. [2024-11-22 18:45:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:45:52,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2024-11-22 18:45:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:52,652 INFO L225 Difference]: With dead ends: 424 [2024-11-22 18:45:52,652 INFO L226 Difference]: Without dead ends: 424 [2024-11-22 18:45:52,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:45:52,658 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 29 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:52,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1294 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 18:45:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-22 18:45:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 413. [2024-11-22 18:45:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 259 states have (on average 1.7915057915057915) internal successors, (464), 381 states have internal predecessors, (464), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (34), 22 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-22 18:45:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 519 transitions. [2024-11-22 18:45:52,679 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 519 transitions. Word has length 13 [2024-11-22 18:45:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:52,679 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 519 transitions. [2024-11-22 18:45:52,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-22 18:45:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 519 transitions. [2024-11-22 18:45:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:45:52,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:52,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:52,687 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-22 18:45:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:45:52,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:52,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1984077660, now seen corresponding path program 1 times [2024-11-22 18:45:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:52,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137911916] [2024-11-22 18:45:52,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:52,885 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-22 18:45:52,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:52,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:45:52,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 18:45:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:52,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:45:52,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:53,007 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-22 18:45:53,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:45:53,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:53,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137911916] [2024-11-22 18:45:53,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137911916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:45:53,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:45:53,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:45:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686327851] [2024-11-22 18:45:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:45:53,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:45:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:45:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:45:53,008 INFO L87 Difference]: Start difference. First operand 413 states and 519 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-22 18:45:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:53,049 INFO L93 Difference]: Finished difference Result 347 states and 394 transitions. [2024-11-22 18:45:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:45:53,050 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-22 18:45:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:53,051 INFO L225 Difference]: With dead ends: 347 [2024-11-22 18:45:53,052 INFO L226 Difference]: Without dead ends: 347 [2024-11-22 18:45:53,052 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-22 18:45:53,053 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:53,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1348 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:45:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-22 18:45:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2024-11-22 18:45:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 199 states have (on average 1.7688442211055277) internal successors, (352), 320 states have internal predecessors, (352), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 17 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-22 18:45:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 387 transitions. [2024-11-22 18:45:53,061 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 387 transitions. Word has length 17 [2024-11-22 18:45:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:53,061 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 387 transitions. [2024-11-22 18:45:53,061 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-22 18:45:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 387 transitions. [2024-11-22 18:45:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:45:53,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:53,062 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:53,072 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 (7)] Forceful destruction successful, exit code 0 [2024-11-22 18:45:53,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:45:53,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:53,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2017486629, now seen corresponding path program 1 times [2024-11-22 18:45:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:53,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655618550] [2024-11-22 18:45:53,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:53,264 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-22 18:45:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:53,269 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-22 18:45:53,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 (8)] Waiting until timeout for monitored process [2024-11-22 18:45:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:53,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:45:53,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:53,403 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-22 18:45:53,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:45:53,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655618550] [2024-11-22 18:45:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655618550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:45:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:45:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:45:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293857793] [2024-11-22 18:45:53,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:45:53,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:45:53,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:53,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:45:53,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:45:53,408 INFO L87 Difference]: Start difference. First operand 345 states and 387 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-22 18:45:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:53,446 INFO L93 Difference]: Finished difference Result 349 states and 396 transitions. [2024-11-22 18:45:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:45:53,449 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-22 18:45:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:53,450 INFO L225 Difference]: With dead ends: 349 [2024-11-22 18:45:53,450 INFO L226 Difference]: Without dead ends: 349 [2024-11-22 18:45:53,450 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-22 18:45:53,450 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:53,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1355 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:45:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-22 18:45:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2024-11-22 18:45:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 201 states have (on average 1.7611940298507462) internal successors, (354), 321 states have internal predecessors, (354), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 18 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-22 18:45:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 389 transitions. [2024-11-22 18:45:53,456 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 389 transitions. Word has length 17 [2024-11-22 18:45:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:53,456 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 389 transitions. [2024-11-22 18:45:53,456 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-22 18:45:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 389 transitions. [2024-11-22 18:45:53,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:45:53,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:53,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:53,464 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-22 18:45:53,659 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-22 18:45:53,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:53,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2017486378, now seen corresponding path program 1 times [2024-11-22 18:45:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983754031] [2024-11-22 18:45:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:53,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:45:53,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:53,663 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-22 18:45:53,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 18:45:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:53,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:45:53,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:53,757 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-22 18:45:53,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:45:53,786 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-22 18:45:53,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983754031] [2024-11-22 18:45:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983754031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:45:53,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:45:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-22 18:45:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214836724] [2024-11-22 18:45:53,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:45:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:45:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:45:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:45:53,787 INFO L87 Difference]: Start difference. First operand 347 states and 389 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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-22 18:45:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:45:53,844 INFO L93 Difference]: Finished difference Result 346 states and 388 transitions. [2024-11-22 18:45:53,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:45:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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-22 18:45:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:45:53,849 INFO L225 Difference]: With dead ends: 346 [2024-11-22 18:45:53,849 INFO L226 Difference]: Without dead ends: 346 [2024-11-22 18:45:53,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-22 18:45:53,850 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 213 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:45:53,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1097 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:45:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-22 18:45:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-22 18:45:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 201 states have (on average 1.756218905472637) internal successors, (353), 320 states have internal predecessors, (353), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (19), 18 states have call predecessors, (19), 16 states have call successors, (19) [2024-11-22 18:45:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 388 transitions. [2024-11-22 18:45:53,858 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 388 transitions. Word has length 17 [2024-11-22 18:45:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:45:53,858 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 388 transitions. [2024-11-22 18:45:53,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 1 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-22 18:45:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 388 transitions. [2024-11-22 18:45:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:45:53,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:45:53,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:45:53,864 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-22 18:45:54,060 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-22 18:45:54,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:45:54,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:45:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2046115780, now seen corresponding path program 1 times [2024-11-22 18:45:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:45:54,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669757997] [2024-11-22 18:45:54,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:45:54,062 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-22 18:45:54,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:45:54,064 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-22 18:45:54,065 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-22 18:45:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:45:54,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:45:54,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:45:54,148 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-22 18:45:54,251 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:45:54,252 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-22 18:45:54,260 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-22 18:45:54,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:45:58,433 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-22 18:45:58,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:45:58,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669757997] [2024-11-22 18:45:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669757997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:45:58,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:45:58,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-22 18:45:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488099900] [2024-11-22 18:45:58,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:45:58,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:45:58,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:45:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:45:58,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:45:58,435 INFO L87 Difference]: Start difference. First operand 346 states and 388 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-22 18:46:03,013 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-22 18:46:07,039 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-22 18:46:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:07,564 INFO L93 Difference]: Finished difference Result 380 states and 424 transitions. [2024-11-22 18:46:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:46:07,565 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-22 18:46:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:07,567 INFO L225 Difference]: With dead ends: 380 [2024-11-22 18:46:07,570 INFO L226 Difference]: Without dead ends: 380 [2024-11-22 18:46:07,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:46:07,571 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 229 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:07,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 861 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 746 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-22 18:46:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-22 18:46:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 348. [2024-11-22 18:46:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 205 states have (on average 1.7317073170731707) internal successors, (355), 322 states have internal predecessors, (355), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 18 states have call predecessors, (20), 16 states have call successors, (20) [2024-11-22 18:46:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 391 transitions. [2024-11-22 18:46:07,582 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 391 transitions. Word has length 17 [2024-11-22 18:46:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:07,582 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 391 transitions. [2024-11-22 18:46:07,582 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-22 18:46:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 391 transitions. [2024-11-22 18:46:07,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:46:07,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:07,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:07,586 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-22 18:46:07,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:07,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:07,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2046115779, now seen corresponding path program 1 times [2024-11-22 18:46:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:07,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824370009] [2024-11-22 18:46:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:07,790 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-22 18:46:07,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:07,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:07,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-22 18:46:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:07,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:46:07,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:07,888 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-22 18:46:07,894 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-22 18:46:07,991 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-22 18:46:08,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:46:08,013 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-22 18:46:08,021 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:46:08,022 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-22 18:46:08,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-22 18:46:08,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:12,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824370009] [2024-11-22 18:46:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824370009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:46:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [154782206] [2024-11-22 18:46:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:12,211 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:46:12,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:46:12,212 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 18:46:12,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-22 18:46:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:12,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:46:12,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:12,337 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-22 18:46:12,341 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-22 18:46:12,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:46:12,398 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-22 18:46:12,407 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:46:12,408 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-22 18:46:12,418 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-22 18:46:12,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:12,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [154782206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:46:12,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:46:12,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-22 18:46:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232018309] [2024-11-22 18:46:12,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:46:12,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:46:12,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:12,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:46:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=69, Unknown=2, NotChecked=16, Total=110 [2024-11-22 18:46:12,561 INFO L87 Difference]: Start difference. First operand 348 states and 391 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-22 18:46:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:15,140 INFO L93 Difference]: Finished difference Result 656 states and 767 transitions. [2024-11-22 18:46:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:46:15,141 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-22 18:46:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:15,144 INFO L225 Difference]: With dead ends: 656 [2024-11-22 18:46:15,144 INFO L226 Difference]: Without dead ends: 656 [2024-11-22 18:46:15,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=30, Invalid=104, Unknown=2, NotChecked=20, Total=156 [2024-11-22 18:46:15,145 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 501 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:15,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1514 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1482 Invalid, 0 Unknown, 711 Unchecked, 2.5s Time] [2024-11-22 18:46:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-22 18:46:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 360. [2024-11-22 18:46:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 215 states have (on average 1.716279069767442) internal successors, (369), 331 states have internal predecessors, (369), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (30), 21 states have call predecessors, (30), 18 states have call successors, (30) [2024-11-22 18:46:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 417 transitions. [2024-11-22 18:46:15,171 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 417 transitions. Word has length 17 [2024-11-22 18:46:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:15,171 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 417 transitions. [2024-11-22 18:46:15,172 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-22 18:46:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 417 transitions. [2024-11-22 18:46:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:46:15,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:15,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:15,177 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 (11)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:15,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:15,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 18:46:15,573 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:15,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1882432167, now seen corresponding path program 1 times [2024-11-22 18:46:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158185244] [2024-11-22 18:46:15,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:15,574 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-22 18:46:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:15,575 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-22 18:46:15,578 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-22 18:46:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:15,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:46:15,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:15,759 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-22 18:46:15,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:15,830 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-22 18:46:15,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158185244] [2024-11-22 18:46:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158185244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:46:15,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:46:15,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-22 18:46:15,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446498651] [2024-11-22 18:46:15,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:46:15,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:46:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:46:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:46:15,832 INFO L87 Difference]: Start difference. First operand 360 states and 417 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-22 18:46:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:16,234 INFO L93 Difference]: Finished difference Result 363 states and 418 transitions. [2024-11-22 18:46:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:46:16,235 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-22 18:46:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:16,237 INFO L225 Difference]: With dead ends: 363 [2024-11-22 18:46:16,237 INFO L226 Difference]: Without dead ends: 363 [2024-11-22 18:46:16,237 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-22 18:46:16,237 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 737 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:16,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1255 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:46:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-22 18:46:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 359. [2024-11-22 18:46:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 215 states have (on average 1.7069767441860466) internal successors, (367), 330 states have internal predecessors, (367), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (30), 21 states have call predecessors, (30), 18 states have call successors, (30) [2024-11-22 18:46:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 415 transitions. [2024-11-22 18:46:16,243 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 415 transitions. Word has length 18 [2024-11-22 18:46:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:16,243 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 415 transitions. [2024-11-22 18:46:16,243 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-22 18:46:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 415 transitions. [2024-11-22 18:46:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:46:16,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:16,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:16,249 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 (13)] Ended with exit code 0 [2024-11-22 18:46:16,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:16,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1569438937, now seen corresponding path program 1 times [2024-11-22 18:46:16,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:16,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101021022] [2024-11-22 18:46:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:16,447 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-22 18:46:16,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:16,449 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:16,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-22 18:46:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:16,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:46:16,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:16,565 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-22 18:46:16,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:16,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101021022] [2024-11-22 18:46:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101021022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:16,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:16,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:46:16,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946187470] [2024-11-22 18:46:16,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:16,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:46:16,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:16,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:46:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:46:16,567 INFO L87 Difference]: Start difference. First operand 359 states and 415 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-22 18:46:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:17,231 INFO L93 Difference]: Finished difference Result 362 states and 417 transitions. [2024-11-22 18:46:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:46:17,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-22 18:46:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:17,237 INFO L225 Difference]: With dead ends: 362 [2024-11-22 18:46:17,237 INFO L226 Difference]: Without dead ends: 349 [2024-11-22 18:46:17,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-22 18:46:17,238 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 41 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:17,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 661 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 18:46:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-22 18:46:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-22 18:46:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 206 states have (on average 1.733009708737864) internal successors, (357), 321 states have internal predecessors, (357), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-22 18:46:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 404 transitions. [2024-11-22 18:46:17,250 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 404 transitions. Word has length 18 [2024-11-22 18:46:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:17,250 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 404 transitions. [2024-11-22 18:46:17,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-22 18:46:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 404 transitions. [2024-11-22 18:46:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:46:17,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:17,254 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-22 18:46:17,262 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 (14)] Ended with exit code 0 [2024-11-22 18:46:17,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:17,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:17,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:17,455 INFO L85 PathProgramCache]: Analyzing trace with hash 149147163, now seen corresponding path program 1 times [2024-11-22 18:46:17,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:17,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418123462] [2024-11-22 18:46:17,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:17,455 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-22 18:46:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:17,458 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-22 18:46:17,461 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-22 18:46:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:17,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:46:17,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:17,593 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:46:17,593 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-22 18:46:17,693 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 16 treesize of output 13 [2024-11-22 18:46:17,700 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-22 18:46:17,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:17,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418123462] [2024-11-22 18:46:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418123462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:46:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [955521750] [2024-11-22 18:46:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:17,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:46:17,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:46:17,765 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 18:46:17,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-22 18:46:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:17,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:46:17,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:17,943 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:46:17,944 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-22 18:46:18,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 16 treesize of output 13 [2024-11-22 18:46:18,040 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-22 18:46:18,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:18,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [955521750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:46:18,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:46:18,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-22 18:46:18,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26071686] [2024-11-22 18:46:18,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:46:18,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:46:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:18,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:46:18,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:46:18,088 INFO L87 Difference]: Start difference. First operand 349 states and 404 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 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-22 18:46:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:19,523 INFO L93 Difference]: Finished difference Result 426 states and 479 transitions. [2024-11-22 18:46:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:46:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 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 21 [2024-11-22 18:46:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:19,524 INFO L225 Difference]: With dead ends: 426 [2024-11-22 18:46:19,525 INFO L226 Difference]: Without dead ends: 426 [2024-11-22 18:46:19,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:46:19,525 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 264 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:19,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 914 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 18:46:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-22 18:46:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 351. [2024-11-22 18:46:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 208 states have (on average 1.7307692307692308) internal successors, (360), 323 states have internal predecessors, (360), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-22 18:46:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 407 transitions. [2024-11-22 18:46:19,552 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 407 transitions. Word has length 21 [2024-11-22 18:46:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:19,552 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 407 transitions. [2024-11-22 18:46:19,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 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-22 18:46:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 407 transitions. [2024-11-22 18:46:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:46:19,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:19,553 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-22 18:46:19,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:19,758 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-22 18:46:19,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:19,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:19,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash 149147164, now seen corresponding path program 1 times [2024-11-22 18:46:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:19,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116989392] [2024-11-22 18:46:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:19,961 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-22 18:46:19,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:19,963 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-22 18:46:19,964 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-22 18:46:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:20,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:46:20,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:46:20,134 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-22 18:46:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:20,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:20,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:20,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116989392] [2024-11-22 18:46:20,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116989392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:46:20,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322745503] [2024-11-22 18:46:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:20,489 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:46:20,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:46:20,490 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 18:46:20,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-22 18:46:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:20,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 18:46:20,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:20,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:46:20,705 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-22 18:46:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:46:20,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [322745503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:46:24,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:46:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-22 18:46:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777809519] [2024-11-22 18:46:24,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:46:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:46:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:46:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:46:24,984 INFO L87 Difference]: Start difference. First operand 351 states and 407 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:46:29,398 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-22 18:46:34,058 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-22 18:46:38,073 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-22 18:46:43,244 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-22 18:46:47,433 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-22 18:46:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:47,445 INFO L93 Difference]: Finished difference Result 419 states and 472 transitions. [2024-11-22 18:46:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:46:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-22 18:46:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:47,447 INFO L225 Difference]: With dead ends: 419 [2024-11-22 18:46:47,447 INFO L226 Difference]: Without dead ends: 419 [2024-11-22 18:46:47,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:46:47,447 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 468 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:47,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 603 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 800 Invalid, 5 Unknown, 0 Unchecked, 22.3s Time] [2024-11-22 18:46:47,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-22 18:46:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 350. [2024-11-22 18:46:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 208 states have (on average 1.7211538461538463) internal successors, (358), 322 states have internal predecessors, (358), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-22 18:46:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 405 transitions. [2024-11-22 18:46:47,453 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 405 transitions. Word has length 21 [2024-11-22 18:46:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:47,454 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 405 transitions. [2024-11-22 18:46:47,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:46:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 405 transitions. [2024-11-22 18:46:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:46:47,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:47,454 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:47,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:47,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:47,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 18:46:47,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:47,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:47,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1596515452, now seen corresponding path program 1 times [2024-11-22 18:46:47,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:47,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028279234] [2024-11-22 18:46:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:47,858 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-22 18:46:47,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:47,859 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-22 18:46:47,861 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-22 18:46:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:47,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:46:47,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:48,003 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 15 treesize of output 7 [2024-11-22 18:46:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:46:48,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:48,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028279234] [2024-11-22 18:46:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028279234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:48,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:46:48,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566588601] [2024-11-22 18:46:48,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:48,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:48,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:48,024 INFO L87 Difference]: Start difference. First operand 350 states and 405 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:46:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:48,548 INFO L93 Difference]: Finished difference Result 386 states and 444 transitions. [2024-11-22 18:46:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:46:48,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-22 18:46:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:48,550 INFO L225 Difference]: With dead ends: 386 [2024-11-22 18:46:48,550 INFO L226 Difference]: Without dead ends: 386 [2024-11-22 18:46:48,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:46:48,551 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 50 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:48,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1033 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:46:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-22 18:46:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 352. [2024-11-22 18:46:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 210 states have (on average 1.7190476190476192) internal successors, (361), 324 states have internal predecessors, (361), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-22 18:46:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 408 transitions. [2024-11-22 18:46:48,557 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 408 transitions. Word has length 23 [2024-11-22 18:46:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:48,557 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 408 transitions. [2024-11-22 18:46:48,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:46:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 408 transitions. [2024-11-22 18:46:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:46:48,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:48,558 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:46:48,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-22 18:46:48,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:48,761 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:48,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1596515453, now seen corresponding path program 1 times [2024-11-22 18:46:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982282670] [2024-11-22 18:46:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:48,762 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-22 18:46:48,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:48,763 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:48,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 18:46:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:48,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 18:46:48,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:48,947 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 15 treesize of output 7 [2024-11-22 18:46:48,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 18:46:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:46:48,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:48,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:48,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982282670] [2024-11-22 18:46:48,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982282670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:48,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:48,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:46:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731887578] [2024-11-22 18:46:48,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:48,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:48,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:48,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:48,972 INFO L87 Difference]: Start difference. First operand 352 states and 408 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:46:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:49,495 INFO L93 Difference]: Finished difference Result 375 states and 432 transitions. [2024-11-22 18:46:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:46:49,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-22 18:46:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:49,497 INFO L225 Difference]: With dead ends: 375 [2024-11-22 18:46:49,497 INFO L226 Difference]: Without dead ends: 375 [2024-11-22 18:46:49,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:46:49,498 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 37 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1074 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:46:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-22 18:46:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2024-11-22 18:46:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 210 states have (on average 1.7142857142857142) internal successors, (360), 324 states have internal predecessors, (360), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-22 18:46:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 407 transitions. [2024-11-22 18:46:49,503 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 407 transitions. Word has length 23 [2024-11-22 18:46:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:49,503 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 407 transitions. [2024-11-22 18:46:49,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:46:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 407 transitions. [2024-11-22 18:46:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:46:49,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:49,504 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-22 18:46:49,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 18:46:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:49,706 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:49,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1986599339, now seen corresponding path program 1 times [2024-11-22 18:46:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654746698] [2024-11-22 18:46:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:49,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-22 18:46:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:49,709 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-22 18:46:49,710 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-22 18:46:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:49,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:46:49,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:49,795 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-22 18:46:49,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:49,818 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-22 18:46:49,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:49,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654746698] [2024-11-22 18:46:49,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654746698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:46:49,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:46:49,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-22 18:46:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549995122] [2024-11-22 18:46:49,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:46:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:49,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:49,820 INFO L87 Difference]: Start difference. First operand 352 states and 407 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:46:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:49,848 INFO L93 Difference]: Finished difference Result 351 states and 406 transitions. [2024-11-22 18:46:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:46:49,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-22 18:46:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:49,850 INFO L225 Difference]: With dead ends: 351 [2024-11-22 18:46:49,850 INFO L226 Difference]: Without dead ends: 351 [2024-11-22 18:46:49,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-22 18:46:49,851 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 201 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:49,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1094 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:46:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-22 18:46:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-22 18:46:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 210 states have (on average 1.7095238095238094) internal successors, (359), 323 states have internal predecessors, (359), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (29), 20 states have call predecessors, (29), 18 states have call successors, (29) [2024-11-22 18:46:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 406 transitions. [2024-11-22 18:46:49,855 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 406 transitions. Word has length 25 [2024-11-22 18:46:49,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 406 transitions. [2024-11-22 18:46:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:46:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 406 transitions. [2024-11-22 18:46:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:46:49,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:49,856 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-22 18:46:49,859 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-22 18:46:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-22 18:46:50,057 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:50,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1986599573, now seen corresponding path program 1 times [2024-11-22 18:46:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229341228] [2024-11-22 18:46:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:50,058 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-22 18:46:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:50,060 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:46:50,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-22 18:46:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:50,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:46:50,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:50,152 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-22 18:46:50,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:46:50,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229341228] [2024-11-22 18:46:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229341228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:46:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:46:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:46:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019784669] [2024-11-22 18:46:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:46:50,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:46:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:46:50,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:46:50,153 INFO L87 Difference]: Start difference. First operand 351 states and 406 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:46:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:50,178 INFO L93 Difference]: Finished difference Result 349 states and 399 transitions. [2024-11-22 18:46:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:46:50,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-22 18:46:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:50,179 INFO L225 Difference]: With dead ends: 349 [2024-11-22 18:46:50,179 INFO L226 Difference]: Without dead ends: 349 [2024-11-22 18:46:50,179 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-22 18:46:50,180 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:50,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1325 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:46:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-22 18:46:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-22 18:46:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 209 states have (on average 1.6985645933014355) internal successors, (355), 321 states have internal predecessors, (355), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-22 18:46:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2024-11-22 18:46:50,184 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 25 [2024-11-22 18:46:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:50,184 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2024-11-22 18:46:50,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-22 18:46:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2024-11-22 18:46:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:46:50,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:50,185 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-22 18:46:50,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-22 18:46:50,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:46:50,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:50,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2015228724, now seen corresponding path program 1 times [2024-11-22 18:46:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961781085] [2024-11-22 18:46:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:50,387 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-22 18:46:50,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:50,389 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-22 18:46:50,390 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-22 18:46:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:50,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:46:50,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:50,464 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-22 18:46:50,496 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-22 18:46:50,508 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 18:46:50,508 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-22 18:46:50,520 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-22 18:46:50,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:50,625 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-22 18:46:50,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961781085] [2024-11-22 18:46:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961781085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:46:50,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:46:50,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-11-22 18:46:50,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163341185] [2024-11-22 18:46:50,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:46:50,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:46:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:46:50,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:46:50,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-22 18:46:50,628 INFO L87 Difference]: Start difference. First operand 349 states and 399 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-22 18:46:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:46:51,725 INFO L93 Difference]: Finished difference Result 375 states and 422 transitions. [2024-11-22 18:46:51,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:46:51,725 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-22 18:46:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:46:51,726 INFO L225 Difference]: With dead ends: 375 [2024-11-22 18:46:51,727 INFO L226 Difference]: Without dead ends: 375 [2024-11-22 18:46:51,727 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-22 18:46:51,727 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 178 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:46:51,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1003 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 815 Invalid, 0 Unknown, 382 Unchecked, 1.1s Time] [2024-11-22 18:46:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-22 18:46:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 351. [2024-11-22 18:46:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 212 states have (on average 1.6886792452830188) internal successors, (358), 323 states have internal predecessors, (358), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-22 18:46:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 402 transitions. [2024-11-22 18:46:51,732 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 402 transitions. Word has length 25 [2024-11-22 18:46:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:46:51,732 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 402 transitions. [2024-11-22 18:46:51,732 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-22 18:46:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 402 transitions. [2024-11-22 18:46:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:46:51,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:46:51,733 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-22 18:46:51,736 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 (23)] Ended with exit code 0 [2024-11-22 18:46:51,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-22 18:46:51,936 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:46:51,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:46:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2015228723, now seen corresponding path program 1 times [2024-11-22 18:46:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:46:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535050776] [2024-11-22 18:46:51,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:51,937 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-22 18:46:51,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:46:51,942 INFO L229 MonitoredProcess]: Starting monitored process 24 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-22 18:46:51,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-22 18:46:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:52,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 18:46:52,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:52,029 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-22 18:46:52,105 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-22 18:46:52,124 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:46:52,125 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-22 18:46:52,147 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-22 18:46:52,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:46:52,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:46:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535050776] [2024-11-22 18:46:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535050776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:46:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1599865629] [2024-11-22 18:46:52,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:46:52,287 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:46:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:46:52,288 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 18:46:52,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-22 18:46:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:46:52,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:46:52,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:46:52,445 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-22 18:46:52,449 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-22 18:46:52,557 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-22 18:46:52,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:46:52,570 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-22 18:46:52,577 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:46:52,578 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-22 18:46:52,586 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-22 18:46:52,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:47:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1599865629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:47:00,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:47:00,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-22 18:47:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586097153] [2024-11-22 18:47:00,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:47:00,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:47:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:47:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=171, Unknown=4, NotChecked=54, Total=272 [2024-11-22 18:47:00,709 INFO L87 Difference]: Start difference. First operand 351 states and 402 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-22 18:47:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:03,321 INFO L93 Difference]: Finished difference Result 629 states and 735 transitions. [2024-11-22 18:47:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:47:03,322 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-22 18:47:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:03,324 INFO L225 Difference]: With dead ends: 629 [2024-11-22 18:47:03,324 INFO L226 Difference]: Without dead ends: 629 [2024-11-22 18:47:03,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=53, Invalid=223, Unknown=4, NotChecked=62, Total=342 [2024-11-22 18:47:03,324 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 393 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1352 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:03,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 2053 Invalid, 3245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1840 Invalid, 0 Unknown, 1352 Unchecked, 2.5s Time] [2024-11-22 18:47:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-22 18:47:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 350. [2024-11-22 18:47:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 212 states have (on average 1.6839622641509433) internal successors, (357), 322 states have internal predecessors, (357), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-22 18:47:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 401 transitions. [2024-11-22 18:47:03,330 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 401 transitions. Word has length 25 [2024-11-22 18:47:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:03,330 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 401 transitions. [2024-11-22 18:47:03,330 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-22 18:47:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 401 transitions. [2024-11-22 18:47:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:47:03,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:03,331 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-22 18:47:03,338 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 (24)] Ended with exit code 0 [2024-11-22 18:47:03,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-22 18:47:03,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 18:47:03,737 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:47:03,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1455036927, now seen corresponding path program 1 times [2024-11-22 18:47:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:03,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916973793] [2024-11-22 18:47:03,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:03,738 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-22 18:47:03,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:03,741 INFO L229 MonitoredProcess]: Starting monitored process 26 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-22 18:47:03,741 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 (26)] Waiting until timeout for monitored process [2024-11-22 18:47:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:03,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:47:03,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:04,114 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-22 18:47:04,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:47:04,196 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-22 18:47:04,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:04,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916973793] [2024-11-22 18:47:04,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916973793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:47:04,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:47:04,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-22 18:47:04,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308557213] [2024-11-22 18:47:04,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:47:04,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:47:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:47:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:47:04,197 INFO L87 Difference]: Start difference. First operand 350 states and 401 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-22 18:47:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:04,808 INFO L93 Difference]: Finished difference Result 349 states and 399 transitions. [2024-11-22 18:47:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:47:04,809 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-22 18:47:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:04,819 INFO L225 Difference]: With dead ends: 349 [2024-11-22 18:47:04,820 INFO L226 Difference]: Without dead ends: 349 [2024-11-22 18:47:04,820 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-22 18:47:04,821 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 781 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:04,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1478 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:47:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-22 18:47:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-22 18:47:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 212 states have (on average 1.6745283018867925) internal successors, (355), 321 states have internal predecessors, (355), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-22 18:47:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 399 transitions. [2024-11-22 18:47:04,832 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 399 transitions. Word has length 26 [2024-11-22 18:47:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:04,833 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 399 transitions. [2024-11-22 18:47:04,833 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-22 18:47:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 399 transitions. [2024-11-22 18:47:04,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:47:04,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:04,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:04,840 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 (26)] Ended with exit code 0 [2024-11-22 18:47:05,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-22 18:47:05,038 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:47:05,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash -675610894, now seen corresponding path program 1 times [2024-11-22 18:47:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:05,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660169738] [2024-11-22 18:47:05,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:05,039 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-22 18:47:05,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:05,043 INFO L229 MonitoredProcess]: Starting monitored process 27 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-22 18:47:05,044 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 (27)] Waiting until timeout for monitored process [2024-11-22 18:47:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:05,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 18:47:05,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:47:05,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:05,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:05,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660169738] [2024-11-22 18:47:05,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660169738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:05,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:05,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:47:05,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624180480] [2024-11-22 18:47:05,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:05,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:47:05,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:05,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:47:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:47:05,369 INFO L87 Difference]: Start difference. First operand 349 states and 399 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:47:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:05,706 INFO L93 Difference]: Finished difference Result 355 states and 404 transitions. [2024-11-22 18:47:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:47:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-22 18:47:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:05,708 INFO L225 Difference]: With dead ends: 355 [2024-11-22 18:47:05,708 INFO L226 Difference]: Without dead ends: 355 [2024-11-22 18:47:05,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:47:05,711 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 9 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:05,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1238 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:47:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-22 18:47:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2024-11-22 18:47:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 214 states have (on average 1.6682242990654206) internal successors, (357), 323 states have internal predecessors, (357), 17 states have call successors, (17), 9 states have call predecessors, (17), 11 states have return successors, (27), 20 states have call predecessors, (27), 17 states have call successors, (27) [2024-11-22 18:47:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 401 transitions. [2024-11-22 18:47:05,719 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 401 transitions. Word has length 26 [2024-11-22 18:47:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:05,719 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 401 transitions. [2024-11-22 18:47:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:47:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 401 transitions. [2024-11-22 18:47:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:47:05,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:05,719 INFO L215 NwaCegarLoop]: trace histogram [2, 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-22 18:47:05,727 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 (27)] Ended with exit code 0 [2024-11-22 18:47:05,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-22 18:47:05,922 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:47:05,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash -722027152, now seen corresponding path program 1 times [2024-11-22 18:47:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193705157] [2024-11-22 18:47:05,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:05,923 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-22 18:47:05,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:05,924 INFO L229 MonitoredProcess]: Starting monitored process 28 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-22 18:47:05,929 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 (28)] Waiting until timeout for monitored process [2024-11-22 18:47:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:06,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:47:06,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:06,121 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~client~0#1.base_29| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~client~0#1.base_29|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~client~0#1.base_29| (_ bv0 1))))) is different from true [2024-11-22 18:47:06,156 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-22 18:47:06,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:47:06,215 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-22 18:47:06,215 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-22 18:47:06,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:06,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193705157] [2024-11-22 18:47:06,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193705157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:47:06,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1067583910] [2024-11-22 18:47:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:06,318 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:47:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:47:06,323 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 18:47:06,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2024-11-22 18:47:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:06,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:47:06,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:06,620 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-22 18:47:06,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:47:06,700 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-22 18:47:06,700 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-22 18:47:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1067583910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:47:06,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:47:06,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-22 18:47:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466870291] [2024-11-22 18:47:06,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:47:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:47:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:06,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:47:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-22 18:47:06,959 INFO L87 Difference]: Start difference. First operand 351 states and 401 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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-22 18:47:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:08,772 INFO L93 Difference]: Finished difference Result 363 states and 412 transitions. [2024-11-22 18:47:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:47:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 28 [2024-11-22 18:47:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:08,773 INFO L225 Difference]: With dead ends: 363 [2024-11-22 18:47:08,774 INFO L226 Difference]: Without dead ends: 347 [2024-11-22 18:47:08,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-22 18:47:08,774 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 347 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:08,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1360 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1243 Invalid, 0 Unknown, 348 Unchecked, 1.7s Time] [2024-11-22 18:47:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-22 18:47:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2024-11-22 18:47:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 209 states have (on average 1.6794258373205742) internal successors, (351), 319 states have internal predecessors, (351), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-22 18:47:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 394 transitions. [2024-11-22 18:47:08,779 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 394 transitions. Word has length 28 [2024-11-22 18:47:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:08,779 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 394 transitions. [2024-11-22 18:47:08,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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-22 18:47:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 394 transitions. [2024-11-22 18:47:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:47:08,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:08,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:47:08,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2024-11-22 18:47:08,983 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 (28)] Ended with exit code 0 [2024-11-22 18:47:09,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /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-22 18:47:09,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:47:09,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2075336849, now seen corresponding path program 1 times [2024-11-22 18:47:09,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283455402] [2024-11-22 18:47:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:09,184 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-22 18:47:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:09,186 INFO L229 MonitoredProcess]: Starting monitored process 30 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-22 18:47:09,187 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 (30)] Waiting until timeout for monitored process [2024-11-22 18:47:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:09,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:47:09,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:09,275 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-22 18:47:09,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:47:09,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283455402] [2024-11-22 18:47:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283455402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:47:09,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:47:09,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:47:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425002050] [2024-11-22 18:47:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:47:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:47:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:09,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:47:09,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:47:09,279 INFO L87 Difference]: Start difference. First operand 345 states and 394 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-22 18:47:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:09,309 INFO L93 Difference]: Finished difference Result 336 states and 384 transitions. [2024-11-22 18:47:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:47:09,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 28 [2024-11-22 18:47:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:09,310 INFO L225 Difference]: With dead ends: 336 [2024-11-22 18:47:09,310 INFO L226 Difference]: Without dead ends: 336 [2024-11-22 18:47:09,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-22 18:47:09,311 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 206 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:09,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1097 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:47:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-22 18:47:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2024-11-22 18:47:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 200 states have (on average 1.705) internal successors, (341), 310 states have internal predecessors, (341), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-22 18:47:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 384 transitions. [2024-11-22 18:47:09,315 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 384 transitions. Word has length 28 [2024-11-22 18:47:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 384 transitions. [2024-11-22 18:47:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-22 18:47:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 384 transitions. [2024-11-22 18:47:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:47:09,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:09,316 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] [2024-11-22 18:47:09,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 (30)] Ended with exit code 0 [2024-11-22 18:47:09,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-22 18:47:09,518 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:47:09,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 683652966, now seen corresponding path program 1 times [2024-11-22 18:47:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697034184] [2024-11-22 18:47:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:09,519 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-22 18:47:09,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:09,522 INFO L229 MonitoredProcess]: Starting monitored process 31 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-22 18:47:09,525 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 (31)] Waiting until timeout for monitored process [2024-11-22 18:47:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:09,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 18:47:09,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:09,604 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-22 18:47:09,672 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:47:09,672 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-22 18:47:09,745 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 16 treesize of output 13 [2024-11-22 18:47:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:47:09,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:47:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:47:09,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697034184] [2024-11-22 18:47:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697034184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:47:09,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:47:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-11-22 18:47:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441613674] [2024-11-22 18:47:09,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:47:09,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:47:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:47:09,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:47:09,999 INFO L87 Difference]: Start difference. First operand 336 states and 384 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:47:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:47:12,107 INFO L93 Difference]: Finished difference Result 363 states and 407 transitions. [2024-11-22 18:47:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:47:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-11-22 18:47:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:47:12,108 INFO L225 Difference]: With dead ends: 363 [2024-11-22 18:47:12,108 INFO L226 Difference]: Without dead ends: 363 [2024-11-22 18:47:12,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:47:12,109 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 429 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:47:12,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1373 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 18:47:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-22 18:47:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 339. [2024-11-22 18:47:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 203 states have (on average 1.6945812807881773) internal successors, (344), 313 states have internal predecessors, (344), 17 states have call successors, (17), 8 states have call predecessors, (17), 10 states have return successors, (26), 19 states have call predecessors, (26), 17 states have call successors, (26) [2024-11-22 18:47:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 387 transitions. [2024-11-22 18:47:12,113 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 387 transitions. Word has length 30 [2024-11-22 18:47:12,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:47:12,113 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 387 transitions. [2024-11-22 18:47:12,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-22 18:47:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 387 transitions. [2024-11-22 18:47:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:47:12,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:47:12,114 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-22 18:47:12,117 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 (31)] Ended with exit code 0 [2024-11-22 18:47:12,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-22 18:47:12,317 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_msg_freeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE (and 121 more)] === [2024-11-22 18:47:12,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:47:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash -139481591, now seen corresponding path program 1 times [2024-11-22 18:47:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:47:12,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622072809] [2024-11-22 18:47:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:12,318 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-22 18:47:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:47:12,323 INFO L229 MonitoredProcess]: Starting monitored process 32 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-22 18:47:12,338 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 (32)] Waiting until timeout for monitored process [2024-11-22 18:47:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:12,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 18:47:12,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:12,489 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:47:12,490 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-22 18:47:12,569 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:47:12,569 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-22 18:47:12,687 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 16 treesize of output 13 [2024-11-22 18:47:12,706 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 16 treesize of output 13 [2024-11-22 18:47:12,712 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-22 18:47:12,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:47:12,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:47:12,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622072809] [2024-11-22 18:47:12,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622072809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:47:12,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [664039091] [2024-11-22 18:47:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:47:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:47:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:47:12,797 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 18:47:12,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-11-22 18:47:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:47:12,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 18:47:12,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:47:13,004 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:47:13,004 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-22 18:47:13,092 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 18:47:13,092 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-22 18:47:13,316 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 18 [2024-11-22 18:47:13,539 INFO L349 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2024-11-22 18:47:13,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 32 [2024-11-22 18:47:13,584 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-22 18:47:13,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:47:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [664039091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:47:13,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:47:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 13 [2024-11-22 18:47:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708791150] [2024-11-22 18:47:13,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:47:13,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 18:47:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:47:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 18:47:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-11-22 18:47:13,793 INFO L87 Difference]: Start difference. First operand 339 states and 387 transitions. Second operand has 15 states, 13 states have (on average 2.769230769230769) internal successors, (36), 11 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 18:47:17,843 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]