./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.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 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:49:52,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:49:52,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:49:52,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:49:52,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:49:52,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:49:52,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:49:52,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:49:52,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:49:52,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:49:52,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:49:52,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:49:52,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:49:52,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:49:52,576 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:49:52,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:49:52,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:49:52,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:49:52,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:49:52,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:49:52,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:49:52,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:49:52,579 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:49:52,579 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:49:52,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:49:52,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:49:52,580 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:49:52,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:49:52,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:49:52,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:49:52,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:49:52,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:49:52,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:49:52,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:49:52,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:49:52,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:49:52,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:49:52,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:49:52,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:49:52,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:49:52,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:49:52,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:49:52,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:49:52,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:49:52,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:49:52,584 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-10 14:49:52,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:49:52,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:49:52,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:49:52,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:49:52,794 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:49:52,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 14:49:53,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:49:54,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:49:54,173 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 14:49:54,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd8e297a/70f2e02e16dd4e3db1744133283a148e/FLAGdbb90630e [2024-11-10 14:49:54,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dd8e297a/70f2e02e16dd4e3db1744133283a148e [2024-11-10 14:49:54,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:49:54,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:49:54,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:49:54,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:49:54,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:49:54,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:49:54" (1/1) ... [2024-11-10 14:49:54,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd7b496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:54, skipping insertion in model container [2024-11-10 14:49:54,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:49:54" (1/1) ... [2024-11-10 14:49:54,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:49:54,944 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:54,971 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:54,975 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:54,978 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:54,984 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,007 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,009 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,011 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,014 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,022 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,023 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,024 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,025 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,026 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,026 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,029 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,030 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,030 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,031 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,033 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:55,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:49:55,050 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 14:49:55,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3bd99bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:55, skipping insertion in model container [2024-11-10 14:49:55,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:49:55,051 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 14:49:55,052 INFO L158 Benchmark]: Toolchain (without parser) took 537.88ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 135.2MB in the end (delta: -32.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-10 14:49:55,053 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 131.8MB in the end (delta: 17.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:49:55,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.34ms. Allocated memory is still 176.2MB. Free memory was 102.0MB in the beginning and 135.2MB in the end (delta: -33.2MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-10 14:49:55,054 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.16ms. Allocated memory is still 176.2MB. Free memory was 131.8MB in the beginning and 131.8MB in the end (delta: 17.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.34ms. Allocated memory is still 176.2MB. Free memory was 102.0MB in the beginning and 135.2MB in the end (delta: -33.2MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 769]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.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 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:49:56,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:49:56,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-10 14:49:56,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:49:56,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:49:56,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:49:56,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:49:56,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:49:56,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:49:56,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:49:56,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:49:56,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:49:56,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:49:56,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:49:56,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:49:56,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:49:56,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:49:56,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:49:56,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:49:56,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:49:56,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:49:56,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:49:56,670 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:49:56,670 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:49:56,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:49:56,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:49:56,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:49:56,670 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 14:49:56,671 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:49:56,671 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 14:49:56,671 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:49:56,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:49:56,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:49:56,672 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:49:56,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:49:56,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:49:56,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:49:56,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:49:56,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:49:56,674 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:49:56,674 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:49:56,674 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 14:49:56,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 14:49:56,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:49:56,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:49:56,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:49:56,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:49:56,675 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-10 14:49:56,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:49:56,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:49:56,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:49:56,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:49:56,917 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:49:56,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 14:49:58,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:49:58,349 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:49:58,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 14:49:58,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0afa7722/01b11e3a8d404a7bb53eaa668b285025/FLAGaf33ca2ca [2024-11-10 14:49:58,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0afa7722/01b11e3a8d404a7bb53eaa668b285025 [2024-11-10 14:49:58,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:49:58,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:49:58,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:49:58,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:49:58,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:49:58,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:49:58" (1/1) ... [2024-11-10 14:49:58,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a9e832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:58, skipping insertion in model container [2024-11-10 14:49:58,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:49:58" (1/1) ... [2024-11-10 14:49:58,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:49:59,076 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,106 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,120 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,126 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,136 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,166 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,168 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,170 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,179 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,180 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,181 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,182 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,184 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,184 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,187 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,188 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,189 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,189 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,192 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:49:59,211 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 14:49:59,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:49:59,249 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,257 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,262 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,264 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,269 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,288 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,291 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,293 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,295 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,298 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,299 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,301 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,302 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,302 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,303 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,306 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,308 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,308 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,309 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,311 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:49:59,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:49:59,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:49:59,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:49:59,412 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:49:59,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59 WrapperNode [2024-11-10 14:49:59,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:49:59,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:49:59,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:49:59,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:49:59,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,491 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1428 [2024-11-10 14:49:59,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:49:59,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:49:59,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:49:59,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:49:59,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,610 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-10 14:49:59,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:49:59,684 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:49:59,684 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:49:59,684 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:49:59,684 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (1/1) ... [2024-11-10 14:49:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:49:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:49:59,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:49:59,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:49:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 14:49:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 14:49:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 14:49:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 14:49:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 14:49:59,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 14:49:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 14:49:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 14:49:59,755 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 14:49:59,755 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 14:49:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:49:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:49:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:49:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:49:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:49:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:49:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:49:59,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 14:49:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 14:49:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 14:49:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 14:49:59,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:49:59,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:49:59,952 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:49:59,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:50:11,510 INFO L? ?]: Removed 209 outVars from TransFormulas that were not future-live. [2024-11-10 14:50:11,510 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:50:11,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:50:11,534 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:50:11,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:50:11 BoogieIcfgContainer [2024-11-10 14:50:11,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:50:11,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:50:11,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:50:11,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:50:11,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:49:58" (1/3) ... [2024-11-10 14:50:11,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522c7ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:50:11, skipping insertion in model container [2024-11-10 14:50:11,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:49:59" (2/3) ... [2024-11-10 14:50:11,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522c7ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:50:11, skipping insertion in model container [2024-11-10 14:50:11,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:50:11" (3/3) ... [2024-11-10 14:50:11,546 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2024-11-10 14:50:11,561 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:50:11,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:50:11,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:50:11,614 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;@5d9a300, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:50:11,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:50:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 258 states have (on average 1.6434108527131783) internal successors, (424), 270 states have internal predecessors, (424), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 14:50:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 14:50:11,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:11,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:11,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:11,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash -852190877, now seen corresponding path program 1 times [2024-11-10 14:50:11,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539532143] [2024-11-10 14:50:11,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:11,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:11,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:11,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:11,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 14:50:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:11,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 14:50:11,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:50:11,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:50:11,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539532143] [2024-11-10 14:50:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539532143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:50:11,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:50:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:50:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717569262] [2024-11-10 14:50:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:50:11,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:50:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:50:11,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:50:11,834 INFO L87 Difference]: Start difference. First operand has 279 states, 258 states have (on average 1.6434108527131783) internal successors, (424), 270 states have internal predecessors, (424), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11-10 14:50:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:11,868 INFO L93 Difference]: Finished difference Result 278 states and 369 transitions. [2024-11-10 14:50:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:50:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 12 [2024-11-10 14:50:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:11,878 INFO L225 Difference]: With dead ends: 278 [2024-11-10 14:50:11,878 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 14:50:11,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:50:11,882 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:11,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:50:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 14:50:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-10 14:50:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 255 states have (on average 1.3098039215686275) internal successors, (334), 266 states have internal predecessors, (334), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 14:50:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 366 transitions. [2024-11-10 14:50:11,992 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 366 transitions. Word has length 12 [2024-11-10 14:50:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:11,992 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 366 transitions. [2024-11-10 14:50:11,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11-10 14:50:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 366 transitions. [2024-11-10 14:50:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 14:50:11,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:11,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:11,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 14:50:12,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:12,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:12,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -207962364, now seen corresponding path program 1 times [2024-11-10 14:50:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672764805] [2024-11-10 14:50:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:12,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:12,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:12,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-11-10 14:50:12,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-11-10 14:50:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:12,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:50:12,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:50:12,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:50:12,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:12,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672764805] [2024-11-10 14:50:12,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672764805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:50:12,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:50:12,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:50:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022330761] [2024-11-10 14:50:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:50:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:50:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:50:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:50:12,346 INFO L87 Difference]: Start difference. First operand 275 states and 366 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-10 14:50:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:12,505 INFO L93 Difference]: Finished difference Result 454 states and 597 transitions. [2024-11-10 14:50:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:50:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-10 14:50:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:12,513 INFO L225 Difference]: With dead ends: 454 [2024-11-10 14:50:12,513 INFO L226 Difference]: Without dead ends: 454 [2024-11-10 14:50:12,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:50:12,514 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 217 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:12,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 756 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:50:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-10 14:50:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 277. [2024-11-10 14:50:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 257 states have (on average 1.3073929961089494) internal successors, (336), 268 states have internal predecessors, (336), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 14:50:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 368 transitions. [2024-11-10 14:50:12,531 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 368 transitions. Word has length 13 [2024-11-10 14:50:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:12,531 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 368 transitions. [2024-11-10 14:50:12,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-10 14:50:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 368 transitions. [2024-11-10 14:50:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 14:50:12,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:12,535 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 14:50:12,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 14:50:12,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:12,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:12,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1552285130, now seen corresponding path program 1 times [2024-11-10 14:50:12,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:12,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901867452] [2024-11-10 14:50:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:12,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:12,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:12,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:12,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 14:50:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:13,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:50:13,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:50:13,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:50:13,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901867452] [2024-11-10 14:50:13,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901867452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:50:13,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:50:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:50:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131494684] [2024-11-10 14:50:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:50:13,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:50:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:50:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:50:13,233 INFO L87 Difference]: Start difference. First operand 277 states and 368 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-11-10 14:50:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:13,323 INFO L93 Difference]: Finished difference Result 280 states and 363 transitions. [2024-11-10 14:50:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:50:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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 122 [2024-11-10 14:50:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:13,329 INFO L225 Difference]: With dead ends: 280 [2024-11-10 14:50:13,329 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 14:50:13,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:50:13,330 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 30 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:13,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 988 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:50:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 14:50:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-10 14:50:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 260 states have (on average 1.273076923076923) internal successors, (331), 271 states have internal predecessors, (331), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 14:50:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 363 transitions. [2024-11-10 14:50:13,341 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 363 transitions. Word has length 122 [2024-11-10 14:50:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:13,341 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 363 transitions. [2024-11-10 14:50:13,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-11-10 14:50:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 363 transitions. [2024-11-10 14:50:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 14:50:13,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:13,346 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 14:50:13,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 14:50:13,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:13,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2079292036, now seen corresponding path program 1 times [2024-11-10 14:50:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793797205] [2024-11-10 14:50:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:13,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:13,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:13,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:13,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 14:50:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:13,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:50:13,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:50:14,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:50:14,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:14,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793797205] [2024-11-10 14:50:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793797205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:50:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:50:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:50:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264417695] [2024-11-10 14:50:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:50:14,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:50:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:50:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:50:14,161 INFO L87 Difference]: Start difference. First operand 280 states and 363 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-11-10 14:50:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:14,679 INFO L93 Difference]: Finished difference Result 378 states and 482 transitions. [2024-11-10 14:50:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:50:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 122 [2024-11-10 14:50:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:14,688 INFO L225 Difference]: With dead ends: 378 [2024-11-10 14:50:14,688 INFO L226 Difference]: Without dead ends: 378 [2024-11-10 14:50:14,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:50:14,690 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 74 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:14,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 714 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 14:50:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-10 14:50:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 323. [2024-11-10 14:50:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 303 states have (on average 1.2475247524752475) internal successors, (378), 314 states have internal predecessors, (378), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 14:50:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 410 transitions. [2024-11-10 14:50:14,705 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 410 transitions. Word has length 122 [2024-11-10 14:50:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:14,706 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 410 transitions. [2024-11-10 14:50:14,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-11-10 14:50:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 410 transitions. [2024-11-10 14:50:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 14:50:14,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:14,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:14,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 14:50:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:14,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2002317802, now seen corresponding path program 1 times [2024-11-10 14:50:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7020363] [2024-11-10 14:50:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:14,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:14,917 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:14,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 14:50:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:15,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:50:15,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:50:15,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:50:15,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:15,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7020363] [2024-11-10 14:50:15,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7020363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:50:15,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:50:15,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:50:15,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448418654] [2024-11-10 14:50:15,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:50:15,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:50:15,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:15,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:50:15,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:50:15,393 INFO L87 Difference]: Start difference. First operand 323 states and 410 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:50:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:15,434 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2024-11-10 14:50:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:50:15,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 137 [2024-11-10 14:50:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:15,436 INFO L225 Difference]: With dead ends: 326 [2024-11-10 14:50:15,436 INFO L226 Difference]: Without dead ends: 326 [2024-11-10 14:50:15,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:50:15,437 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:15,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1046 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:50:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-10 14:50:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-10 14:50:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 305 states have (on average 1.2491803278688525) internal successors, (381), 317 states have internal predecessors, (381), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-10 14:50:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 415 transitions. [2024-11-10 14:50:15,443 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 415 transitions. Word has length 137 [2024-11-10 14:50:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:15,444 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 415 transitions. [2024-11-10 14:50:15,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:50:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 415 transitions. [2024-11-10 14:50:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 14:50:15,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:15,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:15,457 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-11-10 14:50:15,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:15,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:15,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:15,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1278594286, now seen corresponding path program 1 times [2024-11-10 14:50:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:15,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347961697] [2024-11-10 14:50:15,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:15,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:15,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:15,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:15,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 14:50:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:16,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:50:16,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:50:16,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:50:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:50:16,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:16,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347961697] [2024-11-10 14:50:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347961697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:50:16,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:50:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 14:50:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498247969] [2024-11-10 14:50:16,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:50:16,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:50:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:16,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:50:16,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:50:16,210 INFO L87 Difference]: Start difference. First operand 326 states and 415 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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-11-10 14:50:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:16,336 INFO L93 Difference]: Finished difference Result 337 states and 432 transitions. [2024-11-10 14:50:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:50:16,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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 139 [2024-11-10 14:50:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:16,339 INFO L225 Difference]: With dead ends: 337 [2024-11-10 14:50:16,339 INFO L226 Difference]: Without dead ends: 337 [2024-11-10 14:50:16,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 270 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-11-10 14:50:16,340 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 4 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:16,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1047 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:50:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-10 14:50:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2024-11-10 14:50:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 313 states have (on average 1.2619808306709266) internal successors, (395), 325 states have internal predecessors, (395), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-10 14:50:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 429 transitions. [2024-11-10 14:50:16,347 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 429 transitions. Word has length 139 [2024-11-10 14:50:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:16,347 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 429 transitions. [2024-11-10 14:50:16,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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-11-10 14:50:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 429 transitions. [2024-11-10 14:50:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-10 14:50:16,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:16,349 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:16,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 14:50:16,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:16,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:16,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash 333028970, now seen corresponding path program 2 times [2024-11-10 14:50:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:16,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30103935] [2024-11-10 14:50:16,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:50:16,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:16,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:16,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:16,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 14:50:16,817 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 14:50:16,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:50:16,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 14:50:16,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-10 14:50:17,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:50:17,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:17,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30103935] [2024-11-10 14:50:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30103935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:50:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:50:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:50:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134210003] [2024-11-10 14:50:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:50:17,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:50:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:50:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:50:17,438 INFO L87 Difference]: Start difference. First operand 335 states and 429 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 14:50:21,551 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-11-10 14:50:23,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 14:50:27,264 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-11-10 14:50:33,024 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-11-10 14:50:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:33,025 INFO L93 Difference]: Finished difference Result 420 states and 540 transitions. [2024-11-10 14:50:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:50:33,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 143 [2024-11-10 14:50:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:33,035 INFO L225 Difference]: With dead ends: 420 [2024-11-10 14:50:33,035 INFO L226 Difference]: Without dead ends: 420 [2024-11-10 14:50:33,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:50:33,036 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 51 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:33,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 990 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 15.6s Time] [2024-11-10 14:50:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-10 14:50:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-10 14:50:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 395 states have (on average 1.2632911392405064) internal successors, (499), 407 states have internal predecessors, (499), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-10 14:50:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 540 transitions. [2024-11-10 14:50:33,047 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 540 transitions. Word has length 143 [2024-11-10 14:50:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:33,048 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 540 transitions. [2024-11-10 14:50:33,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 14:50:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 540 transitions. [2024-11-10 14:50:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 14:50:33,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:33,050 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:33,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 14:50:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:33,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash -434740902, now seen corresponding path program 1 times [2024-11-10 14:50:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:33,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088558173] [2024-11-10 14:50:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:33,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:33,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:33,254 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:33,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 14:50:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:33,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 14:50:33,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-10 14:50:33,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:50:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-10 14:50:34,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:34,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088558173] [2024-11-10 14:50:34,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088558173] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:50:34,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:50:34,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 14:50:34,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000167824] [2024-11-10 14:50:34,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:50:34,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 14:50:34,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:34,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 14:50:34,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 14:50:34,051 INFO L87 Difference]: Start difference. First operand 420 states and 540 transitions. Second operand has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:34,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:34,496 INFO L93 Difference]: Finished difference Result 435 states and 564 transitions. [2024-11-10 14:50:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 14:50:34,497 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2024-11-10 14:50:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:34,498 INFO L225 Difference]: With dead ends: 435 [2024-11-10 14:50:34,499 INFO L226 Difference]: Without dead ends: 431 [2024-11-10 14:50:34,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:50:34,499 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 7 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3459 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:34,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3459 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 14:50:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-10 14:50:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2024-11-10 14:50:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 404 states have (on average 1.2648514851485149) internal successors, (511), 416 states have internal predecessors, (511), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-10 14:50:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 552 transitions. [2024-11-10 14:50:34,508 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 552 transitions. Word has length 164 [2024-11-10 14:50:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:34,508 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 552 transitions. [2024-11-10 14:50:34,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 552 transitions. [2024-11-10 14:50:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 14:50:34,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:34,510 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:34,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 14:50:34,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:34,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:34,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash 768408480, now seen corresponding path program 2 times [2024-11-10 14:50:34,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:34,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840086192] [2024-11-10 14:50:34,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:50:34,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:34,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:34,713 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:34,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 14:50:35,329 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:50:35,329 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:50:35,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 14:50:35,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 264 proven. 55 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-10 14:50:35,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:50:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 2 proven. 314 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-10 14:50:35,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:35,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840086192] [2024-11-10 14:50:35,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840086192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:50:35,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:50:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 14:50:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620168369] [2024-11-10 14:50:35,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:50:35,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 14:50:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:35,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 14:50:35,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 14:50:35,880 INFO L87 Difference]: Start difference. First operand 429 states and 552 transitions. Second operand has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:37,205 INFO L93 Difference]: Finished difference Result 453 states and 594 transitions. [2024-11-10 14:50:37,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 14:50:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 182 [2024-11-10 14:50:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:37,208 INFO L225 Difference]: With dead ends: 453 [2024-11-10 14:50:37,209 INFO L226 Difference]: Without dead ends: 449 [2024-11-10 14:50:37,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 14:50:37,210 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 14 mSDsluCounter, 3820 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4170 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:37,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4170 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 14:50:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-10 14:50:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-11-10 14:50:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 422 states have (on average 1.2677725118483412) internal successors, (535), 434 states have internal predecessors, (535), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-10 14:50:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 576 transitions. [2024-11-10 14:50:37,224 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 576 transitions. Word has length 182 [2024-11-10 14:50:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:37,224 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 576 transitions. [2024-11-10 14:50:37,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 576 transitions. [2024-11-10 14:50:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-10 14:50:37,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:37,226 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:37,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-10 14:50:37,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:37,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash -616470048, now seen corresponding path program 3 times [2024-11-10 14:50:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357808180] [2024-11-10 14:50:37,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:50:37,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:37,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:37,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:37,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 14:50:37,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:50:37,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:50:37,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:50:37,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-10 14:50:38,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:50:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-10 14:50:38,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357808180] [2024-11-10 14:50:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357808180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:50:38,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:50:38,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 14:50:38,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009117540] [2024-11-10 14:50:38,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:50:38,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:50:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:38,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:50:38,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:50:38,389 INFO L87 Difference]: Start difference. First operand 447 states and 576 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:38,712 INFO L93 Difference]: Finished difference Result 861 states and 1096 transitions. [2024-11-10 14:50:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:50:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 218 [2024-11-10 14:50:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:38,715 INFO L225 Difference]: With dead ends: 861 [2024-11-10 14:50:38,715 INFO L226 Difference]: Without dead ends: 861 [2024-11-10 14:50:38,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:50:38,715 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 868 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:38,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1624 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 14:50:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-10 14:50:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-11-10 14:50:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 821 states have (on average 1.2423873325213155) internal successors, (1020), 833 states have internal predecessors, (1020), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-10 14:50:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1096 transitions. [2024-11-10 14:50:38,729 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1096 transitions. Word has length 218 [2024-11-10 14:50:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:38,729 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1096 transitions. [2024-11-10 14:50:38,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1096 transitions. [2024-11-10 14:50:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-11-10 14:50:38,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:38,735 INFO L215 NwaCegarLoop]: trace histogram [66, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:38,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 14:50:38,936 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-11-10 14:50:38,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash -73150424, now seen corresponding path program 1 times [2024-11-10 14:50:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059126759] [2024-11-10 14:50:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:38,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:38,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:38,940 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:38,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 14:50:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:50:40,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 3009 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 14:50:40,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3083 backedges. 1209 proven. 253 refuted. 0 times theorem prover too weak. 1621 trivial. 0 not checked. [2024-11-10 14:50:41,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:50:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3083 backedges. 119 proven. 1340 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 14:50:42,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:42,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059126759] [2024-11-10 14:50:42,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059126759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:50:42,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:50:42,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 14:50:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904647163] [2024-11-10 14:50:42,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:50:42,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 14:50:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 14:50:42,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 14:50:42,431 INFO L87 Difference]: Start difference. First operand 861 states and 1096 transitions. Second operand has 50 states, 50 states have (on average 4.64) internal successors, (232), 50 states have internal predecessors, (232), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:47,248 INFO L93 Difference]: Finished difference Result 901 states and 1175 transitions. [2024-11-10 14:50:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 14:50:47,249 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.64) internal successors, (232), 50 states have internal predecessors, (232), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 545 [2024-11-10 14:50:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:47,251 INFO L225 Difference]: With dead ends: 901 [2024-11-10 14:50:47,251 INFO L226 Difference]: Without dead ends: 897 [2024-11-10 14:50:47,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 14:50:47,253 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 26 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8677 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:47,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8677 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 14:50:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-10 14:50:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 895. [2024-11-10 14:50:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 855 states have (on average 1.246783625730994) internal successors, (1066), 867 states have internal predecessors, (1066), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-10 14:50:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1142 transitions. [2024-11-10 14:50:47,266 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1142 transitions. Word has length 545 [2024-11-10 14:50:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:47,266 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1142 transitions. [2024-11-10 14:50:47,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.64) internal successors, (232), 50 states have internal predecessors, (232), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-10 14:50:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1142 transitions. [2024-11-10 14:50:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-11-10 14:50:47,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:47,275 INFO L215 NwaCegarLoop]: trace histogram [134, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:47,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-10 14:50:47,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:47,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:47,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1381868264, now seen corresponding path program 2 times [2024-11-10 14:50:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530829503] [2024-11-10 14:50:47,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:50:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:47,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:47,479 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:47,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 14:50:50,028 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:50:50,028 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:50:50,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 3757 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 14:50:50,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10121 backedges. 5974 proven. 276 refuted. 0 times theorem prover too weak. 3871 trivial. 0 not checked. [2024-11-10 14:50:50,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:50:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10121 backedges. 1201 proven. 1936 refuted. 0 times theorem prover too weak. 6984 trivial. 0 not checked. [2024-11-10 14:50:51,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530829503] [2024-11-10 14:50:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530829503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:50:51,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:50:51,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-10 14:50:51,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251203180] [2024-11-10 14:50:51,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:50:51,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 14:50:51,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 14:50:51,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 14:50:51,894 INFO L87 Difference]: Start difference. First operand 895 states and 1142 transitions. Second operand has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 14:50:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:56,793 INFO L93 Difference]: Finished difference Result 924 states and 1210 transitions. [2024-11-10 14:50:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-10 14:50:56,795 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 613 [2024-11-10 14:50:56,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:56,798 INFO L225 Difference]: With dead ends: 924 [2024-11-10 14:50:56,798 INFO L226 Difference]: Without dead ends: 924 [2024-11-10 14:50:56,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1271 GetRequests, 1174 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-10 14:50:56,802 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 27 mSDsluCounter, 8628 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8977 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:56,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8977 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 14:50:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-10 14:50:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2024-11-10 14:50:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 880 states have (on average 1.268181818181818) internal successors, (1116), 892 states have internal predecessors, (1116), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-10 14:50:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1192 transitions. [2024-11-10 14:50:56,819 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1192 transitions. Word has length 613 [2024-11-10 14:50:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:56,820 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1192 transitions. [2024-11-10 14:50:56,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-10 14:50:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1192 transitions. [2024-11-10 14:50:56,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-10 14:50:56,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:56,824 INFO L215 NwaCegarLoop]: trace histogram [184, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:56,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-10 14:50:57,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:57,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:57,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1033416238, now seen corresponding path program 3 times [2024-11-10 14:50:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:57,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87053038] [2024-11-10 14:50:57,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:50:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:57,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:57,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 14:50:58,002 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:50:58,003 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:50:58,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:50:58,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:50:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18246 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 18090 trivial. 0 not checked. [2024-11-10 14:50:58,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:50:58,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:50:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87053038] [2024-11-10 14:50:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87053038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:50:58,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:50:58,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:50:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220776617] [2024-11-10 14:50:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:50:58,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:50:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:50:58,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:50:58,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:50:58,053 INFO L87 Difference]: Start difference. First operand 920 states and 1192 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 14:50:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:50:58,129 INFO L93 Difference]: Finished difference Result 932 states and 1172 transitions. [2024-11-10 14:50:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:50:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 663 [2024-11-10 14:50:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:50:58,132 INFO L225 Difference]: With dead ends: 932 [2024-11-10 14:50:58,132 INFO L226 Difference]: Without dead ends: 932 [2024-11-10 14:50:58,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:50:58,132 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 30 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:50:58,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 955 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:50:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-10 14:50:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-11-10 14:50:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 892 states have (on average 1.2286995515695067) internal successors, (1096), 904 states have internal predecessors, (1096), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-10 14:50:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1172 transitions. [2024-11-10 14:50:58,144 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1172 transitions. Word has length 663 [2024-11-10 14:50:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:50:58,145 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1172 transitions. [2024-11-10 14:50:58,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 14:50:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1172 transitions. [2024-11-10 14:50:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-10 14:50:58,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:50:58,149 INFO L215 NwaCegarLoop]: trace histogram [184, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:50:58,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 14:50:58,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:58,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:50:58,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:50:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1213926114, now seen corresponding path program 1 times [2024-11-10 14:50:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:50:58,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312068028] [2024-11-10 14:50:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:50:58,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:50:58,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:50:58,353 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:50:58,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 14:51:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:01,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 4259 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 14:51:01,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:03,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18246 backedges. 11174 proven. 1176 refuted. 0 times theorem prover too weak. 5896 trivial. 0 not checked. [2024-11-10 14:51:03,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:51:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18246 backedges. 2326 proven. 5786 refuted. 0 times theorem prover too weak. 10134 trivial. 0 not checked. [2024-11-10 14:51:08,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:08,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312068028] [2024-11-10 14:51:08,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312068028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:51:08,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:51:08,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-10 14:51:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712710796] [2024-11-10 14:51:08,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:51:08,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-10 14:51:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-10 14:51:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-10 14:51:08,029 INFO L87 Difference]: Start difference. First operand 932 states and 1172 transitions. Second operand has 102 states, 102 states have (on average 2.784313725490196) internal successors, (284), 102 states have internal predecessors, (284), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)