./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 3061b6dc 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:12:22,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:12:22,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:12:22,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:12:22,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:12:22,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:12:22,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:12:22,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:12:22,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:12:22,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:12:22,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:12:22,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:12:22,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:12:22,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:12:22,107 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:12:22,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:12:22,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:12:22,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:12:22,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:12:22,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:12:22,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:12:22,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:12:22,111 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:12:22,111 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:12:22,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:12:22,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:12:22,112 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:12:22,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:12:22,112 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:12:22,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:12:22,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:12:22,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:12:22,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:12:22,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:12:22,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:12:22,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:12:22,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:22,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:12:22,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:12:22,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:12:22,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:12:22,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:12:22,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:12:22,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:12:22,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:12:22,117 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-19 06:12:22,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:12:22,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:12:22,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:12:22,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:12:22,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:12:22,346 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-19 06:12:23,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:12:23,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:12:23,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-19 06:12:23,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9927aca2/a42e5a70ce974f2898f779e074e870a4/FLAGb2036fe3d [2024-11-19 06:12:23,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9927aca2/a42e5a70ce974f2898f779e074e870a4 [2024-11-19 06:12:23,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:12:23,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:12:23,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:23,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:12:23,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:12:23,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:23" (1/1) ... [2024-11-19 06:12:23,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3613741c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:23, skipping insertion in model container [2024-11-19 06:12:23,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:23" (1/1) ... [2024-11-19 06:12:23,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:12:24,270 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,299 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,304 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,311 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,344 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,345 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,347 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,353 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,380 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,380 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,386 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,388 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,389 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,389 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,392 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,394 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,395 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,419 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,421 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:24,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:24,441 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-19 06:12:24,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5816eaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:24, skipping insertion in model container [2024-11-19 06:12:24,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:24,443 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:12:24,445 INFO L158 Benchmark]: Toolchain (without parser) took 604.00ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 81.0MB in the beginning and 172.3MB in the end (delta: -91.3MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-19 06:12:24,445 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 106.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:12:24,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.18ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 80.8MB in the beginning and 172.3MB in the end (delta: -91.5MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-11-19 06:12:24,447 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.11ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 106.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.18ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 80.8MB in the beginning and 172.3MB in the end (delta: -91.5MB). Peak memory consumption was 37.4MB. 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:12:25,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:12:26,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:12:26,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:12:26,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:12:26,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:12:26,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:12:26,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:12:26,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:12:26,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:12:26,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:12:26,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:12:26,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:12:26,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:12:26,043 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:12:26,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:12:26,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:12:26,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:12:26,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:12:26,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:12:26,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:12:26,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:12:26,045 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:12:26,045 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:12:26,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:12:26,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:12:26,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:12:26,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:12:26,046 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:12:26,047 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:12:26,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:12:26,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:12:26,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:12:26,047 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:12:26,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:12:26,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:12:26,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:12:26,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:12:26,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:26,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:12:26,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:12:26,049 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:12:26,049 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:12:26,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:12:26,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:12:26,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:12:26,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:12:26,050 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-19 06:12:26,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:12:26,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:12:26,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:12:26,302 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:12:26,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:12:26,303 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-19 06:12:27,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:12:27,868 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:12:27,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-19 06:12:27,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5846c3112/f2628ef3d3254af28abcbb194be20793/FLAG8e2bd3312 [2024-11-19 06:12:27,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5846c3112/f2628ef3d3254af28abcbb194be20793 [2024-11-19 06:12:27,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:12:27,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:12:27,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:27,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:12:27,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:12:27,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:27" (1/1) ... [2024-11-19 06:12:27,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1245d74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:27, skipping insertion in model container [2024-11-19 06:12:27,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:27" (1/1) ... [2024-11-19 06:12:27,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:12:28,281 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,316 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,327 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,334 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,370 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,372 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,377 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,382 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,397 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,398 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,400 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,401 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,406 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,407 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,411 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,412 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,412 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,413 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,415 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:28,435 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:12:28,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:12:28,474 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,486 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,488 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,498 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,513 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,515 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,523 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,524 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,525 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,525 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,525 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,527 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,528 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,532 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,533 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,534 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:28,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:28,542 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:12:28,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:28,656 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:12:28,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28 WrapperNode [2024-11-19 06:12:28,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:28,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:12:28,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:12:28,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:12:28,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,755 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1471 [2024-11-19 06:12:28,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:12:28,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:12:28,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:12:28,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:12:28,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,890 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-19 06:12:28,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:12:28,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:12:28,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:12:28,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:12:28,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (1/1) ... [2024-11-19 06:12:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:28,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:29,002 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-19 06:12:29,006 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-19 06:12:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:12:29,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:12:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:12:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:12:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:12:29,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:12:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:12:29,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:12:29,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:12:29,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:12:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:12:29,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:12:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:12:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:12:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:12:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:12:29,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:12:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:12:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:12:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:12:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:12:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:12:29,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:12:29,260 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:12:29,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:12:42,359 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2024-11-19 06:12:42,359 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:12:42,376 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:12:42,377 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-19 06:12:42,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:12:42 BoogieIcfgContainer [2024-11-19 06:12:42,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:12:42,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:12:42,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:12:42,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:12:42,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:12:27" (1/3) ... [2024-11-19 06:12:42,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea58e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:12:42, skipping insertion in model container [2024-11-19 06:12:42,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:28" (2/3) ... [2024-11-19 06:12:42,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea58e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:12:42, skipping insertion in model container [2024-11-19 06:12:42,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:12:42" (3/3) ... [2024-11-19 06:12:42,386 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2024-11-19 06:12:42,397 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:12:42,398 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:12:42,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:12:42,443 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;@486fde48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:12:42,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:12:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 251 states have (on average 1.6613545816733069) internal successors, (417), 263 states have internal predecessors, (417), 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-19 06:12:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:12:42,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:42,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:12:42,456 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:42,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash 968964661, now seen corresponding path program 1 times [2024-11-19 06:12:42,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945635106] [2024-11-19 06:12:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:42,468 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-19 06:12:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:42,471 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-19 06:12:42,476 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-19 06:12:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:42,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:12:42,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:42,654 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-19 06:12:42,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:42,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945635106] [2024-11-19 06:12:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945635106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:42,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:12:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626943049] [2024-11-19 06:12:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:42,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:12:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:12:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:12:42,688 INFO L87 Difference]: Start difference. First operand has 272 states, 251 states have (on average 1.6613545816733069) internal successors, (417), 263 states have internal predecessors, (417), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 06:12:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:42,722 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2024-11-19 06:12:42,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:12:42,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2024-11-19 06:12:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:42,734 INFO L225 Difference]: With dead ends: 271 [2024-11-19 06:12:42,734 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 06:12:42,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-19 06:12:42,740 INFO L432 NwaCegarLoop]: 362 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, 362 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-19 06:12:42,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:12:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 06:12:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-19 06:12:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 260 states have internal predecessors, (328), 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-19 06:12:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2024-11-19 06:12:42,808 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 11 [2024-11-19 06:12:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2024-11-19 06:12:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-19 06:12:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2024-11-19 06:12:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:12:42,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:42,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:12:42,818 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-19 06:12:43,011 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-19 06:12:43,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:43,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash 513749610, now seen corresponding path program 1 times [2024-11-19 06:12:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475009446] [2024-11-19 06:12:43,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:43,015 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-19 06:12:43,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:43,018 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-19 06:12:43,019 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-19 06:12:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:43,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:12:43,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:43,195 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-19 06:12:43,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:43,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:43,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475009446] [2024-11-19 06:12:43,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475009446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:43,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:43,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:12:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457382493] [2024-11-19 06:12:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:43,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:12:43,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:12:43,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:12:43,199 INFO L87 Difference]: Start difference. First operand 269 states and 360 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-19 06:12:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:43,323 INFO L93 Difference]: Finished difference Result 443 states and 586 transitions. [2024-11-19 06:12:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:12:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-11-19 06:12:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:43,331 INFO L225 Difference]: With dead ends: 443 [2024-11-19 06:12:43,331 INFO L226 Difference]: Without dead ends: 443 [2024-11-19 06:12:43,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-19 06:12:43,332 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 213 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 739 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-19 06:12:43,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 739 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-19 06:12:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 270. [2024-11-19 06:12:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 250 states have (on average 1.316) internal successors, (329), 261 states have internal predecessors, (329), 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-19 06:12:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 361 transitions. [2024-11-19 06:12:43,351 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 361 transitions. Word has length 11 [2024-11-19 06:12:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:43,351 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 361 transitions. [2024-11-19 06:12:43,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-19 06:12:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 361 transitions. [2024-11-19 06:12:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 06:12:43,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:43,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:43,357 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-19 06:12:43,557 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-19 06:12:43,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash 545084420, now seen corresponding path program 1 times [2024-11-19 06:12:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:43,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058762349] [2024-11-19 06:12:43,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:43,560 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-19 06:12:43,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:43,561 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-19 06:12:43,562 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-19 06:12:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:44,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:12:44,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:12:44,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:44,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:44,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058762349] [2024-11-19 06:12:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058762349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:44,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:12:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226832189] [2024-11-19 06:12:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:44,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:12:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:44,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:12:44,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:12:44,081 INFO L87 Difference]: Start difference. First operand 270 states and 361 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-19 06:12:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:44,180 INFO L93 Difference]: Finished difference Result 273 states and 356 transitions. [2024-11-19 06:12:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:12:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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 117 [2024-11-19 06:12:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:44,181 INFO L225 Difference]: With dead ends: 273 [2024-11-19 06:12:44,181 INFO L226 Difference]: Without dead ends: 273 [2024-11-19 06:12:44,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-19 06:12:44,182 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 30 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 971 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-19 06:12:44,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 971 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-19 06:12:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2024-11-19 06:12:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 264 states have internal predecessors, (324), 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-19 06:12:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 356 transitions. [2024-11-19 06:12:44,190 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 356 transitions. Word has length 117 [2024-11-19 06:12:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:44,190 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 356 transitions. [2024-11-19 06:12:44,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-19 06:12:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 356 transitions. [2024-11-19 06:12:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 06:12:44,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:44,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:44,207 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-19 06:12:44,397 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-19 06:12:44,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:44,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash 471768592, now seen corresponding path program 1 times [2024-11-19 06:12:44,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:44,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95005338] [2024-11-19 06:12:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:44,399 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-19 06:12:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:44,401 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-19 06:12:44,402 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-19 06:12:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:44,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:12:44,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:12:44,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:44,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95005338] [2024-11-19 06:12:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95005338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:12:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682475849] [2024-11-19 06:12:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:44,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:12:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:12:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:12:44,903 INFO L87 Difference]: Start difference. First operand 273 states and 356 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-19 06:12:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:44,954 INFO L93 Difference]: Finished difference Result 267 states and 346 transitions. [2024-11-19 06:12:44,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:12:44,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 117 [2024-11-19 06:12:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:44,955 INFO L225 Difference]: With dead ends: 267 [2024-11-19 06:12:44,955 INFO L226 Difference]: Without dead ends: 267 [2024-11-19 06:12:44,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:12:44,956 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:44,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:12:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-19 06:12:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-19 06:12:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 247 states have (on average 1.271255060728745) internal successors, (314), 258 states have internal predecessors, (314), 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-19 06:12:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 346 transitions. [2024-11-19 06:12:44,962 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 346 transitions. Word has length 117 [2024-11-19 06:12:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:44,963 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 346 transitions. [2024-11-19 06:12:44,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-19 06:12:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 346 transitions. [2024-11-19 06:12:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 06:12:44,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:44,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:44,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:12:45,168 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-19 06:12:45,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1058044814, now seen corresponding path program 1 times [2024-11-19 06:12:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:45,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628464387] [2024-11-19 06:12:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:45,172 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-19 06:12:45,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:45,175 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-19 06:12:45,176 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-19 06:12:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:45,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:12:45,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:12:45,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:45,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628464387] [2024-11-19 06:12:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628464387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:45,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:45,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:12:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630814889] [2024-11-19 06:12:45,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:45,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:12:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:12:45,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:12:45,782 INFO L87 Difference]: Start difference. First operand 267 states and 346 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 06:12:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:46,206 INFO L93 Difference]: Finished difference Result 357 states and 453 transitions. [2024-11-19 06:12:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:12:46,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 117 [2024-11-19 06:12:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:46,211 INFO L225 Difference]: With dead ends: 357 [2024-11-19 06:12:46,211 INFO L226 Difference]: Without dead ends: 357 [2024-11-19 06:12:46,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 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-19 06:12:46,212 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 69 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 692 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:46,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 692 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:12:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-19 06:12:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 303. [2024-11-19 06:12:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 283 states have (on average 1.2367491166077738) internal successors, (350), 294 states have internal predecessors, (350), 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-19 06:12:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 382 transitions. [2024-11-19 06:12:46,223 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 382 transitions. Word has length 117 [2024-11-19 06:12:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:46,223 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 382 transitions. [2024-11-19 06:12:46,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-19 06:12:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2024-11-19 06:12:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 06:12:46,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:46,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:46,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:12:46,431 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-19 06:12:46,432 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:46,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1328039991, now seen corresponding path program 1 times [2024-11-19 06:12:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385450779] [2024-11-19 06:12:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:46,433 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-19 06:12:46,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:46,434 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-19 06:12:46,435 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-19 06:12:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:46,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:12:46,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:12:46,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:46,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:46,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385450779] [2024-11-19 06:12:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385450779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:12:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804486805] [2024-11-19 06:12:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:46,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:12:46,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:12:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:12:46,912 INFO L87 Difference]: Start difference. First operand 303 states and 382 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-19 06:12:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:46,962 INFO L93 Difference]: Finished difference Result 306 states and 387 transitions. [2024-11-19 06:12:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:12:46,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 132 [2024-11-19 06:12:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:46,967 INFO L225 Difference]: With dead ends: 306 [2024-11-19 06:12:46,967 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 06:12:46,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 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-19 06:12:46,968 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 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-19 06:12:46,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:12:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 06:12:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-19 06:12:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 285 states have (on average 1.2385964912280703) internal successors, (353), 297 states have internal predecessors, (353), 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-19 06:12:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 387 transitions. [2024-11-19 06:12:46,976 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 387 transitions. Word has length 132 [2024-11-19 06:12:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:46,977 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 387 transitions. [2024-11-19 06:12:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-19 06:12:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 387 transitions. [2024-11-19 06:12:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 06:12:46,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:46,978 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] [2024-11-19 06:12:46,990 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-19 06:12:47,179 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-19 06:12:47,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:47,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 735372331, now seen corresponding path program 1 times [2024-11-19 06:12:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272666440] [2024-11-19 06:12:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:12:47,180 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-19 06:12:47,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:47,183 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-19 06:12:47,183 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-19 06:12:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:12:47,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:12:47,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:12:47,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:12:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:12:47,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:47,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272666440] [2024-11-19 06:12:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272666440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:12:47,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:12:47,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:12:47,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764376248] [2024-11-19 06:12:47,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:12:47,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:12:47,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:47,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:12:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:12:47,750 INFO L87 Difference]: Start difference. First operand 306 states and 387 transitions. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 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-19 06:12:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:12:47,895 INFO L93 Difference]: Finished difference Result 317 states and 404 transitions. [2024-11-19 06:12:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:12:47,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 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 134 [2024-11-19 06:12:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:12:47,897 INFO L225 Difference]: With dead ends: 317 [2024-11-19 06:12:47,897 INFO L226 Difference]: Without dead ends: 317 [2024-11-19 06:12:47,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 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-19 06:12:47,898 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 4 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:12:47,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1682 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:12:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-19 06:12:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2024-11-19 06:12:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 293 states have (on average 1.2525597269624573) internal successors, (367), 305 states have internal predecessors, (367), 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-19 06:12:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 401 transitions. [2024-11-19 06:12:47,909 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 401 transitions. Word has length 134 [2024-11-19 06:12:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:12:47,910 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 401 transitions. [2024-11-19 06:12:47,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 8 states have internal predecessors, (137), 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-19 06:12:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 401 transitions. [2024-11-19 06:12:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 06:12:47,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:12:47,912 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:12:47,923 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-19 06:12:48,112 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-19 06:12:48,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:12:48,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:12:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1396270839, now seen corresponding path program 2 times [2024-11-19 06:12:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:12:48,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547521031] [2024-11-19 06:12:48,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:12:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:12:48,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:12:48,115 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-19 06:12:48,116 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-19 06:12:48,374 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:12:48,374 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:12:48,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:12:48,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:12:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 06:12:48,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:12:48,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:12:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547521031] [2024-11-19 06:12:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547521031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:12:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:12:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:12:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360489210] [2024-11-19 06:12:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:12:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:12:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:12:48,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:12:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:12:48,853 INFO L87 Difference]: Start difference. First operand 315 states and 401 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-19 06:12:52,997 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-19 06:12:57,553 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-19 06:13:03,520 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-19 06:13:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:03,521 INFO L93 Difference]: Finished difference Result 398 states and 510 transitions. [2024-11-19 06:13:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:13:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 138 [2024-11-19 06:13:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:03,531 INFO L225 Difference]: With dead ends: 398 [2024-11-19 06:13:03,531 INFO L226 Difference]: Without dead ends: 398 [2024-11-19 06:13:03,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 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-19 06:13:03,532 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 46 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:03,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 959 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2024-11-19 06:13:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-19 06:13:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-19 06:13:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 373 states have (on average 1.257372654155496) internal successors, (469), 385 states have internal predecessors, (469), 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-19 06:13:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 510 transitions. [2024-11-19 06:13:03,542 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 510 transitions. Word has length 138 [2024-11-19 06:13:03,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:03,543 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 510 transitions. [2024-11-19 06:13:03,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-19 06:13:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 510 transitions. [2024-11-19 06:13:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-19 06:13:03,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:03,546 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:03,549 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-19 06:13:03,746 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-19 06:13:03,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:03,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1072435231, now seen corresponding path program 1 times [2024-11-19 06:13:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382105558] [2024-11-19 06:13:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:03,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:13:03,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:03,749 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-19 06:13:03,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:13:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:04,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:13:04,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 06:13:04,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 06:13:04,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:04,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382105558] [2024-11-19 06:13:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382105558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:04,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:04,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:13:04,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377341] [2024-11-19 06:13:04,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:04,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:13:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:13:04,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:13:04,532 INFO L87 Difference]: Start difference. First operand 398 states and 510 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 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-19 06:13:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:04,932 INFO L93 Difference]: Finished difference Result 413 states and 534 transitions. [2024-11-19 06:13:04,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:13:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 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 159 [2024-11-19 06:13:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:04,934 INFO L225 Difference]: With dead ends: 413 [2024-11-19 06:13:04,934 INFO L226 Difference]: Without dead ends: 409 [2024-11-19 06:13:04,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:13:04,935 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 8 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:04,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2362 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:13:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-19 06:13:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 407. [2024-11-19 06:13:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 382 states have (on average 1.2591623036649215) internal successors, (481), 394 states have internal predecessors, (481), 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-19 06:13:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions. [2024-11-19 06:13:04,946 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 159 [2024-11-19 06:13:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:04,946 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions. [2024-11-19 06:13:04,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 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-19 06:13:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions. [2024-11-19 06:13:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-19 06:13:04,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:04,948 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:04,963 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-19 06:13:05,148 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-19 06:13:05,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash -647586373, now seen corresponding path program 2 times [2024-11-19 06:13:05,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:05,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984759327] [2024-11-19 06:13:05,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:13:05,150 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-19 06:13:05,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:05,151 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-19 06:13:05,152 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-19 06:13:05,788 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:13:05,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:05,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:13:05,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 263 proven. 55 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-19 06:13:05,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 1 proven. 314 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-19 06:13:06,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:06,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984759327] [2024-11-19 06:13:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984759327] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:06,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:13:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302127704] [2024-11-19 06:13:06,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:06,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:13:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:06,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:13:06,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:13:06,354 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 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-19 06:13:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:07,609 INFO L93 Difference]: Finished difference Result 431 states and 564 transitions. [2024-11-19 06:13:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:13:07,611 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 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 177 [2024-11-19 06:13:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:07,613 INFO L225 Difference]: With dead ends: 431 [2024-11-19 06:13:07,613 INFO L226 Difference]: Without dead ends: 427 [2024-11-19 06:13:07,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 328 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-19 06:13:07,614 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 14 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:07,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4383 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:13:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-19 06:13:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2024-11-19 06:13:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 400 states have (on average 1.2625) internal successors, (505), 412 states have internal predecessors, (505), 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-19 06:13:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 546 transitions. [2024-11-19 06:13:07,622 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 546 transitions. Word has length 177 [2024-11-19 06:13:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:07,622 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 546 transitions. [2024-11-19 06:13:07,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.153846153846154) internal successors, (160), 26 states have internal predecessors, (160), 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-19 06:13:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 546 transitions. [2024-11-19 06:13:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-19 06:13:07,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:07,624 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:07,640 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-19 06:13:07,825 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-19 06:13:07,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:07,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1769409467, now seen corresponding path program 3 times [2024-11-19 06:13:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932844099] [2024-11-19 06:13:07,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:13:07,826 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-19 06:13:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:07,827 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-19 06:13:07,828 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-19 06:13:08,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:13:08,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:08,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:13:08,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-19 06:13:08,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-19 06:13:08,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:08,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932844099] [2024-11-19 06:13:08,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932844099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:08,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:08,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 06:13:08,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054763037] [2024-11-19 06:13:08,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:08,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:13:08,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:08,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:13:08,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:13:08,722 INFO L87 Difference]: Start difference. First operand 425 states and 546 transitions. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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-19 06:13:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:09,020 INFO L93 Difference]: Finished difference Result 815 states and 1034 transitions. [2024-11-19 06:13:09,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:13:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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 213 [2024-11-19 06:13:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:09,023 INFO L225 Difference]: With dead ends: 815 [2024-11-19 06:13:09,024 INFO L226 Difference]: Without dead ends: 815 [2024-11-19 06:13:09,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 420 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-19 06:13:09,024 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 774 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:09,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1552 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:13:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-19 06:13:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2024-11-19 06:13:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 775 states have (on average 1.2361290322580645) internal successors, (958), 787 states have internal predecessors, (958), 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-19 06:13:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1034 transitions. [2024-11-19 06:13:09,042 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1034 transitions. Word has length 213 [2024-11-19 06:13:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:09,043 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1034 transitions. [2024-11-19 06:13:09,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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-19 06:13:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1034 transitions. [2024-11-19 06:13:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-11-19 06:13:09,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:09,049 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 06:13:09,058 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 (12)] Ended with exit code 0 [2024-11-19 06:13:09,250 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-19 06:13:09,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 850507879, now seen corresponding path program 1 times [2024-11-19 06:13:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206547639] [2024-11-19 06:13:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:09,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-19 06:13:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:09,255 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-19 06:13:09,256 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-19 06:13:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:11,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:13:11,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 1202 proven. 253 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2024-11-19 06:13:11,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3061 backedges. 112 proven. 1340 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2024-11-19 06:13:12,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:12,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206547639] [2024-11-19 06:13:12,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206547639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:12,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:12,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:13:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851815640] [2024-11-19 06:13:12,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:12,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:13:12,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:12,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:13:12,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:13:12,674 INFO L87 Difference]: Start difference. First operand 815 states and 1034 transitions. Second operand has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 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-19 06:13:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:17,331 INFO L93 Difference]: Finished difference Result 855 states and 1113 transitions. [2024-11-19 06:13:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:13:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 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 531 [2024-11-19 06:13:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:17,336 INFO L225 Difference]: With dead ends: 855 [2024-11-19 06:13:17,336 INFO L226 Difference]: Without dead ends: 851 [2024-11-19 06:13:17,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:13:17,339 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 25 mSDsluCounter, 7754 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8094 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:17,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8094 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 06:13:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-19 06:13:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2024-11-19 06:13:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 809 states have (on average 1.2410383189122374) internal successors, (1004), 821 states have internal predecessors, (1004), 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-19 06:13:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1080 transitions. [2024-11-19 06:13:17,353 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1080 transitions. Word has length 531 [2024-11-19 06:13:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:17,353 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1080 transitions. [2024-11-19 06:13:17,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 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-19 06:13:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1080 transitions. [2024-11-19 06:13:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-11-19 06:13:17,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:17,357 INFO L215 NwaCegarLoop]: trace histogram [134, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 06:13:17,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:13:17,557 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-19 06:13:17,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:17,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1978091929, now seen corresponding path program 2 times [2024-11-19 06:13:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:17,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880086820] [2024-11-19 06:13:17,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:13:17,560 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-19 06:13:17,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:17,562 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-19 06:13:17,563 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-19 06:13:20,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:13:20,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:20,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 3735 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:13:20,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10099 backedges. 5967 proven. 276 refuted. 0 times theorem prover too weak. 3856 trivial. 0 not checked. [2024-11-19 06:13:20,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10099 backedges. 1194 proven. 1936 refuted. 0 times theorem prover too weak. 6969 trivial. 0 not checked. [2024-11-19 06:13:21,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:21,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880086820] [2024-11-19 06:13:21,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880086820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:21,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:21,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:13:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541045955] [2024-11-19 06:13:21,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:21,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:13:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:21,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:13:21,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:13:21,994 INFO L87 Difference]: Start difference. First operand 849 states and 1080 transitions. Second operand has 52 states, 52 states have (on average 4.384615384615385) internal successors, (228), 52 states have internal predecessors, (228), 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-19 06:13:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:26,854 INFO L93 Difference]: Finished difference Result 878 states and 1148 transitions. [2024-11-19 06:13:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:13:26,855 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.384615384615385) internal successors, (228), 52 states have internal predecessors, (228), 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 599 [2024-11-19 06:13:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:26,858 INFO L225 Difference]: With dead ends: 878 [2024-11-19 06:13:26,858 INFO L226 Difference]: Without dead ends: 878 [2024-11-19 06:13:26,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1243 GetRequests, 1146 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-19 06:13:26,860 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 26 mSDsluCounter, 8378 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8717 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:26,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8717 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 06:13:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-19 06:13:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 874. [2024-11-19 06:13:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 834 states have (on average 1.26378896882494) internal successors, (1054), 846 states have internal predecessors, (1054), 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-19 06:13:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1130 transitions. [2024-11-19 06:13:26,873 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1130 transitions. Word has length 599 [2024-11-19 06:13:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:26,873 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1130 transitions. [2024-11-19 06:13:26,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.384615384615385) internal successors, (228), 52 states have internal predecessors, (228), 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-19 06:13:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1130 transitions. [2024-11-19 06:13:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-11-19 06:13:26,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:26,878 INFO L215 NwaCegarLoop]: trace histogram [184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 06:13:26,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:13:27,078 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-19 06:13:27,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2068842805, now seen corresponding path program 3 times [2024-11-19 06:13:27,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:27,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278313668] [2024-11-19 06:13:27,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:13:27,081 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-19 06:13:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:27,082 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-19 06:13:27,083 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-19 06:13:28,065 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:13:28,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:28,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:13:28,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:28,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 18075 trivial. 0 not checked. [2024-11-19 06:13:28,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:28,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278313668] [2024-11-19 06:13:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278313668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:13:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132609221] [2024-11-19 06:13:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:13:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:28,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:13:28,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:13:28,119 INFO L87 Difference]: Start difference. First operand 874 states and 1130 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-19 06:13:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:28,187 INFO L93 Difference]: Finished difference Result 886 states and 1110 transitions. [2024-11-19 06:13:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:13:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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 649 [2024-11-19 06:13:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:28,190 INFO L225 Difference]: With dead ends: 886 [2024-11-19 06:13:28,190 INFO L226 Difference]: Without dead ends: 886 [2024-11-19 06:13:28,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 647 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-19 06:13:28,191 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 30 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 926 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-19 06:13:28,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 926 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:13:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-19 06:13:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-19 06:13:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 846 states have (on average 1.2222222222222223) internal successors, (1034), 858 states have internal predecessors, (1034), 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-19 06:13:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1110 transitions. [2024-11-19 06:13:28,203 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1110 transitions. Word has length 649 [2024-11-19 06:13:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:28,204 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1110 transitions. [2024-11-19 06:13:28,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 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-19 06:13:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1110 transitions. [2024-11-19 06:13:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2024-11-19 06:13:28,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:28,208 INFO L215 NwaCegarLoop]: trace histogram [184, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 06:13:28,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:13:28,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:13:28,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:28,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash 911370035, now seen corresponding path program 1 times [2024-11-19 06:13:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:28,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361658166] [2024-11-19 06:13:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:28,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:13:28,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:28,412 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:13:28,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:13:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:32,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 4237 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:13:32,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18224 backedges. 11167 proven. 1176 refuted. 0 times theorem prover too weak. 5881 trivial. 0 not checked. [2024-11-19 06:13:33,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18224 backedges. 2319 proven. 5786 refuted. 0 times theorem prover too weak. 10119 trivial. 0 not checked. [2024-11-19 06:13:38,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361658166] [2024-11-19 06:13:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361658166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:38,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:38,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:13:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293852928] [2024-11-19 06:13:38,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:38,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:13:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:38,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:13:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:13:38,293 INFO L87 Difference]: Start difference. First operand 886 states and 1110 transitions. Second operand has 102 states, 102 states have (on average 2.7254901960784315) internal successors, (278), 102 states have internal predecessors, (278), 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)