./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 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/uthash-2.0.2/uthash_SAX_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:35:25,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:35:25,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:35:25,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:35:25,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:35:25,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:35:25,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:35:25,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:35:25,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:35:25,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:35:25,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:35:25,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:35:25,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:35:25,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:35:25,961 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:35:25,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:35:25,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:35:25,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:35:25,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:35:25,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:35:25,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:35:25,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:35:25,966 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:35:25,966 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:35:25,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:35:25,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:35:25,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:35:25,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:35:25,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:35:25,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:35:25,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:35:25,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:35:25,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:35:25,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:35:25,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:35:25,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:35:25,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:25,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:35:25,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:35:25,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:35:25,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:35:25,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:35:25,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:35:25,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:35:25,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:35:25,975 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-memcleanup) ) 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-14 17:35:26,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:35:26,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:35:26,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:35:26,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:35:26,304 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:35:26,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-1.i [2024-10-14 17:35:27,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:35:28,103 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:35:28,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-1.i [2024-10-14 17:35:28,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f675309fb/508e635913ca4a47a113ed39e4991f04/FLAGb41bef379 [2024-10-14 17:35:28,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f675309fb/508e635913ca4a47a113ed39e4991f04 [2024-10-14 17:35:28,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:35:28,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:35:28,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:28,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:35:28,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:35:28,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:28" (1/1) ... [2024-10-14 17:35:28,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2085a7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:28, skipping insertion in model container [2024-10-14 17:35:28,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:28" (1/1) ... [2024-10-14 17:35:28,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:35:28,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:28,678 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-14 17:35:28,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@136d6747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:28, skipping insertion in model container [2024-10-14 17:35:28,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:28,680 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:35:28,681 INFO L158 Benchmark]: Toolchain (without parser) took 530.11ms. Allocated memory is still 163.6MB. Free memory was 86.9MB in the beginning and 66.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:35:28,682 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 163.6MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:35:28,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.88ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 66.3MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:35:28,684 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.27ms. Allocated memory is still 163.6MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.88ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 66.3MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: 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/uthash-2.0.2/uthash_SAX_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:35:30,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:35:30,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:35:30,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:35:30,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:35:30,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:35:30,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:35:30,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:35:30,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:35:30,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:35:30,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:35:30,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:35:30,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:35:30,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:35:30,956 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:35:30,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:35:30,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:35:30,959 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:35:30,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:35:30,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:35:30,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:35:30,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:35:30,963 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:35:30,964 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:35:30,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:35:30,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:35:30,965 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:35:30,965 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:35:30,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:35:30,966 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:35:30,966 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:35:30,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:35:30,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:35:30,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:35:30,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:35:30,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:35:30,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:35:30,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:35:30,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:30,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:35:30,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:35:30,970 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:35:30,970 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:35:30,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:35:30,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:35:30,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:35:30,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:35:30,971 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:35:30,972 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-memcleanup) ) 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-10-14 17:35:31,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:35:31,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:35:31,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:35:31,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:35:31,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:35:31,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-1.i [2024-10-14 17:35:32,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:35:33,319 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:35:33,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-1.i [2024-10-14 17:35:33,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851043c17/1b55060323004c19a64fb86f6c7ed5b9/FLAG75241d2e8 [2024-10-14 17:35:33,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851043c17/1b55060323004c19a64fb86f6c7ed5b9 [2024-10-14 17:35:33,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:35:33,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:35:33,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:33,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:35:33,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:35:33,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:33" (1/1) ... [2024-10-14 17:35:33,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a7ae70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:33, skipping insertion in model container [2024-10-14 17:35:33,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:33" (1/1) ... [2024-10-14 17:35:33,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:35:33,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:33,975 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:35:33,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:35:34,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:34,126 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:35:34,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:34,305 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:35:34,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34 WrapperNode [2024-10-14 17:35:34,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:34,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:35:34,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:35:34,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:35:34,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,413 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1031 [2024-10-14 17:35:34,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:35:34,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:35:34,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:35:34,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:35:34,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,517 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-14 17:35:34,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:35:34,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:35:34,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:35:34,592 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:35:34,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (1/1) ... [2024-10-14 17:35:34,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:35:34,631 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-14 17:35:34,638 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-14 17:35:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:35:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:35:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:35:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:35:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:35:34,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:35:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:35:34,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:35:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:35:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:35:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 17:35:34,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:35:34,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:35:34,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 17:35:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:35:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:35:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:35:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:35:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:35:34,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:35:34,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:35:34,904 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:35:34,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:35:41,910 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-14 17:35:41,911 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:35:41,944 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:35:41,947 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 17:35:41,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:35:41 BoogieIcfgContainer [2024-10-14 17:35:41,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:35:41,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:35:41,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:35:41,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:35:41,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:35:33" (1/3) ... [2024-10-14 17:35:41,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74453fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:35:41, skipping insertion in model container [2024-10-14 17:35:41,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:34" (2/3) ... [2024-10-14 17:35:41,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74453fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:35:41, skipping insertion in model container [2024-10-14 17:35:41,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:35:41" (3/3) ... [2024-10-14 17:35:41,958 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test3-1.i [2024-10-14 17:35:41,976 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:35:41,977 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:35:42,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:35:42,040 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;@1ce555bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:35:42,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:35:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 188 states have (on average 1.675531914893617) internal successors, (315), 191 states have internal predecessors, (315), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 17:35:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:35:42,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:35:42,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:35:42,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:35:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:35:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash 838735, now seen corresponding path program 1 times [2024-10-14 17:35:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:35:42,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016090357] [2024-10-14 17:35:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:35:42,072 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-14 17:35:42,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:35:42,075 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-14 17:35:42,077 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-14 17:35:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:35:42,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:35:42,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:35:42,319 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_20| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_20| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 17:35:42,320 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-14 17:35:42,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:35:42,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:35:42,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016090357] [2024-10-14 17:35:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016090357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:35:42,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:35:42,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:35:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768139827] [2024-10-14 17:35:42,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:35:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:35:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:35:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:35:42,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:35:42,360 INFO L87 Difference]: Start difference. First operand has 198 states, 188 states have (on average 1.675531914893617) internal successors, (315), 191 states have internal predecessors, (315), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:35:46,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:35:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:35:46,928 INFO L93 Difference]: Finished difference Result 292 states and 383 transitions. [2024-10-14 17:35:46,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:35:46,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:35:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:35:46,940 INFO L225 Difference]: With dead ends: 292 [2024-10-14 17:35:46,941 INFO L226 Difference]: Without dead ends: 290 [2024-10-14 17:35:46,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:35:46,944 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 120 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:35:46,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 475 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 384 Unchecked, 4.5s Time] [2024-10-14 17:35:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-14 17:35:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 196. [2024-10-14 17:35:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 17:35:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 253 transitions. [2024-10-14 17:35:46,994 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 253 transitions. Word has length 3 [2024-10-14 17:35:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:35:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 253 transitions. [2024-10-14 17:35:46,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:35:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 253 transitions. [2024-10-14 17:35:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:35:46,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:35:46,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:35:46,999 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 (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:35:47,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:35:47,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:35:47,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:35:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash 661190916, now seen corresponding path program 1 times [2024-10-14 17:35:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:35:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520600436] [2024-10-14 17:35:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:35:47,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:35:47,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:35:47,199 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-14 17:35:47,200 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-14 17:35:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:35:47,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:35:47,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:35:47,528 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_21| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_21|)))) is different from true [2024-10-14 17:35:47,529 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-14 17:35:47,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:35:47,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:35:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520600436] [2024-10-14 17:35:47,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520600436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:35:47,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:35:47,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:35:47,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236479538] [2024-10-14 17:35:47,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:35:47,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:35:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:35:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:35:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:35:47,534 INFO L87 Difference]: Start difference. First operand 196 states and 253 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:35:51,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:35:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:35:52,175 INFO L93 Difference]: Finished difference Result 291 states and 380 transitions. [2024-10-14 17:35:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:35:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 17:35:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:35:52,180 INFO L225 Difference]: With dead ends: 291 [2024-10-14 17:35:52,183 INFO L226 Difference]: Without dead ends: 289 [2024-10-14 17:35:52,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 17:35:52,184 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 112 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:35:52,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 475 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 1 Unknown, 379 Unchecked, 4.6s Time] [2024-10-14 17:35:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-14 17:35:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2024-10-14 17:35:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 254 states have (on average 1.3070866141732282) internal successors, (332), 256 states have internal predecessors, (332), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:35:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 346 transitions. [2024-10-14 17:35:52,204 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 346 transitions. Word has length 11 [2024-10-14 17:35:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:35:52,204 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 346 transitions. [2024-10-14 17:35:52,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:35:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 346 transitions. [2024-10-14 17:35:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:35:52,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:35:52,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:35:52,212 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-14 17:35:52,409 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-14 17:35:52,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:35:52,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:35:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash 904417889, now seen corresponding path program 1 times [2024-10-14 17:35:52,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:35:52,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903811635] [2024-10-14 17:35:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:35:52,411 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-14 17:35:52,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:35:52,414 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-14 17:35:52,416 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-14 17:35:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:35:52,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:35:52,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:35:52,704 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-14 17:35:52,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:35:52,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:35:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903811635] [2024-10-14 17:35:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903811635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:35:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:35:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:35:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844250263] [2024-10-14 17:35:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:35:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:35:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:35:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:35:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:35:52,709 INFO L87 Difference]: Start difference. First operand 265 states and 346 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:35:56,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:35:59,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:35:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:35:59,844 INFO L93 Difference]: Finished difference Result 355 states and 462 transitions. [2024-10-14 17:35:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:35:59,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 17:35:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:35:59,847 INFO L225 Difference]: With dead ends: 355 [2024-10-14 17:35:59,848 INFO L226 Difference]: Without dead ends: 353 [2024-10-14 17:35:59,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-14 17:35:59,849 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 136 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:35:59,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 672 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2024-10-14 17:35:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-14 17:35:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2024-10-14 17:35:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 341 states have (on average 1.3049853372434017) internal successors, (445), 344 states have internal predecessors, (445), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:35:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 459 transitions. [2024-10-14 17:35:59,872 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 459 transitions. Word has length 14 [2024-10-14 17:35:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:35:59,873 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 459 transitions. [2024-10-14 17:35:59,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:35:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 459 transitions. [2024-10-14 17:35:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 17:35:59,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:35:59,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:35:59,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 17:36:00,075 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-14 17:36:00,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:00,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:00,077 INFO L85 PathProgramCache]: Analyzing trace with hash 605623697, now seen corresponding path program 1 times [2024-10-14 17:36:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:00,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803568980] [2024-10-14 17:36:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:00,078 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-14 17:36:00,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:00,080 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-14 17:36:00,081 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-14 17:36:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:00,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:00,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:00,321 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-14 17:36:00,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:00,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:00,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803568980] [2024-10-14 17:36:00,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803568980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:00,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:00,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075151822] [2024-10-14 17:36:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:00,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:00,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:00,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:00,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:00,324 INFO L87 Difference]: Start difference. First operand 352 states and 459 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:00,491 INFO L93 Difference]: Finished difference Result 361 states and 444 transitions. [2024-10-14 17:36:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-14 17:36:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:00,494 INFO L225 Difference]: With dead ends: 361 [2024-10-14 17:36:00,494 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 17:36:00,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:00,495 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 30 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:00,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 643 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 17:36:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2024-10-14 17:36:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 350 states have (on average 1.2285714285714286) internal successors, (430), 353 states have internal predecessors, (430), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 17:36:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 444 transitions. [2024-10-14 17:36:00,506 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 444 transitions. Word has length 50 [2024-10-14 17:36:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:00,506 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 444 transitions. [2024-10-14 17:36:00,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 444 transitions. [2024-10-14 17:36:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 17:36:00,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:00,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:00,516 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-14 17:36:00,708 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-14 17:36:00,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1020800389, now seen corresponding path program 1 times [2024-10-14 17:36:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:00,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359075531] [2024-10-14 17:36:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:00,710 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-14 17:36:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:00,714 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-14 17:36:00,714 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-14 17:36:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:00,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:36:00,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:00,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:36:00,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:36:00,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:36:00,944 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 30 treesize of output 39 [2024-10-14 17:36:01,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:36:01,020 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 17:36:01,068 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-14 17:36:01,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:01,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:01,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359075531] [2024-10-14 17:36:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359075531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:01,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:36:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362213589] [2024-10-14 17:36:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:01,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:36:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:01,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:36:01,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:01,071 INFO L87 Difference]: Start difference. First operand 361 states and 444 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:01,558 INFO L93 Difference]: Finished difference Result 362 states and 451 transitions. [2024-10-14 17:36:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:01,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-14 17:36:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:01,561 INFO L225 Difference]: With dead ends: 362 [2024-10-14 17:36:01,561 INFO L226 Difference]: Without dead ends: 359 [2024-10-14 17:36:01,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-14 17:36:01,562 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 108 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:01,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 905 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:36:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-14 17:36:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 312. [2024-10-14 17:36:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 302 states have (on average 1.2450331125827814) internal successors, (376), 305 states have internal predecessors, (376), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:36:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 388 transitions. [2024-10-14 17:36:01,570 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 388 transitions. Word has length 50 [2024-10-14 17:36:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:01,571 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 388 transitions. [2024-10-14 17:36:01,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 388 transitions. [2024-10-14 17:36:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 17:36:01,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:01,576 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, 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, 1] [2024-10-14 17:36:01,583 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-14 17:36:01,777 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-14 17:36:01,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:01,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -235593599, now seen corresponding path program 1 times [2024-10-14 17:36:01,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:01,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799143711] [2024-10-14 17:36:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:01,779 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-14 17:36:01,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:01,782 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-14 17:36:01,785 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-14 17:36:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:02,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:02,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:36:02,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:02,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799143711] [2024-10-14 17:36:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799143711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:02,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:02,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468608517] [2024-10-14 17:36:02,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:02,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:02,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:02,267 INFO L87 Difference]: Start difference. First operand 312 states and 388 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:02,374 INFO L93 Difference]: Finished difference Result 318 states and 378 transitions. [2024-10-14 17:36:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-14 17:36:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:02,377 INFO L225 Difference]: With dead ends: 318 [2024-10-14 17:36:02,377 INFO L226 Difference]: Without dead ends: 318 [2024-10-14 17:36:02,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:02,379 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 33 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:02,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 607 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-14 17:36:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-10-14 17:36:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 311 states have internal predecessors, (366), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:36:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 378 transitions. [2024-10-14 17:36:02,390 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 378 transitions. Word has length 80 [2024-10-14 17:36:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 378 transitions. [2024-10-14 17:36:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 378 transitions. [2024-10-14 17:36:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 17:36:02,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:02,393 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, 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, 1] [2024-10-14 17:36:02,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:02,596 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-14 17:36:02,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:02,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1092709359, now seen corresponding path program 1 times [2024-10-14 17:36:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900631126] [2024-10-14 17:36:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:02,598 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-14 17:36:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:02,599 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-14 17:36:02,600 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-14 17:36:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:03,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:03,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:36:03,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:03,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900631126] [2024-10-14 17:36:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900631126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:36:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758967672] [2024-10-14 17:36:03,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:03,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:36:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:36:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:03,166 INFO L87 Difference]: Start difference. First operand 318 states and 378 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:03,271 INFO L93 Difference]: Finished difference Result 306 states and 358 transitions. [2024-10-14 17:36:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:03,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-10-14 17:36:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:03,273 INFO L225 Difference]: With dead ends: 306 [2024-10-14 17:36:03,273 INFO L226 Difference]: Without dead ends: 306 [2024-10-14 17:36:03,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:03,276 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 8 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:03,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 607 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-14 17:36:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-10-14 17:36:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 296 states have (on average 1.1689189189189189) internal successors, (346), 299 states have internal predecessors, (346), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:36:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 358 transitions. [2024-10-14 17:36:03,286 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 358 transitions. Word has length 80 [2024-10-14 17:36:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:03,286 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 358 transitions. [2024-10-14 17:36:03,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 358 transitions. [2024-10-14 17:36:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 17:36:03,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:03,289 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, 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, 1] [2024-10-14 17:36:03,300 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 (8)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:03,490 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-14 17:36:03,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:03,491 INFO L85 PathProgramCache]: Analyzing trace with hash 507494795, now seen corresponding path program 1 times [2024-10-14 17:36:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:03,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488589375] [2024-10-14 17:36:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:03,491 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-14 17:36:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:03,493 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-14 17:36:03,494 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-14 17:36:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:03,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:03,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:36:03,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:03,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488589375] [2024-10-14 17:36:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488589375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342104722] [2024-10-14 17:36:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:03,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:03,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:03,954 INFO L87 Difference]: Start difference. First operand 306 states and 358 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:36:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:04,011 INFO L93 Difference]: Finished difference Result 308 states and 361 transitions. [2024-10-14 17:36:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:36:04,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2024-10-14 17:36:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:04,014 INFO L225 Difference]: With dead ends: 308 [2024-10-14 17:36:04,014 INFO L226 Difference]: Without dead ends: 308 [2024-10-14 17:36:04,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 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-14 17:36:04,016 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:04,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 662 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:36:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-14 17:36:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-14 17:36:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 297 states have (on average 1.1717171717171717) internal successors, (348), 301 states have internal predecessors, (348), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 17:36:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 361 transitions. [2024-10-14 17:36:04,024 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 361 transitions. Word has length 80 [2024-10-14 17:36:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:04,024 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 361 transitions. [2024-10-14 17:36:04,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:36:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 361 transitions. [2024-10-14 17:36:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 17:36:04,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:04,026 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1] [2024-10-14 17:36:04,037 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-14 17:36:04,229 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-14 17:36:04,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:04,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1165626829, now seen corresponding path program 1 times [2024-10-14 17:36:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:04,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503549989] [2024-10-14 17:36:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:04,231 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-14 17:36:04,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:04,232 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-14 17:36:04,234 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-14 17:36:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:04,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:04,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:36:04,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:36:04,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503549989] [2024-10-14 17:36:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503549989] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:04,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:36:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033526685] [2024-10-14 17:36:04,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:04,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:36:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:36:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:36:04,836 INFO L87 Difference]: Start difference. First operand 308 states and 361 transitions. Second operand has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:05,018 INFO L93 Difference]: Finished difference Result 317 states and 375 transitions. [2024-10-14 17:36:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:36:05,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2024-10-14 17:36:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:05,021 INFO L225 Difference]: With dead ends: 317 [2024-10-14 17:36:05,021 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 17:36:05,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:36:05,022 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 5 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:05,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 880 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 17:36:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2024-10-14 17:36:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 304 states have (on average 1.1875) internal successors, (361), 308 states have internal predecessors, (361), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 17:36:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 374 transitions. [2024-10-14 17:36:05,033 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 374 transitions. Word has length 82 [2024-10-14 17:36:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:05,033 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 374 transitions. [2024-10-14 17:36:05,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.0) internal successors, (84), 8 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 374 transitions. [2024-10-14 17:36:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 17:36:05,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:05,034 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 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, 1] [2024-10-14 17:36:05,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:36:05,235 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-14 17:36:05,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:05,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:05,236 INFO L85 PathProgramCache]: Analyzing trace with hash -356041909, now seen corresponding path program 2 times [2024-10-14 17:36:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766783891] [2024-10-14 17:36:05,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:36:05,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:05,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:05,240 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-14 17:36:05,241 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-14 17:36:05,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:36:05,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:05,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:36:05,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:36:05,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:36:06,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766783891] [2024-10-14 17:36:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766783891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:06,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:06,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:36:06,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775278677] [2024-10-14 17:36:06,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:06,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:36:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:06,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:36:06,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:36:06,058 INFO L87 Difference]: Start difference. First operand 316 states and 374 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:06,638 INFO L93 Difference]: Finished difference Result 328 states and 393 transitions. [2024-10-14 17:36:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:36:06,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 86 [2024-10-14 17:36:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:06,641 INFO L225 Difference]: With dead ends: 328 [2024-10-14 17:36:06,641 INFO L226 Difference]: Without dead ends: 326 [2024-10-14 17:36:06,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:36:06,642 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 8 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:06,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2409 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:36:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-14 17:36:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2024-10-14 17:36:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.1916932907348243) internal successors, (373), 317 states have internal predecessors, (373), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 17:36:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 386 transitions. [2024-10-14 17:36:06,649 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 386 transitions. Word has length 86 [2024-10-14 17:36:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:06,649 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 386 transitions. [2024-10-14 17:36:06,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 14 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 386 transitions. [2024-10-14 17:36:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 17:36:06,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:06,651 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 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, 1] [2024-10-14 17:36:06,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:06,851 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-14 17:36:06,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 392063569, now seen corresponding path program 3 times [2024-10-14 17:36:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827244783] [2024-10-14 17:36:06,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:36:06,853 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-14 17:36:06,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:06,854 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-14 17:36:06,855 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-14 17:36:07,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:36:07,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:07,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:07,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 17:36:07,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:07,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:07,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827244783] [2024-10-14 17:36:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827244783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:07,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108859460] [2024-10-14 17:36:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:07,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:07,425 INFO L87 Difference]: Start difference. First operand 325 states and 386 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:11,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:15,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:20,305 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-14 17:36:21,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:21,902 INFO L93 Difference]: Finished difference Result 417 states and 499 transitions. [2024-10-14 17:36:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:36:21,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-10-14 17:36:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:21,905 INFO L225 Difference]: With dead ends: 417 [2024-10-14 17:36:21,905 INFO L226 Difference]: Without dead ends: 417 [2024-10-14 17:36:21,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:21,906 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 422 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:21,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 379 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2024-10-14 17:36:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-14 17:36:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-10-14 17:36:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 401 states have (on average 1.1970074812967582) internal successors, (480), 406 states have internal predecessors, (480), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:36:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 495 transitions. [2024-10-14 17:36:21,915 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 495 transitions. Word has length 95 [2024-10-14 17:36:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:21,916 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 495 transitions. [2024-10-14 17:36:21,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 495 transitions. [2024-10-14 17:36:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 17:36:21,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:21,918 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 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, 1, 1, 1, 1] [2024-10-14 17:36:21,929 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-14 17:36:22,118 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-14 17:36:22,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:22,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2035565044, now seen corresponding path program 1 times [2024-10-14 17:36:22,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:22,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159992283] [2024-10-14 17:36:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:22,120 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-14 17:36:22,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:22,123 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-14 17:36:22,124 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-14 17:36:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:22,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:36:22,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:36:22,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:36:23,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:23,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159992283] [2024-10-14 17:36:23,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159992283] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:23,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:36:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468179160] [2024-10-14 17:36:23,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:23,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:36:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:36:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:36:23,489 INFO L87 Difference]: Start difference. First operand 414 states and 495 transitions. Second operand has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:25,788 INFO L93 Difference]: Finished difference Result 435 states and 532 transitions. [2024-10-14 17:36:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:36:25,789 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2024-10-14 17:36:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:25,791 INFO L225 Difference]: With dead ends: 435 [2024-10-14 17:36:25,791 INFO L226 Difference]: Without dead ends: 433 [2024-10-14 17:36:25,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:36:25,793 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 14 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:25,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2852 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 17:36:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-14 17:36:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 432. [2024-10-14 17:36:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 419 states have (on average 1.2028639618138426) internal successors, (504), 424 states have internal predecessors, (504), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:36:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 519 transitions. [2024-10-14 17:36:25,802 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 519 transitions. Word has length 98 [2024-10-14 17:36:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:25,803 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 519 transitions. [2024-10-14 17:36:25,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.333333333333333) internal successors, (104), 26 states have internal predecessors, (104), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 519 transitions. [2024-10-14 17:36:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 17:36:25,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:25,804 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 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, 1, 1, 1, 1] [2024-10-14 17:36:25,820 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-14 17:36:26,004 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-14 17:36:26,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:26,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1229274932, now seen corresponding path program 2 times [2024-10-14 17:36:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:26,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001138284] [2024-10-14 17:36:26,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:36:26,006 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-14 17:36:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:26,007 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-14 17:36:26,008 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-14 17:36:26,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:36:26,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:26,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:36:26,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 17:36:27,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:36:29,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001138284] [2024-10-14 17:36:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001138284] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:29,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:29,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:36:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801226924] [2024-10-14 17:36:29,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:29,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:36:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:36:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:36:29,918 INFO L87 Difference]: Start difference. First operand 432 states and 519 transitions. Second operand has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:37,092 INFO L93 Difference]: Finished difference Result 469 states and 588 transitions. [2024-10-14 17:36:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:36:37,094 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2024-10-14 17:36:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:37,095 INFO L225 Difference]: With dead ends: 469 [2024-10-14 17:36:37,096 INFO L226 Difference]: Without dead ends: 467 [2024-10-14 17:36:37,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:36:37,100 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 26 mSDsluCounter, 5257 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5479 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:37,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5479 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 17:36:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-14 17:36:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 466. [2024-10-14 17:36:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 453 states have (on average 1.2141280353200883) internal successors, (550), 458 states have internal predecessors, (550), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:36:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 565 transitions. [2024-10-14 17:36:37,110 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 565 transitions. Word has length 116 [2024-10-14 17:36:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:37,111 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 565 transitions. [2024-10-14 17:36:37,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.6666666666666665) internal successors, (128), 50 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 565 transitions. [2024-10-14 17:36:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 17:36:37,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:37,114 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 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, 1, 1, 1, 1] [2024-10-14 17:36:37,133 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 (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:37,314 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-14 17:36:37,314 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:37,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash -42702540, now seen corresponding path program 3 times [2024-10-14 17:36:37,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:37,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513955493] [2024-10-14 17:36:37,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:36:37,316 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-14 17:36:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:37,317 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-14 17:36:37,319 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-14 17:36:37,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:36:37,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:37,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:36:37,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:38,275 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:36:38,276 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:36:38,276 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:36:38,281 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 30 treesize of output 39 [2024-10-14 17:36:38,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:36:38,345 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-14 17:36:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-14 17:36:38,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:38,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513955493] [2024-10-14 17:36:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513955493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:38,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:36:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334825040] [2024-10-14 17:36:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:38,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:36:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:36:38,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:36:38,373 INFO L87 Difference]: Start difference. First operand 466 states and 565 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:38,671 INFO L93 Difference]: Finished difference Result 576 states and 699 transitions. [2024-10-14 17:36:38,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:36:38,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 150 [2024-10-14 17:36:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:38,674 INFO L225 Difference]: With dead ends: 576 [2024-10-14 17:36:38,674 INFO L226 Difference]: Without dead ends: 576 [2024-10-14 17:36:38,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:36:38,675 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 572 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:38,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 609 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:36:38,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-14 17:36:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 468. [2024-10-14 17:36:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 455 states have (on average 1.213186813186813) internal successors, (552), 460 states have internal predecessors, (552), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:36:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 567 transitions. [2024-10-14 17:36:38,686 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 567 transitions. Word has length 150 [2024-10-14 17:36:38,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:38,687 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 567 transitions. [2024-10-14 17:36:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 567 transitions. [2024-10-14 17:36:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-14 17:36:38,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:38,689 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:38,703 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-14 17:36:38,889 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-14 17:36:38,890 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:38,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1292381150, now seen corresponding path program 1 times [2024-10-14 17:36:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156561703] [2024-10-14 17:36:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:38,891 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-14 17:36:38,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:38,892 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-14 17:36:38,893 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-14 17:36:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:40,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:36:40,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:36:40,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:36:42,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156561703] [2024-10-14 17:36:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156561703] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:42,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:36:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973062702] [2024-10-14 17:36:42,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:42,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:36:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:42,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:36:42,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:36:42,589 INFO L87 Difference]: Start difference. First operand 468 states and 567 transitions. Second operand has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:36:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:51,150 INFO L93 Difference]: Finished difference Result 495 states and 619 transitions. [2024-10-14 17:36:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:36:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 194 [2024-10-14 17:36:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:51,153 INFO L225 Difference]: With dead ends: 495 [2024-10-14 17:36:51,153 INFO L226 Difference]: Without dead ends: 495 [2024-10-14 17:36:51,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:36:51,156 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 26 mSDsluCounter, 5670 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5891 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:51,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5891 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 17:36:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-14 17:36:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2024-10-14 17:36:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 480 states have (on average 1.2541666666666667) internal successors, (602), 485 states have internal predecessors, (602), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-10-14 17:36:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 617 transitions. [2024-10-14 17:36:51,166 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 617 transitions. Word has length 194 [2024-10-14 17:36:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:51,166 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 617 transitions. [2024-10-14 17:36:51,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.42) internal successors, (171), 52 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:36:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 617 transitions. [2024-10-14 17:36:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-14 17:36:51,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:51,169 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:51,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:51,369 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-14 17:36:51,370 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:51,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1917969768, now seen corresponding path program 2 times [2024-10-14 17:36:51,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:51,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575625625] [2024-10-14 17:36:51,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:36:51,372 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-14 17:36:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:51,375 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-14 17:36:51,376 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-14 17:36:53,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:36:53,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:53,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:36:53,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:36:55,813 INFO L311 TraceCheckSpWp]: Computing backward predicates...