./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test19-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_test19-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 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:48:11,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:48:11,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:48:11,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:48:11,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:48:11,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:48:11,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:48:11,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:48:11,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:48:11,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:48:11,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:48:11,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:48:11,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:48:11,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:48:11,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:48:11,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:48:11,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:48:11,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:48:11,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:48:11,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:48:11,798 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:48:11,803 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:48:11,803 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:48:11,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:48:11,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:48:11,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:48:11,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:48:11,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:48:11,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:48:11,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:48:11,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:48:11,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:48:11,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:48:11,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:48:11,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:48:11,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:48:11,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:48:11,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:48:11,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:48:11,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:48:11,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:48:11,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:48:11,809 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 -> 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f [2024-11-22 18:48:12,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:48:12,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:48:12,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:48:12,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:48:12,118 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:48:12,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2024-11-22 18:48:13,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:48:13,793 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:48:13,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2024-11-22 18:48:13,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3330f54c0/0454d24859b24c11a605832e98747cbe/FLAGe091474be [2024-11-22 18:48:13,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3330f54c0/0454d24859b24c11a605832e98747cbe [2024-11-22 18:48:13,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:48:13,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:48:13,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:48:13,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:48:13,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:48:13,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:48:13" (1/1) ... [2024-11-22 18:48:13,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f81d380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:13, skipping insertion in model container [2024-11-22 18:48:13,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:48:13" (1/1) ... [2024-11-22 18:48:13,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:48:14,278 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:48:14,383 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:48:14,388 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:48:14,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:48:14,428 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:48:14,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@cf629d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:14, skipping insertion in model container [2024-11-22 18:48:14,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:48:14,429 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 18:48:14,431 INFO L158 Benchmark]: Toolchain (without parser) took 598.89ms. Allocated memory is still 195.0MB. Free memory was 123.3MB in the beginning and 161.0MB in the end (delta: -37.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 18:48:14,431 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 195.0MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:48:14,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.05ms. Allocated memory is still 195.0MB. Free memory was 123.1MB in the beginning and 161.0MB in the end (delta: -37.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 18:48:14,433 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.26ms. Allocated memory is still 195.0MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.05ms. Allocated memory is still 195.0MB. Free memory was 123.1MB in the beginning and 161.0MB in the end (delta: -37.9MB). Peak memory consumption was 18.9MB. 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_test19-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 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:48:16,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:48:16,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 18:48:16,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:48:16,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:48:16,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:48:16,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:48:16,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:48:16,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:48:16,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:48:16,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:48:16,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:48:16,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:48:16,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:48:16,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:48:16,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:48:16,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:48:16,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:48:16,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:48:16,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:48:16,558 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:48:16,562 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:48:16,562 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:48:16,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:48:16,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:48:16,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 18:48:16,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:48:16,566 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 18:48:16,567 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:48:16,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:48:16,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:48:16,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:48:16,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:48:16,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:48:16,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:48:16,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:48:16,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:48:16,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:48:16,569 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 18:48:16,569 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 18:48:16,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:48:16,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:48:16,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:48:16,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:48:16,571 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 -> 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f [2024-11-22 18:48:16,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:48:16,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:48:16,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:48:16,926 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:48:16,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:48:16,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2024-11-22 18:48:18,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:48:18,823 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:48:18,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2024-11-22 18:48:18,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608212bec/440707003e624946a198e8a605f1d07d/FLAGc0c56c0d7 [2024-11-22 18:48:18,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/608212bec/440707003e624946a198e8a605f1d07d [2024-11-22 18:48:18,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:48:18,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:48:18,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:48:18,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:48:18,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:48:18,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:48:18" (1/1) ... [2024-11-22 18:48:18,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a25c8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:18, skipping insertion in model container [2024-11-22 18:48:18,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:48:18" (1/1) ... [2024-11-22 18:48:18,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:48:19,280 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:48:19,341 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:48:19,344 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:48:19,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:48:19,368 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 18:48:19,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:48:19,406 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:48:19,435 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:48:19,436 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:48:19,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:48:19,447 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:48:19,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:48:19,548 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:48:19,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19 WrapperNode [2024-11-22 18:48:19,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:48:19,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:48:19,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:48:19,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:48:19,557 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:48:19" (1/1) ... [2024-11-22 18:48:19,583 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:48:19" (1/1) ... [2024-11-22 18:48:19,607 INFO L138 Inliner]: procedures = 171, calls = 87, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 76 [2024-11-22 18:48:19,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:48:19,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:48:19,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:48:19,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:48:19,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,652 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 0, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 0, 2]. [2024-11-22 18:48:19,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:48:19,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:48:19,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:48:19,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:48:19,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (1/1) ... [2024-11-22 18:48:19,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:48:19,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:48:19,718 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:48:19,722 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:48:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2024-11-22 18:48:19,760 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2024-11-22 18:48:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-22 18:48:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-22 18:48:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:48:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:48:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 18:48:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:48:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:48:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 18:48:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:48:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:48:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 18:48:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:48:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 18:48:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 18:48:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 18:48:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:48:19,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:48:19,900 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:48:19,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:48:20,228 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-22 18:48:20,228 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:48:20,245 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:48:20,245 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 18:48:20,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:48:20 BoogieIcfgContainer [2024-11-22 18:48:20,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:48:20,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:48:20,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:48:20,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:48:20,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:48:18" (1/3) ... [2024-11-22 18:48:20,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7d909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:48:20, skipping insertion in model container [2024-11-22 18:48:20,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:48:19" (2/3) ... [2024-11-22 18:48:20,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7d909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:48:20, skipping insertion in model container [2024-11-22 18:48:20,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:48:20" (3/3) ... [2024-11-22 18:48:20,254 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19-2.i [2024-11-22 18:48:20,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:48:20,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-22 18:48:20,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:48:20,315 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;@455ad3d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:48:20,315 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-22 18:48:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:48:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:48:20,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:20,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:48:20,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:20,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash 340389531, now seen corresponding path program 1 times [2024-11-22 18:48:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437464688] [2024-11-22 18:48:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:20,348 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:48:20,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:20,349 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:48:20,351 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:48:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:20,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:48:20,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:20,555 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:48:20,604 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:48:20,645 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 18:48:20,646 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:48:20,667 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:48:20,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:20,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437464688] [2024-11-22 18:48:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437464688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:20,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:20,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:48:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944433824] [2024-11-22 18:48:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:20,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:48:20,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:48:20,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-22 18:48:20,713 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:48:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:20,920 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-22 18:48:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:48:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2024-11-22 18:48:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:20,934 INFO L225 Difference]: With dead ends: 86 [2024-11-22 18:48:20,934 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 18:48:20,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-22 18:48:20,940 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 32 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:20,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 162 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2024-11-22 18:48:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 18:48:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2024-11-22 18:48:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 68 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:48:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2024-11-22 18:48:20,993 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 8 [2024-11-22 18:48:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:20,994 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2024-11-22 18:48:20,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:48:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2024-11-22 18:48:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 18:48:20,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:20,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:48:21,005 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:48:21,196 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:48:21,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:21,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash 340389532, now seen corresponding path program 1 times [2024-11-22 18:48:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632738474] [2024-11-22 18:48:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:21,198 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:48:21,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:21,200 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:48:21,201 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:48:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:21,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 18:48:21,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:21,314 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:48:21,321 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:48:21,378 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:48:21,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:48:21,414 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:48:21,430 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:48:21,431 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:48:21,448 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:48:21,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:21,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:21,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632738474] [2024-11-22 18:48:21,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632738474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:21,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:48:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808127826] [2024-11-22 18:48:21,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:21,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:48:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:21,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:48:21,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-11-22 18:48:21,455 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:48:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:21,709 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-22 18:48:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:48:21,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2024-11-22 18:48:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:21,711 INFO L225 Difference]: With dead ends: 84 [2024-11-22 18:48:21,711 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 18:48:21,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-11-22 18:48:21,712 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:21,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 169 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2024-11-22 18:48:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 18:48:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2024-11-22 18:48:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 69 states have internal predecessors, (82), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:48:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2024-11-22 18:48:21,726 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 8 [2024-11-22 18:48:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:21,727 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2024-11-22 18:48:21,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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:48:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2024-11-22 18:48:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:48:21,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:21,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:48:21,732 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:48:21,931 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:48:21,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:21,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 785062215, now seen corresponding path program 1 times [2024-11-22 18:48:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:21,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140886114] [2024-11-22 18:48:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:21,934 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:48:21,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:21,937 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:48:21,938 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:48:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:22,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 18:48:22,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:22,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:48:22,061 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 20 treesize of output 8 [2024-11-22 18:48:22,073 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:48:22,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:22,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:22,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140886114] [2024-11-22 18:48:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140886114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:22,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:22,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:48:22,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228840999] [2024-11-22 18:48:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:22,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:48:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:22,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:48:22,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:48:22,076 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:48:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:22,176 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2024-11-22 18:48:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:48:22,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2024-11-22 18:48:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:22,178 INFO L225 Difference]: With dead ends: 86 [2024-11-22 18:48:22,178 INFO L226 Difference]: Without dead ends: 86 [2024-11-22 18:48:22,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:48:22,180 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:22,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 318 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:48:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-22 18:48:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-22 18:48:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 72 states have internal predecessors, (86), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:48:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2024-11-22 18:48:22,194 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 15 [2024-11-22 18:48:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:22,195 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2024-11-22 18:48:22,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:48:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2024-11-22 18:48:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 18:48:22,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:22,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:48:22,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 18:48:22,399 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:48:22,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:22,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1011889144, now seen corresponding path program 1 times [2024-11-22 18:48:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:22,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792887669] [2024-11-22 18:48:22,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:22,401 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:48:22,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:22,405 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:48:22,406 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:48:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:22,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:48:22,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:22,513 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:48:22,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:22,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:22,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792887669] [2024-11-22 18:48:22,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792887669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:22,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:22,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:48:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997452708] [2024-11-22 18:48:22,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:22,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:48:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:48:22,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:48:22,519 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:48:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:22,555 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2024-11-22 18:48:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:48:22,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2024-11-22 18:48:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:22,558 INFO L225 Difference]: With dead ends: 84 [2024-11-22 18:48:22,559 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 18:48:22,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:48:22,561 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:22,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 247 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:48:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 18:48:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-22 18:48:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 75 states have internal predecessors, (89), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:48:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2024-11-22 18:48:22,571 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 15 [2024-11-22 18:48:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:22,571 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2024-11-22 18:48:22,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:48:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2024-11-22 18:48:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:48:22,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:22,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:48:22,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:48:22,774 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:48:22,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:22,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1103356198, now seen corresponding path program 1 times [2024-11-22 18:48:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328504399] [2024-11-22 18:48:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:22,776 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:48:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:22,779 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:48:22,780 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:48:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:22,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:48:22,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:22,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:48:22,924 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:48:22,946 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 18:48:22,946 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:48:22,959 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:48:22,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:22,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:22,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328504399] [2024-11-22 18:48:22,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328504399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:22,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:22,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:48:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398673551] [2024-11-22 18:48:22,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:22,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:48:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:22,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:48:22,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-22 18:48:22,962 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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:48:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:23,149 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2024-11-22 18:48:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:48:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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:48:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:23,151 INFO L225 Difference]: With dead ends: 85 [2024-11-22 18:48:23,151 INFO L226 Difference]: Without dead ends: 85 [2024-11-22 18:48:23,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-22 18:48:23,152 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:23,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 192 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2024-11-22 18:48:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-22 18:48:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-22 18:48:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 73 states have internal predecessors, (85), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:48:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-22 18:48:23,166 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 17 [2024-11-22 18:48:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:23,167 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-22 18:48:23,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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:48:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-22 18:48:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:48:23,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:23,168 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:48:23,173 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:48:23,369 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:48:23,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:23,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1103356199, now seen corresponding path program 1 times [2024-11-22 18:48:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959426903] [2024-11-22 18:48:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:23,370 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:48:23,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:23,371 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:48:23,372 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:48:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:23,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 18:48:23,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:23,558 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:48:23,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:48:23,607 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:48:23,618 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:48:23,619 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:48:23,637 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:48:23,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:23,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:23,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959426903] [2024-11-22 18:48:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959426903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:23,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:23,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:48:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419293696] [2024-11-22 18:48:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:23,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:48:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:48:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-11-22 18:48:23,639 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:48:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:23,857 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2024-11-22 18:48:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:48:23,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:48:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:23,859 INFO L225 Difference]: With dead ends: 82 [2024-11-22 18:48:23,859 INFO L226 Difference]: Without dead ends: 82 [2024-11-22 18:48:23,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2024-11-22 18:48:23,860 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:23,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 227 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2024-11-22 18:48:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-22 18:48:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-22 18:48:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 71 states have internal predecessors, (81), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:48:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2024-11-22 18:48:23,870 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 17 [2024-11-22 18:48:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:23,870 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2024-11-22 18:48:23,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:48:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2024-11-22 18:48:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:48:23,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:23,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:48:23,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 18:48:24,072 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:48:24,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:24,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1762424886, now seen corresponding path program 1 times [2024-11-22 18:48:24,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:24,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152367870] [2024-11-22 18:48:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:24,073 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:48:24,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:24,075 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:48:24,076 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:48:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:24,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:48:24,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:24,226 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7|)))) is different from true [2024-11-22 18:48:24,237 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:48:24,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:24,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:24,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152367870] [2024-11-22 18:48:24,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152367870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:24,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:48:24,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369827622] [2024-11-22 18:48:24,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:24,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:48:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:24,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:48:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-22 18:48:24,245 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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:48:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:24,406 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2024-11-22 18:48:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:48:24,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 17 [2024-11-22 18:48:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:24,408 INFO L225 Difference]: With dead ends: 111 [2024-11-22 18:48:24,408 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 18:48:24,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-22 18:48:24,409 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 36 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:24,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 185 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 112 Unchecked, 0.2s Time] [2024-11-22 18:48:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 18:48:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-11-22 18:48:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 78 states have internal predecessors, (90), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2024-11-22 18:48:24,427 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 17 [2024-11-22 18:48:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:24,427 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2024-11-22 18:48:24,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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:48:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2024-11-22 18:48:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:48:24,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:24,433 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] [2024-11-22 18:48:24,438 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:48:24,633 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:48:24,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -466829256, now seen corresponding path program 1 times [2024-11-22 18:48:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:24,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134173128] [2024-11-22 18:48:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:24,635 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:48:24,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:24,636 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:48:24,637 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:48:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:24,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:48:24,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:24,732 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:48:24,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:24,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:24,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134173128] [2024-11-22 18:48:24,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134173128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:24,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:24,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:48:24,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63074806] [2024-11-22 18:48:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:48:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:48:24,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:48:24,735 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:48:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:24,753 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2024-11-22 18:48:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:48:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:48:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:24,755 INFO L225 Difference]: With dead ends: 105 [2024-11-22 18:48:24,755 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 18:48:24,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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:48:24,756 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:24,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 199 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:48:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 18:48:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2024-11-22 18:48:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.391304347826087) internal successors, (96), 84 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-11-22 18:48:24,762 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 23 [2024-11-22 18:48:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:24,762 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-11-22 18:48:24,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:48:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-11-22 18:48:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:48:24,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:24,763 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] [2024-11-22 18:48:24,769 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:48:24,966 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:48:24,967 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:24,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash -466769674, now seen corresponding path program 1 times [2024-11-22 18:48:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:24,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123679154] [2024-11-22 18:48:24,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:24,968 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:48:24,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:24,969 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:48:24,970 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:48:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:25,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 18:48:25,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:25,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:48:25,089 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 16 treesize of output 8 [2024-11-22 18:48:25,099 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:48:25,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:25,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123679154] [2024-11-22 18:48:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123679154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:25,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:48:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264542419] [2024-11-22 18:48:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:25,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:48:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:48:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:48:25,101 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:48:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:25,143 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2024-11-22 18:48:25,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:48:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 23 [2024-11-22 18:48:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:25,144 INFO L225 Difference]: With dead ends: 92 [2024-11-22 18:48:25,144 INFO L226 Difference]: Without dead ends: 92 [2024-11-22 18:48:25,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:48:25,145 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:25,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:48:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-22 18:48:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-22 18:48:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.373134328358209) internal successors, (92), 81 states have internal predecessors, (92), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2024-11-22 18:48:25,150 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 23 [2024-11-22 18:48:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:25,151 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2024-11-22 18:48:25,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:48:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2024-11-22 18:48:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:48:25,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:25,152 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] [2024-11-22 18:48:25,156 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:48:25,353 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:48:25,353 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:25,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash 913057966, now seen corresponding path program 1 times [2024-11-22 18:48:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:25,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551678642] [2024-11-22 18:48:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:25,354 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:48:25,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:25,356 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:48:25,357 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:48:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:25,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 18:48:25,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:25,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:48:25,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:48:25,674 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:48:25,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:29,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551678642] [2024-11-22 18:48:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551678642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1929690418] [2024-11-22 18:48:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:29,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:48:29,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:48:29,763 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:48:29,764 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:48:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:29,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 18:48:29,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:29,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:48:30,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:48:30,136 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:48:30,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1929690418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:30,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:48:30,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-22 18:48:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776286115] [2024-11-22 18:48:30,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:48:30,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:48:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:30,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:48:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2024-11-22 18:48:30,188 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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:48:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:30,339 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-11-22 18:48:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:48:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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 24 [2024-11-22 18:48:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:30,341 INFO L225 Difference]: With dead ends: 98 [2024-11-22 18:48:30,341 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 18:48:30,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2024-11-22 18:48:30,342 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 52 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:30,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 271 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:48:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 18:48:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-22 18:48:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.352112676056338) internal successors, (96), 85 states have internal predecessors, (96), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2024-11-22 18:48:30,351 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 24 [2024-11-22 18:48:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:30,351 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2024-11-22 18:48:30,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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:48:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2024-11-22 18:48:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:48:30,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:30,352 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] [2024-11-22 18:48:30,356 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:48:30,555 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:48:30,753 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:48:30,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:30,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1759974027, now seen corresponding path program 1 times [2024-11-22 18:48:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027706698] [2024-11-22 18:48:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:30,754 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:48:30,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:30,755 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:48:30,756 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:48:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:30,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 18:48:30,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:30,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:48:30,874 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:48:31,011 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:48:31,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 18:48:31,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:48:31,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2024-11-22 18:48:31,569 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 31 treesize of output 15 [2024-11-22 18:48:31,626 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:48:31,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:32,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027706698] [2024-11-22 18:48:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027706698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778644070] [2024-11-22 18:48:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:48:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:48:32,026 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 18:48:32,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-22 18:48:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:32,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:48:32,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:32,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:48:36,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:48:36,647 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:48:36,658 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:48:36,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1778644070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:36,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:48:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2024-11-22 18:48:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146980444] [2024-11-22 18:48:36,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:48:36,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 18:48:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 18:48:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2024-11-22 18:48:36,812 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 18 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 4 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:48:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:39,170 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2024-11-22 18:48:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 18:48:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 4 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 25 [2024-11-22 18:48:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:39,171 INFO L225 Difference]: With dead ends: 205 [2024-11-22 18:48:39,171 INFO L226 Difference]: Without dead ends: 205 [2024-11-22 18:48:39,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=277, Invalid=1614, Unknown=1, NotChecked=0, Total=1892 [2024-11-22 18:48:39,173 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 328 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:39,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 341 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 18:48:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-22 18:48:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 102. [2024-11-22 18:48:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 89 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2024-11-22 18:48:39,178 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 25 [2024-11-22 18:48:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:39,178 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2024-11-22 18:48:39,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 4 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:48:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2024-11-22 18:48:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:48:39,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:39,180 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] [2024-11-22 18:48:39,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-22 18:48:39,387 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:48:39,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:48:39,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:39,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2049303106, now seen corresponding path program 1 times [2024-11-22 18:48:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561328630] [2024-11-22 18:48:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:39,585 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:48:39,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:39,588 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:48:39,589 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:48:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:39,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:48:39,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:39,810 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:48:39,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:39,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561328630] [2024-11-22 18:48:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561328630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:39,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:39,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:48:39,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164100531] [2024-11-22 18:48:39,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:39,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:48:39,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:39,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:48:39,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:48:39,812 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:40,205 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2024-11-22 18:48:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:48:40,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-22 18:48:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:40,206 INFO L225 Difference]: With dead ends: 112 [2024-11-22 18:48:40,207 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 18:48:40,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:48:40,207 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:40,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 194 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:48:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 18:48:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2024-11-22 18:48:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 90 states have internal predecessors, (103), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-11-22 18:48:40,212 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 27 [2024-11-22 18:48:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:40,212 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-11-22 18:48:40,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-11-22 18:48:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:48:40,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:40,213 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] [2024-11-22 18:48:40,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-22 18:48:40,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:48:40,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:40,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2049303105, now seen corresponding path program 1 times [2024-11-22 18:48:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:40,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044119156] [2024-11-22 18:48:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:40,415 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:48:40,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:40,416 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 18:48:40,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-22 18:48:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:40,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 18:48:40,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:40,758 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:48:40,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:40,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044119156] [2024-11-22 18:48:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044119156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:40,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:48:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555793101] [2024-11-22 18:48:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:40,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:48:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:48:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:48:40,763 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:41,027 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-22 18:48:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:48:41,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-22 18:48:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:41,029 INFO L225 Difference]: With dead ends: 113 [2024-11-22 18:48:41,029 INFO L226 Difference]: Without dead ends: 113 [2024-11-22 18:48:41,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:48:41,029 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:41,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 217 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:48:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-22 18:48:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-22 18:48:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.345679012345679) internal successors, (109), 95 states have internal predecessors, (109), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-11-22 18:48:41,034 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 27 [2024-11-22 18:48:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:41,034 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-11-22 18:48:41,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-11-22 18:48:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:48:41,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:41,035 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:48:41,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-22 18:48:41,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 18:48:41,236 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:41,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1275380112, now seen corresponding path program 1 times [2024-11-22 18:48:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:41,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962174673] [2024-11-22 18:48:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:41,237 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:48:41,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:41,239 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:48:41,245 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:48:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:41,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:48:41,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:41,349 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:48:41,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:48:41,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-22 18:48:41,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 18:48:41,592 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 19 treesize of output 11 [2024-11-22 18:48:41,611 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:48:41,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:41,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962174673] [2024-11-22 18:48:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962174673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:41,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1506271030] [2024-11-22 18:48:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:48:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:48:41,894 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:48:41,895 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:48:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:42,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 18:48:42,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:42,028 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:48:42,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:48:42,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-22 18:48:42,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 18:48:42,205 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 19 treesize of output 11 [2024-11-22 18:48:42,218 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:48:42,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:46,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1506271030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:46,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:48:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-22 18:48:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574094838] [2024-11-22 18:48:46,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:48:46,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:48:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:46,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:48:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:48:46,395 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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:48:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:46,974 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-11-22 18:48:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:48:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2024-11-22 18:48:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:46,976 INFO L225 Difference]: With dead ends: 116 [2024-11-22 18:48:46,976 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 18:48:46,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:48:46,976 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:46,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 287 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 18:48:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 18:48:46,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-22 18:48:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 99 states have internal predecessors, (113), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-22 18:48:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2024-11-22 18:48:46,981 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 26 [2024-11-22 18:48:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:46,981 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2024-11-22 18:48:46,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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:48:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2024-11-22 18:48:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:48:46,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:46,985 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] [2024-11-22 18:48:46,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 18:48:47,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-22 18:48:47,387 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:48:47,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:47,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -762676177, now seen corresponding path program 1 times [2024-11-22 18:48:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903342475] [2024-11-22 18:48:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:47,388 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:48:47,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:47,389 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:48:47,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 (19)] Waiting until timeout for monitored process [2024-11-22 18:48:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:47,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:48:47,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:47,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:48:47,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:48:47,564 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:48:47,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:47,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:47,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903342475] [2024-11-22 18:48:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903342475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:47,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:48:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491700882] [2024-11-22 18:48:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:48:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:48:47,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:48:47,566 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:48:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:47,699 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-11-22 18:48:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:48:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2024-11-22 18:48:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:47,700 INFO L225 Difference]: With dead ends: 93 [2024-11-22 18:48:47,700 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 18:48:47,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:48:47,701 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:47,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:48:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 18:48:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-22 18:48:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 76 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:48:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-22 18:48:47,704 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 26 [2024-11-22 18:48:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:47,705 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-22 18:48:47,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:48:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-22 18:48:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:48:47,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:47,707 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:48:47,712 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:48:47,907 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:48:47,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:47,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 896113127, now seen corresponding path program 1 times [2024-11-22 18:48:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792925104] [2024-11-22 18:48:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:47,909 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:48:47,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:47,912 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:48:47,913 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:48:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:48,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 18:48:48,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:48,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:48:48,298 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:48:48,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:48,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792925104] [2024-11-22 18:48:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792925104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:48:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532986926] [2024-11-22 18:48:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:48,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:48:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:48:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:48:48,300 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:48,674 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-22 18:48:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:48:48,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-22 18:48:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:48,675 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:48:48,676 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:48:48,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:48:48,676 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 13 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:48,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 392 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:48:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:48:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-22 18:48:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 76 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:48:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-22 18:48:48,679 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 28 [2024-11-22 18:48:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-22 18:48:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-22 18:48:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:48:48,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:48,680 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] [2024-11-22 18:48:48,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 (20)] Forceful destruction successful, exit code 0 [2024-11-22 18:48:48,881 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:48:48,881 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:48,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2049269858, now seen corresponding path program 1 times [2024-11-22 18:48:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:48,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825396483] [2024-11-22 18:48:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:48,882 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:48:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:48,883 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:48:48,884 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:48:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:48,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 18:48:48,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:49,116 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:48:49,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:49,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825396483] [2024-11-22 18:48:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825396483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:49,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:49,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:48:49,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533226654] [2024-11-22 18:48:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:49,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:48:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:49,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:48:49,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:48:49,118 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:49,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:49,537 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-11-22 18:48:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:48:49,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-22 18:48:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:49,538 INFO L225 Difference]: With dead ends: 98 [2024-11-22 18:48:49,538 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 18:48:49,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:48:49,539 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 44 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:49,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 173 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:48:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 18:48:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-11-22 18:48:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 79 states have internal predecessors, (90), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:48:49,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2024-11-22 18:48:49,544 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 27 [2024-11-22 18:48:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:49,545 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2024-11-22 18:48:49,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2024-11-22 18:48:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:48:49,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:49,546 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] [2024-11-22 18:48:49,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-22 18:48:49,747 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:48:49,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:49,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2049269857, now seen corresponding path program 1 times [2024-11-22 18:48:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203474810] [2024-11-22 18:48:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:49,748 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:48:49,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:49,749 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:48:49,750 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:48:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:49,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:48:49,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:50,036 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:48:50,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:48:50,070 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:48:50,097 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:48:50,097 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:48:50,237 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:48:50,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:50,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203474810] [2024-11-22 18:48:50,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203474810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:50,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:50,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:48:50,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790880774] [2024-11-22 18:48:50,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:50,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:48:50,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:50,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:48:50,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-22 18:48:50,239 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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:48:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:50,849 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-11-22 18:48:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:48:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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 27 [2024-11-22 18:48:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:50,850 INFO L225 Difference]: With dead ends: 97 [2024-11-22 18:48:50,850 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 18:48:50,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2024-11-22 18:48:50,851 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 62 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:50,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 171 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 101 Unchecked, 0.5s Time] [2024-11-22 18:48:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 18:48:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-11-22 18:48:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 78 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:48:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-22 18:48:50,856 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 27 [2024-11-22 18:48:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:50,857 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-22 18:48:50,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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:48:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-22 18:48:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 18:48:50,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:50,857 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, 1] [2024-11-22 18:48:50,863 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 (22)] Ended with exit code 0 [2024-11-22 18:48:51,063 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:48:51,063 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2009703198, now seen corresponding path program 1 times [2024-11-22 18:48:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559750157] [2024-11-22 18:48:51,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:51,064 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:48:51,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:51,065 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:48:51,066 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:48:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:51,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:48:51,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:51,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:48:52,359 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:48:52,514 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:48:52,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:48:52,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:52,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559750157] [2024-11-22 18:48:52,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559750157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:48:52,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:48:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:48:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213813362] [2024-11-22 18:48:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:48:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:48:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:52,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:48:52,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:48:52,516 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:53,793 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-22 18:48:53,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:48:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-22 18:48:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:53,794 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:48:53,794 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:48:53,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:48:53,795 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 58 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:53,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 245 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-22 18:48:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:48:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-22 18:48:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 78 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:48:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-22 18:48:53,799 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 29 [2024-11-22 18:48:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:53,799 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-22 18:48:53,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:48:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-11-22 18:48:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:48:53,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:53,800 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:48:53,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-22 18:48:54,001 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:48:54,001 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:48:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:48:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash 897143893, now seen corresponding path program 1 times [2024-11-22 18:48:54,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:48:54,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082491554] [2024-11-22 18:48:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:54,002 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:48:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:48:54,003 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:48:54,004 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:48:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:54,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 18:48:54,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:54,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:48:54,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:48:54,744 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:48:54,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:59,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:48:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082491554] [2024-11-22 18:48:59,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082491554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [632481748] [2024-11-22 18:48:59,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:48:59,045 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:48:59,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:48:59,046 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:48:59,047 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:48:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:48:59,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 18:48:59,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:48:59,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:48:59,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:48:59,485 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:48:59,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:48:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [632481748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:48:59,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:48:59,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-22 18:48:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123900909] [2024-11-22 18:48:59,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:48:59,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:48:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:48:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:48:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2024-11-22 18:48:59,552 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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:48:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:48:59,874 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-22 18:48:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:48:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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 28 [2024-11-22 18:48:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:48:59,875 INFO L225 Difference]: With dead ends: 89 [2024-11-22 18:48:59,875 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 18:48:59,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=58, Invalid=213, Unknown=1, NotChecked=0, Total=272 [2024-11-22 18:48:59,876 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:48:59,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:48:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 18:48:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-22 18:48:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.303030303030303) internal successors, (86), 77 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:48:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-22 18:48:59,879 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2024-11-22 18:48:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:48:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-22 18:48:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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:48:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-22 18:48:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:48:59,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:48:59,880 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, 1, 1] [2024-11-22 18:48:59,887 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:49:00,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-22 18:49:00,281 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:49:00,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:00,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2123710263, now seen corresponding path program 1 times [2024-11-22 18:49:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538870141] [2024-11-22 18:49:00,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:00,282 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:49:00,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:00,283 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:49:00,284 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:49:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:00,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 18:49:00,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:00,394 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:49:00,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:49:00,604 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 19 treesize of output 11 [2024-11-22 18:49:00,643 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:49:00,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:49:00,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:00,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538870141] [2024-11-22 18:49:00,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538870141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:49:00,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:49:00,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:49:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274323379] [2024-11-22 18:49:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:49:00,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:49:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:49:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:49:00,645 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:49:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:49:01,101 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2024-11-22 18:49:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:49:01,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-22 18:49:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:49:01,102 INFO L225 Difference]: With dead ends: 94 [2024-11-22 18:49:01,102 INFO L226 Difference]: Without dead ends: 94 [2024-11-22 18:49:01,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:49:01,103 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:49:01,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 301 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:49:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-22 18:49:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-22 18:49:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 81 states have internal predecessors, (91), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:49:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2024-11-22 18:49:01,109 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 30 [2024-11-22 18:49:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:49:01,109 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2024-11-22 18:49:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 18:49:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2024-11-22 18:49:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 18:49:01,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:49:01,110 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, 1] [2024-11-22 18:49:01,114 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 (26)] Forceful destruction successful, exit code 0 [2024-11-22 18:49:01,310 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:49:01,311 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:01,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2042088928, now seen corresponding path program 1 times [2024-11-22 18:49:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:01,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128000285] [2024-11-22 18:49:01,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:01,311 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:49:01,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:01,313 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:49:01,314 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:49:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:01,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:49:01,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:01,416 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:49:01,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:49:01,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128000285] [2024-11-22 18:49:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128000285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:49:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:49:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:49:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231438964] [2024-11-22 18:49:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:49:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:49:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:49:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:49:01,417 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:49:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:49:01,441 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-22 18:49:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:49:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 29 [2024-11-22 18:49:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:49:01,442 INFO L225 Difference]: With dead ends: 93 [2024-11-22 18:49:01,442 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 18:49:01,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:49:01,443 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:49:01,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:49:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 18:49:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 18:49:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.267605633802817) internal successors, (90), 81 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:49:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-22 18:49:01,450 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 29 [2024-11-22 18:49:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:49:01,450 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-22 18:49:01,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:49:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-22 18:49:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 18:49:01,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:49:01,451 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, 1] [2024-11-22 18:49:01,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 (27)] Forceful destruction successful, exit code 0 [2024-11-22 18:49:01,654 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:49:01,655 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2041657022, now seen corresponding path program 1 times [2024-11-22 18:49:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921770367] [2024-11-22 18:49:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:01,656 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:49:01,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:01,657 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:49:01,658 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:49:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:01,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 18:49:01,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:01,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:49:02,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:49:02,190 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:49:02,229 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:49:02,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:49:06,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921770367] [2024-11-22 18:49:06,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921770367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:49:06,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1742445728] [2024-11-22 18:49:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:06,535 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:49:06,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:49:06,536 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:49:06,537 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:49:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:06,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 18:49:06,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:06,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:49:06,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:49:07,044 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:49:07,050 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:49:07,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:49:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1742445728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:49:11,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:49:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-22 18:49:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040277803] [2024-11-22 18:49:11,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:49:11,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:49:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:11,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:49:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2024-11-22 18:49:11,477 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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:49:15,531 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:49:19,559 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:49:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:49:20,488 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-11-22 18:49:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:49:20,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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 29 [2024-11-22 18:49:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:49:20,490 INFO L225 Difference]: With dead ends: 93 [2024-11-22 18:49:20,490 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 18:49:20,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=58, Invalid=213, Unknown=1, NotChecked=0, Total=272 [2024-11-22 18:49:20,490 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:49:20,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 245 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-22 18:49:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 18:49:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-22 18:49:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 80 states have internal predecessors, (89), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:49:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-22 18:49:20,493 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 29 [2024-11-22 18:49:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:49:20,494 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-22 18:49:20,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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:49:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-22 18:49:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:49:20,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:49:20,494 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, 1, 1] [2024-11-22 18:49:20,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2024-11-22 18:49:20,698 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:49:20,895 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:49:20,895 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:20,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -770400566, now seen corresponding path program 1 times [2024-11-22 18:49:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:20,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438510411] [2024-11-22 18:49:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:20,896 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:49:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:20,897 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:49:20,898 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:49:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:20,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:49:20,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:21,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:49:21,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:49:21,194 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:49:21,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:49:21,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438510411] [2024-11-22 18:49:21,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438510411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:49:21,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:49:21,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:49:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363524248] [2024-11-22 18:49:21,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:49:21,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:49:21,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:49:21,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:49:21,196 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:49:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:49:21,322 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-22 18:49:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:49:21,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-22 18:49:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:49:21,325 INFO L225 Difference]: With dead ends: 90 [2024-11-22 18:49:21,325 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 18:49:21,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:49:21,326 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:49:21,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:49:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 18:49:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 18:49:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 78 states have internal predecessors, (86), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:49:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2024-11-22 18:49:21,331 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 30 [2024-11-22 18:49:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:49:21,332 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2024-11-22 18:49:21,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:49:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-11-22 18:49:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:49:21,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:49:21,333 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, 1, 1] [2024-11-22 18:49:21,337 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:49:21,533 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:49:21,533 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:21,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:21,534 INFO L85 PathProgramCache]: Analyzing trace with hash -69335988, now seen corresponding path program 1 times [2024-11-22 18:49:21,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502414665] [2024-11-22 18:49:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:21,534 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:49:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:21,535 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:49:21,536 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:49:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:21,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 18:49:21,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:21,652 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:49:21,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:49:21,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:21,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502414665] [2024-11-22 18:49:21,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502414665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:49:21,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:49:21,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:49:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752389724] [2024-11-22 18:49:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:49:21,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:49:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:21,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:49:21,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:49:21,653 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:49:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:49:21,704 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-22 18:49:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:49:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-22 18:49:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:49:21,705 INFO L225 Difference]: With dead ends: 82 [2024-11-22 18:49:21,705 INFO L226 Difference]: Without dead ends: 82 [2024-11-22 18:49:21,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:49:21,706 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:49:21,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:49:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-22 18:49:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-11-22 18:49:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 71 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:49:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-22 18:49:21,708 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 30 [2024-11-22 18:49:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:49:21,708 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-22 18:49:21,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 18:49:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-22 18:49:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:49:21,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:49:21,709 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, 1, 1] [2024-11-22 18:49:21,713 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:49:21,910 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:49:21,910 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:21,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1133141641, now seen corresponding path program 1 times [2024-11-22 18:49:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:21,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27732939] [2024-11-22 18:49:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:21,911 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:49:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:21,912 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:49:21,913 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:49:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:22,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:49:22,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:22,057 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:49:22,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:49:22,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-22 18:49:22,384 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-22 18:49:22,481 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2024-11-22 18:49:22,481 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 25 treesize of output 28 [2024-11-22 18:49:22,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 18:49:22,696 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 19 treesize of output 11 [2024-11-22 18:49:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-22 18:49:22,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:49:31,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:31,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27732939] [2024-11-22 18:49:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27732939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:49:31,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [173305717] [2024-11-22 18:49:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 18:49:31,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 18:49:31,414 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:49:31,415 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:49:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:31,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 18:49:31,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:31,606 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:49:31,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:49:31,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-22 18:49:31,752 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:49:31,810 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-22 18:49:31,810 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 18 treesize of output 24 [2024-11-22 18:49:31,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 18:49:31,978 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 19 treesize of output 11 [2024-11-22 18:49:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-22 18:49:31,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:49:40,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [173305717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:49:40,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:49:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2024-11-22 18:49:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902724300] [2024-11-22 18:49:40,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:49:40,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:49:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:40,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:49:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=171, Unknown=4, NotChecked=54, Total=272 [2024-11-22 18:49:40,391 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:49:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:49:41,158 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2024-11-22 18:49:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:49:41,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-22 18:49:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:49:41,159 INFO L225 Difference]: With dead ends: 84 [2024-11-22 18:49:41,159 INFO L226 Difference]: Without dead ends: 84 [2024-11-22 18:49:41,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=60, Invalid=249, Unknown=5, NotChecked=66, Total=380 [2024-11-22 18:49:41,160 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:49:41,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 228 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 196 Invalid, 0 Unknown, 142 Unchecked, 0.6s Time] [2024-11-22 18:49:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-22 18:49:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-22 18:49:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.203125) internal successors, (77), 74 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:49:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2024-11-22 18:49:41,166 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 30 [2024-11-22 18:49:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:49:41,166 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2024-11-22 18:49:41,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:49:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2024-11-22 18:49:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:49:41,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:49:41,167 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, 1, 1] [2024-11-22 18:49:41,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2024-11-22 18:49:41,371 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 (32)] Forceful destruction successful, exit code 0 [2024-11-22 18:49:41,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:49:41,568 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:41,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1373234037, now seen corresponding path program 1 times [2024-11-22 18:49:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530657220] [2024-11-22 18:49:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:41,569 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:49:41,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:41,570 INFO L229 MonitoredProcess]: Starting monitored process 34 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:49:41,572 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 (34)] Waiting until timeout for monitored process [2024-11-22 18:49:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:41,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 18:49:41,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:41,723 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:49:41,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:49:41,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530657220] [2024-11-22 18:49:41,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530657220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:49:41,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:49:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:49:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351455124] [2024-11-22 18:49:41,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:49:41,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:49:41,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:49:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:49:41,725 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:49:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:49:41,795 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-11-22 18:49:41,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:49:41,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2024-11-22 18:49:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:49:41,796 INFO L225 Difference]: With dead ends: 87 [2024-11-22 18:49:41,796 INFO L226 Difference]: Without dead ends: 87 [2024-11-22 18:49:41,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:49:41,797 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:49:41,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 264 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:49:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-22 18:49:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-22 18:49:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 77 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:49:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2024-11-22 18:49:41,800 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 30 [2024-11-22 18:49:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:49:41,800 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2024-11-22 18:49:41,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:49:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2024-11-22 18:49:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 18:49:41,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:49:41,801 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, 1, 1, 1, 1, 1] [2024-11-22 18:49:41,804 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 (34)] Forceful destruction successful, exit code 0 [2024-11-22 18:49:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:49:42,001 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (and 21 more)] === [2024-11-22 18:49:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:49:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1710835094, now seen corresponding path program 1 times [2024-11-22 18:49:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 18:49:42,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572877690] [2024-11-22 18:49:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:49:42,002 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:49:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 18:49:42,003 INFO L229 MonitoredProcess]: Starting monitored process 35 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:49:42,004 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 (35)] Waiting until timeout for monitored process [2024-11-22 18:49:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:49:42,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 18:49:42,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:49:42,219 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 18:49:42,219 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:49:42,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:49:42,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-22 18:49:50,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:49:50,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2024-11-22 18:49:50,758 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:49:50,784 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:49:50,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:49:50,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 18:49:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572877690] [2024-11-22 18:49:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572877690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:49:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:49:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:49:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371338167] [2024-11-22 18:49:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:49:50,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:49:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 18:49:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:49:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=99, Unknown=2, NotChecked=0, Total=132 [2024-11-22 18:49:50,786 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)