./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:21:33,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:21:33,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:21:33,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:21:33,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:21:33,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:21:33,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:21:33,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:21:33,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:21:34,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:21:34,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:21:34,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:21:34,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:21:34,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:21:34,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:21:34,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:21:34,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:21:34,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:21:34,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:21:34,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:21:34,009 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:21:34,009 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:21:34,010 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:21:34,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:21:34,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:21:34,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:21:34,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:21:34,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:21:34,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:21:34,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:21:34,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:21:34,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:21:34,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:21:34,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:21:34,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:21:34,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:21:34,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:21:34,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:21:34,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:21:34,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:21:34,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:21:34,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:21:34,016 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2024-10-24 16:21:34,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:21:34,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:21:34,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:21:34,288 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:21:34,289 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:21:34,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-10-24 16:21:35,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:21:36,079 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:21:36,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-10-24 16:21:36,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9630c99/4ebccb888888471aa9dbb1c4b6536c34/FLAGc485a374e [2024-10-24 16:21:36,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9630c99/4ebccb888888471aa9dbb1c4b6536c34 [2024-10-24 16:21:36,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:21:36,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:21:36,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:21:36,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:21:36,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:21:36,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:21:36" (1/1) ... [2024-10-24 16:21:36,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147d17f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:36, skipping insertion in model container [2024-10-24 16:21:36,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:21:36" (1/1) ... [2024-10-24 16:21:36,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:21:36,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:21:36,588 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 16:21:36,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ad4a59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:36, skipping insertion in model container [2024-10-24 16:21:36,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:21:36,589 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:21:36,592 INFO L158 Benchmark]: Toolchain (without parser) took 468.91ms. Allocated memory is still 151.0MB. Free memory was 94.1MB in the beginning and 76.9MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 16:21:36,592 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 151.0MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:21:36,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.83ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:21:36,595 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.32ms. Allocated memory is still 151.0MB. Free memory is still 110.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.83ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.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 e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:21:38,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:21:38,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:21:38,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:21:38,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:21:38,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:21:38,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:21:38,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:21:38,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:21:38,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:21:38,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:21:38,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:21:38,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:21:38,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:21:38,746 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:21:38,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:21:38,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:21:38,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:21:38,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:21:38,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:21:38,752 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:21:38,753 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:21:38,753 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:21:38,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:21:38,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:21:38,754 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:21:38,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:21:38,754 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:21:38,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:21:38,755 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:21:38,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:21:38,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:21:38,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:21:38,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:21:38,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:21:38,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:21:38,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:21:38,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:21:38,760 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:21:38,760 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:21:38,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:21:38,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:21:38,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:21:38,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:21:38,762 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:21:38,762 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 -> e403b28035008257649d82a96310933a0e656461d578ec0892b41718c92e86af [2024-10-24 16:21:39,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:21:39,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:21:39,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:21:39,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:21:39,141 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:21:39,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-10-24 16:21:40,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:21:40,960 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:21:40,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2024-10-24 16:21:40,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63675c36/77189eb34a8e4645846c4a486d9cdc6d/FLAG032f95c32 [2024-10-24 16:21:41,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63675c36/77189eb34a8e4645846c4a486d9cdc6d [2024-10-24 16:21:41,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:21:41,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:21:41,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:21:41,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:21:41,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:21:41,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:41,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7595c78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41, skipping insertion in model container [2024-10-24 16:21:41,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:41,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:21:41,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:21:41,736 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:21:41,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:21:41,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:21:41,805 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:21:41,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:21:41,901 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:21:41,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41 WrapperNode [2024-10-24 16:21:41,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:21:41,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:21:41,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:21:41,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:21:41,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:41,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:41,981 INFO L138 Inliner]: procedures = 167, calls = 80, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 65 [2024-10-24 16:21:41,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:21:41,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:21:41,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:21:41,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:21:41,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:41,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:41,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,025 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 8 writes are split as follows [0, 8]. [2024-10-24 16:21:42,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:21:42,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:21:42,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:21:42,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:21:42,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (1/1) ... [2024-10-24 16:21:42,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:21:42,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:21:42,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:21:42,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:21:42,138 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-10-24 16:21:42,139 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-10-24 16:21:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-24 16:21:42,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-24 16:21:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 16:21:42,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 16:21:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-10-24 16:21:42,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-10-24 16:21:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:21:42,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:21:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:21:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:21:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:21:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:21:42,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:21:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 16:21:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 16:21:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-10-24 16:21:42,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-10-24 16:21:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:21:42,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:21:42,322 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:21:42,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:21:42,769 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-24 16:21:42,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:21:42,829 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:21:42,830 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 16:21:42,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:21:42 BoogieIcfgContainer [2024-10-24 16:21:42,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:21:42,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:21:42,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:21:42,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:21:42,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:21:41" (1/3) ... [2024-10-24 16:21:42,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b457ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:21:42, skipping insertion in model container [2024-10-24 16:21:42,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:21:41" (2/3) ... [2024-10-24 16:21:42,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b457ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:21:42, skipping insertion in model container [2024-10-24 16:21:42,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:21:42" (3/3) ... [2024-10-24 16:21:42,840 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2024-10-24 16:21:42,854 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:21:42,855 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2024-10-24 16:21:42,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:21:42,904 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;@54d18375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:21:42,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2024-10-24 16:21:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 33 states have (on average 2.090909090909091) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 16:21:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:21:42,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:42,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:42,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2013665599, now seen corresponding path program 1 times [2024-10-24 16:21:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:42,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691772756] [2024-10-24 16:21:42,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:42,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:42,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:42,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:42,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 16:21:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:43,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:21:43,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:43,298 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-24 16:21:43,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-24 16:21:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:43,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:43,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691772756] [2024-10-24 16:21:43,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691772756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:43,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:43,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:21:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389811176] [2024-10-24 16:21:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:43,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:21:43,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:43,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:21:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2024-10-24 16:21:43,426 INFO L87 Difference]: Start difference. First operand has 76 states, 33 states have (on average 2.090909090909091) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:44,067 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2024-10-24 16:21:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:21:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:21:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:44,078 INFO L225 Difference]: With dead ends: 112 [2024-10-24 16:21:44,079 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 16:21:44,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=70, Unknown=1, NotChecked=0, Total=110 [2024-10-24 16:21:44,083 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 146 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 17 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:44,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 93 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 263 Invalid, 26 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:21:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 16:21:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 73. [2024-10-24 16:21:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 63 states have internal predecessors, (65), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 16:21:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-10-24 16:21:44,116 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 11 [2024-10-24 16:21:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:44,116 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-10-24 16:21:44,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-10-24 16:21:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:21:44,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:44,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:44,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 16:21:44,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:44,321 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:44,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:44,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2013665600, now seen corresponding path program 1 times [2024-10-24 16:21:44,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:44,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117687155] [2024-10-24 16:21:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:44,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:44,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:44,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:44,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 16:21:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:44,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:21:44,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:44,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:44,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:44,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:44,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:44,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117687155] [2024-10-24 16:21:44,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117687155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:44,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:44,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:21:44,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905689421] [2024-10-24 16:21:44,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:44,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:21:44,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:21:44,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:21:44,775 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:45,477 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2024-10-24 16:21:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:21:45,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:21:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:45,480 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:21:45,480 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:21:45,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:21:45,482 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 162 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:45,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 80 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:21:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:21:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 71. [2024-10-24 16:21:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 61 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 16:21:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2024-10-24 16:21:45,496 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 11 [2024-10-24 16:21:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:45,496 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2024-10-24 16:21:45,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2024-10-24 16:21:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:21:45,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:45,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:45,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 16:21:45,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:45,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:45,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2013715546, now seen corresponding path program 1 times [2024-10-24 16:21:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:45,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241588886] [2024-10-24 16:21:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:45,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:45,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 16:21:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:45,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:21:45,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:45,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:45,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241588886] [2024-10-24 16:21:45,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241588886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:45,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:45,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:21:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537543026] [2024-10-24 16:21:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:45,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:45,792 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:45,882 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-10-24 16:21:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:21:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:45,884 INFO L225 Difference]: With dead ends: 77 [2024-10-24 16:21:45,885 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 16:21:45,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:45,888 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:45,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 244 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 16:21:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-10-24 16:21:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:21:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-10-24 16:21:45,908 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 11 [2024-10-24 16:21:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:45,909 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-10-24 16:21:45,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-10-24 16:21:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:21:45,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:45,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:45,913 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-10-24 16:21:46,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:46,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:46,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash -538441415, now seen corresponding path program 1 times [2024-10-24 16:21:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809589151] [2024-10-24 16:21:46,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:46,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:46,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:46,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:46,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 16:21:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:46,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:21:46,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:46,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:46,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809589151] [2024-10-24 16:21:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809589151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:46,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661092176] [2024-10-24 16:21:46,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:46,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:46,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:46,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:46,301 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:46,640 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2024-10-24 16:21:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:21:46,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:21:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:46,642 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:21:46,642 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:21:46,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:21:46,643 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 59 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:46,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 80 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:21:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2024-10-24 16:21:46,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 70 states have internal predecessors, (77), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:21:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-10-24 16:21:46,658 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 11 [2024-10-24 16:21:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:46,658 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-10-24 16:21:46,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-10-24 16:21:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:21:46,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:46,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:46,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 16:21:46,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:46,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash -538441414, now seen corresponding path program 1 times [2024-10-24 16:21:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:46,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635644599] [2024-10-24 16:21:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:46,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:46,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:46,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:46,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 16:21:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:46,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:21:46,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:47,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:47,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:47,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635644599] [2024-10-24 16:21:47,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635644599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:47,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247126186] [2024-10-24 16:21:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:47,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:47,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:47,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:47,128 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:47,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:47,425 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-10-24 16:21:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:47,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:21:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:47,427 INFO L225 Difference]: With dead ends: 96 [2024-10-24 16:21:47,427 INFO L226 Difference]: Without dead ends: 96 [2024-10-24 16:21:47,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:21:47,428 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:47,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:21:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-24 16:21:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2024-10-24 16:21:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.75) internal successors, (70), 67 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:21:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2024-10-24 16:21:47,437 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 11 [2024-10-24 16:21:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:47,438 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2024-10-24 16:21:47,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2024-10-24 16:21:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:21:47,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:47,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:47,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 16:21:47,641 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-10-24 16:21:47,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:47,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1303708717, now seen corresponding path program 1 times [2024-10-24 16:21:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810108141] [2024-10-24 16:21:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:47,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:47,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:47,647 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-10-24 16:21:47,651 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-10-24 16:21:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:47,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 16:21:47,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:47,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 16:21:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:47,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:47,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:47,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810108141] [2024-10-24 16:21:47,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810108141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:21:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739025461] [2024-10-24 16:21:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:47,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:21:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:47,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:21:47,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:21:47,798 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:48,125 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2024-10-24 16:21:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:21:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-24 16:21:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:48,126 INFO L225 Difference]: With dead ends: 91 [2024-10-24 16:21:48,126 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 16:21:48,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:21:48,128 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 39 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:48,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 255 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:21:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 16:21:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2024-10-24 16:21:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 40 states have (on average 1.725) internal successors, (69), 66 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:21:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2024-10-24 16:21:48,133 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 14 [2024-10-24 16:21:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:48,133 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2024-10-24 16:21:48,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2024-10-24 16:21:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 16:21:48,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:48,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:48,138 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-10-24 16:21:48,336 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-10-24 16:21:48,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1303708718, now seen corresponding path program 1 times [2024-10-24 16:21:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508665819] [2024-10-24 16:21:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:48,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:48,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:48,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:48,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 16:21:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:48,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 16:21:48,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:48,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:21:48,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:21:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:48,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:48,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:48,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508665819] [2024-10-24 16:21:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508665819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:21:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39318776] [2024-10-24 16:21:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:48,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:21:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:21:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:21:48,822 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 11 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:49,741 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-10-24 16:21:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:21:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-24 16:21:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:49,742 INFO L225 Difference]: With dead ends: 86 [2024-10-24 16:21:49,742 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 16:21:49,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:21:49,743 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 58 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:49,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 237 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:21:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 16:21:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2024-10-24 16:21:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.7) internal successors, (68), 65 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:21:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2024-10-24 16:21:49,748 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 14 [2024-10-24 16:21:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:49,748 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2024-10-24 16:21:49,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2024-10-24 16:21:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:21:49,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:49,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:49,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 16:21:49,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:49,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:49,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1760264569, now seen corresponding path program 1 times [2024-10-24 16:21:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:49,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632287191] [2024-10-24 16:21:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:49,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:49,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 16:21:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:50,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:21:50,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:50,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:21:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:50,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:50,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632287191] [2024-10-24 16:21:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632287191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:50,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:50,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:21:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571244556] [2024-10-24 16:21:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:21:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:50,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:21:50,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:21:50,080 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:50,388 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2024-10-24 16:21:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:21:50,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 16:21:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:50,389 INFO L225 Difference]: With dead ends: 93 [2024-10-24 16:21:50,390 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 16:21:50,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:21:50,390 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:50,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 256 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:21:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 16:21:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-10-24 16:21:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 73 states have internal predecessors, (79), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-24 16:21:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-10-24 16:21:50,402 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2024-10-24 16:21:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:50,402 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-10-24 16:21:50,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-10-24 16:21:50,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:21:50,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:50,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:50,409 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-10-24 16:21:50,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:50,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:50,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1760264570, now seen corresponding path program 1 times [2024-10-24 16:21:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958896081] [2024-10-24 16:21:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:50,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:50,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:50,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:50,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 16:21:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:50,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:21:50,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:50,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:21:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:50,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:50,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958896081] [2024-10-24 16:21:50,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958896081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:50,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:50,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:21:50,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343146228] [2024-10-24 16:21:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:50,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:21:50,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:21:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:21:50,811 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:51,255 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2024-10-24 16:21:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:21:51,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 16:21:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:51,256 INFO L225 Difference]: With dead ends: 91 [2024-10-24 16:21:51,256 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 16:21:51,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:21:51,257 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:51,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 325 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:21:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 16:21:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-10-24 16:21:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-24 16:21:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-10-24 16:21:51,262 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 15 [2024-10-24 16:21:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:51,262 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-10-24 16:21:51,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-10-24 16:21:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:21:51,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:51,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:51,270 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-10-24 16:21:51,463 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-10-24 16:21:51,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:51,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1889347288, now seen corresponding path program 1 times [2024-10-24 16:21:51,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:51,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927931992] [2024-10-24 16:21:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:51,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:51,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:51,465 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-10-24 16:21:51,467 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-10-24 16:21:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:51,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:21:51,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:51,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:51,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927931992] [2024-10-24 16:21:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927931992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:51,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:21:51,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118020611] [2024-10-24 16:21:51,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:51,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:51,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:51,568 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:51,625 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2024-10-24 16:21:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:51,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 16:21:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:51,626 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:21:51,626 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:21:51,626 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-10-24 16:21:51,626 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:51,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:21:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 16:21:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 40 states have (on average 1.575) internal successors, (63), 61 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:21:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2024-10-24 16:21:51,632 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 15 [2024-10-24 16:21:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:51,633 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2024-10-24 16:21:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2024-10-24 16:21:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:21:51,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:51,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:51,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 16:21:51,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:51,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:51,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash -602863524, now seen corresponding path program 1 times [2024-10-24 16:21:51,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:51,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121479997] [2024-10-24 16:21:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:51,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:51,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:51,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:51,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 16:21:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:51,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:21:51,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:51,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:51,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121479997] [2024-10-24 16:21:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121479997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:21:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970102095] [2024-10-24 16:21:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:21:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:21:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:21:51,928 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:52,039 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2024-10-24 16:21:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:21:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-24 16:21:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:52,040 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:21:52,040 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:21:52,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:52,041 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:52,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 148 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:21:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 16:21:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.55) internal successors, (62), 60 states have internal predecessors, (62), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:21:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-10-24 16:21:52,044 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 17 [2024-10-24 16:21:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:52,044 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-10-24 16:21:52,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-10-24 16:21:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:21:52,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:52,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:52,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:52,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:52,245 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:52,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash -602863523, now seen corresponding path program 1 times [2024-10-24 16:21:52,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:52,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455201229] [2024-10-24 16:21:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:52,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:52,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:52,247 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:52,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 16:21:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:52,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:21:52,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:52,380 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:52,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455201229] [2024-10-24 16:21:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455201229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:52,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:52,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:21:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833047679] [2024-10-24 16:21:52,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:52,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:21:52,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:52,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:21:52,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:21:52,382 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:52,561 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2024-10-24 16:21:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:21:52,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-24 16:21:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:52,562 INFO L225 Difference]: With dead ends: 71 [2024-10-24 16:21:52,562 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 16:21:52,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:21:52,563 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 64 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:52,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 186 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 16:21:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 16:21:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.525) internal successors, (61), 59 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-24 16:21:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-10-24 16:21:52,566 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 17 [2024-10-24 16:21:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:52,566 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-10-24 16:21:52,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-10-24 16:21:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:21:52,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:52,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:52,571 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-10-24 16:21:52,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:52,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:52,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -349258477, now seen corresponding path program 1 times [2024-10-24 16:21:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:52,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523672486] [2024-10-24 16:21:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:52,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:52,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:52,770 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:52,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 16:21:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:52,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:21:52,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:52,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:52,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523672486] [2024-10-24 16:21:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523672486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:52,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:52,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:21:52,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431350623] [2024-10-24 16:21:52,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:52,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:21:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:21:52,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:52,923 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:53,173 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2024-10-24 16:21:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:21:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-24 16:21:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:53,174 INFO L225 Difference]: With dead ends: 104 [2024-10-24 16:21:53,174 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 16:21:53,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:21:53,175 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 77 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:53,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 89 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:21:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 16:21:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2024-10-24 16:21:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 65 states have internal predecessors, (69), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:21:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-24 16:21:53,178 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 16 [2024-10-24 16:21:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:53,178 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-24 16:21:53,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-24 16:21:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 16:21:53,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:53,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:53,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 16:21:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:53,382 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -349258476, now seen corresponding path program 1 times [2024-10-24 16:21:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726892331] [2024-10-24 16:21:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:53,385 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:53,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 16:21:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:53,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 16:21:53,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:53,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:53,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726892331] [2024-10-24 16:21:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726892331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:53,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:21:53,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226502166] [2024-10-24 16:21:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:53,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:21:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:21:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:21:53,577 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:53,782 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-10-24 16:21:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:21:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-24 16:21:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:53,783 INFO L225 Difference]: With dead ends: 87 [2024-10-24 16:21:53,783 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 16:21:53,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:21:53,784 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:53,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 170 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:21:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 16:21:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-24 16:21:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.489795918367347) internal successors, (73), 70 states have internal predecessors, (73), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-24 16:21:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-10-24 16:21:53,787 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 16 [2024-10-24 16:21:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:53,787 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-10-24 16:21:53,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:21:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-10-24 16:21:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:21:53,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:53,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:53,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-24 16:21:53,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:53,989 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:53,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 213669778, now seen corresponding path program 1 times [2024-10-24 16:21:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977211253] [2024-10-24 16:21:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:53,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:53,991 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:53,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 16:21:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:54,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:21:54,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:54,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:54,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977211253] [2024-10-24 16:21:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977211253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:54,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:54,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:21:54,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183419793] [2024-10-24 16:21:54,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:54,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:21:54,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:54,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:21:54,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:21:54,090 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:21:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:54,238 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-10-24 16:21:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:21:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-24 16:21:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:54,239 INFO L225 Difference]: With dead ends: 86 [2024-10-24 16:21:54,239 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 16:21:54,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:21:54,240 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:54,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 66 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:21:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 16:21:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-24 16:21:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 38 states have (on average 1.605263157894737) internal successors, (61), 58 states have internal predecessors, (61), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:21:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-10-24 16:21:54,243 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 20 [2024-10-24 16:21:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:54,243 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-10-24 16:21:54,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:21:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-10-24 16:21:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:21:54,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:54,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:54,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-24 16:21:54,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:54,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:54,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1533974863, now seen corresponding path program 1 times [2024-10-24 16:21:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042756006] [2024-10-24 16:21:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:54,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:54,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:54,447 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:54,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 16:21:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:54,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:21:54,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:54,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:21:54,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:21:54,775 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-10-24 16:21:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:54,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:54,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042756006] [2024-10-24 16:21:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042756006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:54,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:54,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:21:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030897626] [2024-10-24 16:21:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:54,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:21:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:54,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:21:54,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:21:54,803 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:55,514 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2024-10-24 16:21:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:21:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2024-10-24 16:21:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:55,515 INFO L225 Difference]: With dead ends: 89 [2024-10-24 16:21:55,515 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 16:21:55,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:21:55,515 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 92 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:55,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 169 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:21:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 16:21:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2024-10-24 16:21:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 60 states have internal predecessors, (65), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:21:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-10-24 16:21:55,518 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 23 [2024-10-24 16:21:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:55,519 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-10-24 16:21:55,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-10-24 16:21:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:21:55,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:55,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:55,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:55,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:55,720 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:55,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1533974862, now seen corresponding path program 1 times [2024-10-24 16:21:55,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:55,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987711522] [2024-10-24 16:21:55,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:55,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:55,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:55,724 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:55,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 16:21:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:55,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 16:21:55,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:55,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:21:56,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:21:56,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:21:56,152 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 17 treesize of output 9 [2024-10-24 16:21:56,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:56,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:56,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:56,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987711522] [2024-10-24 16:21:56,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987711522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:56,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:56,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 16:21:56,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710103446] [2024-10-24 16:21:56,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:56,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:21:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:56,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:21:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:21:56,180 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:56,841 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-24 16:21:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:21:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2024-10-24 16:21:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:56,842 INFO L225 Difference]: With dead ends: 83 [2024-10-24 16:21:56,842 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 16:21:56,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:21:56,843 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 75 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:56,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 225 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:21:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 16:21:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2024-10-24 16:21:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 59 states have internal predecessors, (63), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:21:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-10-24 16:21:56,847 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 23 [2024-10-24 16:21:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:56,847 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-10-24 16:21:56,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-10-24 16:21:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:21:56,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:56,848 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:21:56,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-24 16:21:57,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:57,049 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:57,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:57,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1641059162, now seen corresponding path program 1 times [2024-10-24 16:21:57,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:57,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17555934] [2024-10-24 16:21:57,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:57,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:57,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:57,051 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:57,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 16:21:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:57,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 16:21:57,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:57,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:21:57,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:21:57,342 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-10-24 16:21:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:57,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:57,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:57,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17555934] [2024-10-24 16:21:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17555934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:57,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:57,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 16:21:57,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799218372] [2024-10-24 16:21:57,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:57,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:21:57,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:57,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:21:57,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:21:57,417 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:58,237 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-10-24 16:21:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:21:58,237 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-10-24 16:21:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:58,238 INFO L225 Difference]: With dead ends: 88 [2024-10-24 16:21:58,238 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 16:21:58,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:21:58,239 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:58,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 172 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:21:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 16:21:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2024-10-24 16:21:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 63 states have internal predecessors, (73), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:21:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-10-24 16:21:58,242 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 27 [2024-10-24 16:21:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:58,242 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-10-24 16:21:58,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-10-24 16:21:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:21:58,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:58,243 INFO L215 NwaCegarLoop]: trace histogram [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-10-24 16:21:58,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-24 16:21:58,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:58,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:21:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:21:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1641059161, now seen corresponding path program 1 times [2024-10-24 16:21:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:21:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541513844] [2024-10-24 16:21:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:21:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:21:58,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:21:58,448 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:21:58,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-24 16:21:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:21:58,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 16:21:58,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:21:58,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 16:21:58,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:21:58,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:21:58,857 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 17 treesize of output 9 [2024-10-24 16:21:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:21:58,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:21:58,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:21:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541513844] [2024-10-24 16:21:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541513844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:21:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:21:58,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 16:21:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994775146] [2024-10-24 16:21:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:21:58,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:21:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:21:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:21:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:21:58,952 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:21:59,808 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-10-24 16:21:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:21:59,808 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-10-24 16:21:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:21:59,809 INFO L225 Difference]: With dead ends: 82 [2024-10-24 16:21:59,809 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 16:21:59,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:21:59,810 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:21:59,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 252 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:21:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 16:21:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2024-10-24 16:21:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 63 states have internal predecessors, (71), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:21:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2024-10-24 16:21:59,815 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 27 [2024-10-24 16:21:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:21:59,817 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2024-10-24 16:21:59,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:21:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-10-24 16:21:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:21:59,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:21:59,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:21:59,826 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-10-24 16:22:00,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:00,021 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:00,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash 664603292, now seen corresponding path program 1 times [2024-10-24 16:22:00,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:00,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365471787] [2024-10-24 16:22:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:00,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:00,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:00,024 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:22:00,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-24 16:22:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:00,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:22:00,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:00,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:00,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:00,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365471787] [2024-10-24 16:22:00,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365471787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:00,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:00,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:22:00,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706384252] [2024-10-24 16:22:00,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:00,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:22:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:22:00,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:22:00,307 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:00,603 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-10-24 16:22:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 16:22:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2024-10-24 16:22:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:00,603 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:22:00,604 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:22:00,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:22:00,604 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 56 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:00,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 281 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:22:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:22:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-10-24 16:22:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-10-24 16:22:00,607 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2024-10-24 16:22:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:00,607 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-10-24 16:22:00,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-10-24 16:22:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:22:00,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:00,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:00,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-24 16:22:00,809 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-10-24 16:22:00,809 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:00,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash -804854360, now seen corresponding path program 1 times [2024-10-24 16:22:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656823085] [2024-10-24 16:22:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:00,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:00,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:00,813 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-10-24 16:22:00,814 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-10-24 16:22:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:00,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-24 16:22:00,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:00,987 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:22:00,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:22:01,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 16:22:01,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:01,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:22:01,397 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-10-24 16:22:01,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 52 [2024-10-24 16:22:01,417 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-10-24 16:22:01,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 16:22:01,713 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 42 treesize of output 30 [2024-10-24 16:22:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:02,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:02,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:02,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656823085] [2024-10-24 16:22:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656823085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:02,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:02,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 16:22:02,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226376975] [2024-10-24 16:22:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:22:02,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:02,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:22:02,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:22:02,073 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:03,641 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2024-10-24 16:22:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 16:22:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-10-24 16:22:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:03,641 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:22:03,641 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:22:03,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 16:22:03,643 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 54 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 16 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:03,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 283 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 693 Invalid, 5 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 16:22:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:22:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-10-24 16:22:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.5) internal successors, (63), 58 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2024-10-24 16:22:03,645 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 29 [2024-10-24 16:22:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:03,645 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2024-10-24 16:22:03,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2024-10-24 16:22:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:22:03,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:03,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:03,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-24 16:22:03,846 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-10-24 16:22:03,847 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash -804854359, now seen corresponding path program 1 times [2024-10-24 16:22:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365730093] [2024-10-24 16:22:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:03,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:03,849 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:22:03,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-24 16:22:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:03,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-24 16:22:03,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:04,101 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:22:04,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:22:04,127 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:22:04,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:22:04,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:04,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:04,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:22:04,565 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 21 treesize of output 20 [2024-10-24 16:22:04,724 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-10-24 16:22:04,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2024-10-24 16:22:04,843 INFO L349 Elim1Store]: treesize reduction 60, result has 45.9 percent of original size [2024-10-24 16:22:04,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 57 [2024-10-24 16:22:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:05,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:05,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:05,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365730093] [2024-10-24 16:22:05,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365730093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:05,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:05,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 16:22:05,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142787329] [2024-10-24 16:22:05,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:05,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:22:05,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:05,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:22:05,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:22:05,607 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:10,624 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 [] [2024-10-24 16:22:14,862 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 [] [2024-10-24 16:22:18,869 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 [] [2024-10-24 16:22:19,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:19,338 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2024-10-24 16:22:19,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:22:19,338 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-10-24 16:22:19,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:19,339 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:22:19,339 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:22:19,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 16:22:19,340 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 83 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:19,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 805 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2024-10-24 16:22:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:22:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-10-24 16:22:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 58 states have internal predecessors, (62), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-10-24 16:22:19,342 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 29 [2024-10-24 16:22:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:19,343 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-10-24 16:22:19,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-10-24 16:22:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 16:22:19,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:19,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:19,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-10-24 16:22:19,544 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-10-24 16:22:19,544 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:19,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 819318612, now seen corresponding path program 1 times [2024-10-24 16:22:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:19,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424327844] [2024-10-24 16:22:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:19,546 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-10-24 16:22:19,547 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-10-24 16:22:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:19,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 16:22:19,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:19,748 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:22:19,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:22:19,938 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-10-24 16:22:20,001 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-24 16:22:20,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 34 [2024-10-24 16:22:20,009 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-10-24 16:22:20,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-24 16:22:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:20,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:20,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424327844] [2024-10-24 16:22:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424327844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:20,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:20,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 16:22:20,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37129774] [2024-10-24 16:22:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:22:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:20,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:22:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:22:20,482 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:25,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 16:22:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:26,269 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2024-10-24 16:22:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 16:22:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-10-24 16:22:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:26,270 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:22:26,270 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:22:26,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 16:22:26,271 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 115 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 19 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:26,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 172 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 794 Invalid, 4 Unknown, 0 Unchecked, 5.2s Time] [2024-10-24 16:22:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:22:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-10-24 16:22:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 58 states have internal predecessors, (61), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2024-10-24 16:22:26,273 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2024-10-24 16:22:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:26,274 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2024-10-24 16:22:26,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2024-10-24 16:22:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 16:22:26,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:26,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:26,280 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 (24)] Forceful destruction successful, exit code 0 [2024-10-24 16:22:26,479 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 [2024-10-24 16:22:26,479 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash 819318613, now seen corresponding path program 1 times [2024-10-24 16:22:26,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:26,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781483412] [2024-10-24 16:22:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:26,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:26,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:26,481 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:22:26,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-24 16:22:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:26,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-24 16:22:26,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:26,662 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:22:26,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:22:26,902 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-10-24 16:22:26,923 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-10-24 16:22:27,052 INFO L349 Elim1Store]: treesize reduction 33, result has 45.0 percent of original size [2024-10-24 16:22:27,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-10-24 16:22:27,110 INFO L349 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2024-10-24 16:22:27,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-10-24 16:22:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:27,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:27,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781483412] [2024-10-24 16:22:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781483412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:27,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:27,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 16:22:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019979686] [2024-10-24 16:22:27,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:27,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 16:22:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:27,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 16:22:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:22:27,745 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 20 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:32,706 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 [] [2024-10-24 16:22:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:33,592 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2024-10-24 16:22:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 16:22:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-10-24 16:22:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:33,593 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:22:33,593 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:22:33,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 16:22:33,594 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:33,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 201 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 739 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-10-24 16:22:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:22:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-24 16:22:33,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 58 states have internal predecessors, (60), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2024-10-24 16:22:33,596 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 30 [2024-10-24 16:22:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:33,597 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2024-10-24 16:22:33,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:22:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2024-10-24 16:22:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:22:33,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:33,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:33,603 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 (25)] Ended with exit code 0 [2024-10-24 16:22:33,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:33,798 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:33,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 24477985, now seen corresponding path program 1 times [2024-10-24 16:22:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688993681] [2024-10-24 16:22:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:33,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:33,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:33,801 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-10-24 16:22:33,801 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-10-24 16:22:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:33,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:22:33,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:34,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:34,321 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 23 treesize of output 11 [2024-10-24 16:22:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:34,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:34,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688993681] [2024-10-24 16:22:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688993681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:34,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:22:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016408995] [2024-10-24 16:22:34,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:34,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:22:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:22:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:22:34,481 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:22:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:35,324 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2024-10-24 16:22:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:22:35,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 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 33 [2024-10-24 16:22:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:35,325 INFO L225 Difference]: With dead ends: 71 [2024-10-24 16:22:35,325 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 16:22:35,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:22:35,326 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 72 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:35,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 268 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:22:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 16:22:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 16:22:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 58 states have internal predecessors, (59), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2024-10-24 16:22:35,329 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 33 [2024-10-24 16:22:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:35,329 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2024-10-24 16:22:35,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-24 16:22:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2024-10-24 16:22:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:22:35,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:35,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:35,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-24 16:22:35,530 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-10-24 16:22:35,531 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:35,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2048512001, now seen corresponding path program 1 times [2024-10-24 16:22:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308373054] [2024-10-24 16:22:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:35,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:35,533 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-10-24 16:22:35,534 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-10-24 16:22:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:35,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-24 16:22:35,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:35,780 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-24 16:22:35,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:22:35,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 16:22:36,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:36,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:22:36,373 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-10-24 16:22:36,630 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-10-24 16:22:36,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2024-10-24 16:22:36,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-24 16:22:36,966 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 42 treesize of output 30 [2024-10-24 16:22:37,333 INFO L349 Elim1Store]: treesize reduction 48, result has 5.9 percent of original size [2024-10-24 16:22:37,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 23 [2024-10-24 16:22:37,468 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-10-24 16:22:37,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-10-24 16:22:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:37,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:37,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:37,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308373054] [2024-10-24 16:22:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308373054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:37,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-24 16:22:37,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143436945] [2024-10-24 16:22:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:37,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 16:22:37,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:37,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 16:22:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-10-24 16:22:37,532 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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-10-24 16:22:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:39,537 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2024-10-24 16:22:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 16:22:39,537 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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 35 [2024-10-24 16:22:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:39,538 INFO L225 Difference]: With dead ends: 107 [2024-10-24 16:22:39,538 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 16:22:39,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 16:22:39,539 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:39,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 193 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 753 Invalid, 2 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 16:22:39,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 16:22:39,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 72. [2024-10-24 16:22:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 59 states have internal predecessors, (61), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-10-24 16:22:39,542 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 35 [2024-10-24 16:22:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:39,542 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-10-24 16:22:39,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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-10-24 16:22:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-10-24 16:22:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:22:39,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:39,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:39,548 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-10-24 16:22:39,743 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-10-24 16:22:39,743 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:39,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2048512002, now seen corresponding path program 1 times [2024-10-24 16:22:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834472788] [2024-10-24 16:22:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:39,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:39,746 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-10-24 16:22:39,748 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-10-24 16:22:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:39,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-24 16:22:39,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:40,047 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:22:40,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:22:40,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 16:22:40,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:40,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:40,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:22:40,547 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 21 treesize of output 20 [2024-10-24 16:22:40,736 INFO L349 Elim1Store]: treesize reduction 60, result has 45.9 percent of original size [2024-10-24 16:22:40,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 57 [2024-10-24 16:22:40,829 INFO L349 Elim1Store]: treesize reduction 66, result has 35.9 percent of original size [2024-10-24 16:22:40,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2024-10-24 16:22:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:41,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:41,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834472788] [2024-10-24 16:22:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834472788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 16:22:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492165462] [2024-10-24 16:22:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:41,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 16:22:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 16:22:41,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:22:41,484 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-10-24 16:22:46,555 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 [] [2024-10-24 16:22:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:47,092 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2024-10-24 16:22:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 16:22:47,092 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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 35 [2024-10-24 16:22:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:47,093 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:22:47,093 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:22:47,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:22:47,094 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 61 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:47,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 637 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-10-24 16:22:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:22:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 16:22:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 59 states have internal predecessors, (60), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2024-10-24 16:22:47,096 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 35 [2024-10-24 16:22:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:47,097 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2024-10-24 16:22:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-10-24 16:22:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2024-10-24 16:22:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:22:47,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:47,098 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, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:47,103 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-10-24 16:22:47,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 16:22:47,298 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:47,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 986914405, now seen corresponding path program 1 times [2024-10-24 16:22:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:47,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886059168] [2024-10-24 16:22:47,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:47,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:47,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:47,300 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:22:47,301 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 (29)] Waiting until timeout for monitored process [2024-10-24 16:22:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:47,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:22:47,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:47,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:47,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886059168] [2024-10-24 16:22:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886059168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:47,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:47,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:22:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252341893] [2024-10-24 16:22:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:47,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:22:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:22:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:22:47,451 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:22:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:47,604 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2024-10-24 16:22:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:22:47,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-24 16:22:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:47,605 INFO L225 Difference]: With dead ends: 70 [2024-10-24 16:22:47,605 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 16:22:47,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-10-24 16:22:47,606 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:47,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 132 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:22:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 16:22:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-24 16:22:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 57 states have internal predecessors, (58), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:22:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2024-10-24 16:22:47,608 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 39 [2024-10-24 16:22:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2024-10-24 16:22:47,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:22:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2024-10-24 16:22:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 16:22:47,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:47,609 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, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:47,615 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 (29)] Ended with exit code 0 [2024-10-24 16:22:47,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:47,810 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 986914406, now seen corresponding path program 1 times [2024-10-24 16:22:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040254980] [2024-10-24 16:22:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:47,814 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-10-24 16:22:47,815 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-10-24 16:22:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:47,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 16:22:47,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:48,073 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 29 treesize of output 17 [2024-10-24 16:22:48,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-10-24 16:22:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:48,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:22:48,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:22:48,994 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 36 treesize of output 40 [2024-10-24 16:22:49,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:22:49,527 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 65 treesize of output 69 [2024-10-24 16:22:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:50,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:50,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040254980] [2024-10-24 16:22:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040254980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:22:50,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:22:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-10-24 16:22:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772919394] [2024-10-24 16:22:50,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:22:50,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 16:22:50,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 16:22:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:22:50,790 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:22:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:53,810 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2024-10-24 16:22:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:22:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2024-10-24 16:22:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:53,812 INFO L225 Difference]: With dead ends: 75 [2024-10-24 16:22:53,812 INFO L226 Difference]: Without dead ends: 75 [2024-10-24 16:22:53,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:22:53,812 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:53,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 327 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 16:22:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-24 16:22:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-24 16:22:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 61 states have internal predecessors, (63), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:22:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-10-24 16:22:53,818 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 39 [2024-10-24 16:22:53,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:53,818 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-10-24 16:22:53,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 16:22:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-10-24 16:22:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:22:53,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:53,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:53,823 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 (30)] Forceful destruction successful, exit code 0 [2024-10-24 16:22:54,019 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-10-24 16:22:54,019 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:54,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash 527405244, now seen corresponding path program 1 times [2024-10-24 16:22:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851872019] [2024-10-24 16:22:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:54,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:54,021 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-10-24 16:22:54,022 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-10-24 16:22:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:54,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:22:54,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:54,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:54,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851872019] [2024-10-24 16:22:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851872019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:54,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:54,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:22:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427944966] [2024-10-24 16:22:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:54,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:22:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:54,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:22:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:22:54,195 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:22:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:54,486 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2024-10-24 16:22:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:22:54,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-24 16:22:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:54,488 INFO L225 Difference]: With dead ends: 73 [2024-10-24 16:22:54,488 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 16:22:54,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:22:54,488 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:54,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 97 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:22:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 16:22:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 16:22:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.297872340425532) internal successors, (61), 59 states have internal predecessors, (61), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:22:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2024-10-24 16:22:54,491 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 40 [2024-10-24 16:22:54,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:54,491 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2024-10-24 16:22:54,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 16:22:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2024-10-24 16:22:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 16:22:54,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:54,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:54,498 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-10-24 16:22:54,692 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-10-24 16:22:54,693 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 527405245, now seen corresponding path program 1 times [2024-10-24 16:22:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446590427] [2024-10-24 16:22:54,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:54,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:54,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:54,695 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-10-24 16:22:54,696 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-10-24 16:22:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:54,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:22:54,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:22:55,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:22:55,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:22:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446590427] [2024-10-24 16:22:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446590427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:22:55,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:22:55,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:22:55,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944936672] [2024-10-24 16:22:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:22:55,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:22:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:22:55,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:22:55,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:22:55,002 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:22:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:22:55,292 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2024-10-24 16:22:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:22:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2024-10-24 16:22:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:22:55,293 INFO L225 Difference]: With dead ends: 72 [2024-10-24 16:22:55,293 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 16:22:55,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:22:55,294 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:22:55,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:22:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 16:22:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 16:22:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 58 states have internal predecessors, (60), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 16:22:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2024-10-24 16:22:55,296 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 40 [2024-10-24 16:22:55,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:22:55,297 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2024-10-24 16:22:55,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 16:22:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-10-24 16:22:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-24 16:22:55,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:22:55,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:22:55,305 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-10-24 16:22:55,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-24 16:22:55,498 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2024-10-24 16:22:55,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:22:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -763026521, now seen corresponding path program 1 times [2024-10-24 16:22:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:22:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514964044] [2024-10-24 16:22:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:22:55,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:22:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:22:55,500 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:22:55,501 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 (33)] Waiting until timeout for monitored process [2024-10-24 16:22:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:22:55,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-24 16:22:55,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:22:55,817 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-24 16:22:55,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-24 16:22:55,842 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:22:55,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:22:56,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:22:56,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-24 16:22:56,373 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-10-24 16:22:56,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 52 [2024-10-24 16:22:56,383 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 23 treesize of output 13 [2024-10-24 16:22:57,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 38 [2024-10-24 16:22:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:22:58,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:23:01,772 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 284 treesize of output 256 [2024-10-24 16:23:02,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:23:02,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514964044] [2024-10-24 16:23:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514964044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:23:02,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [247223477] [2024-10-24 16:23:02,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:23:02,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 16:23:02,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 16:23:02,183 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 16:23:02,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-10-24 16:23:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:23:02,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-24 16:23:02,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:23:02,882 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 16:23:02,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 16:23:04,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:23:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-24 16:23:04,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:04,249 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 21 treesize of output 20 [2024-10-24 16:23:04,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:23:04,270 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 21 treesize of output 20 [2024-10-24 16:23:04,522 INFO L349 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2024-10-24 16:23:04,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2024-10-24 16:23:04,611 INFO L349 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2024-10-24 16:23:04,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 48 [2024-10-24 16:23:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:23:06,574 INFO L311 TraceCheckSpWp]: Computing backward predicates...