./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 17:26:23,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:26:23,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:26:23,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:26:23,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:26:23,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:26:23,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:26:23,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:26:23,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:26:23,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:26:23,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:26:23,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:26:23,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:26:23,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:26:23,382 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:26:23,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:26:23,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:26:23,383 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:26:23,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:26:23,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:26:23,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:26:23,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:26:23,389 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:26:23,389 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:26:23,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:26:23,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:26:23,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:26:23,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:26:23,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:26:23,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:26:23,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:26:23,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:26:23,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:26:23,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:26:23,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:26:23,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:26:23,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:26:23,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:26:23,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:26:23,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:26:23,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:26:23,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:26:23,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:26:23,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:26:23,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:26:23,396 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-clean/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-clean/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-10-11 17:26:23,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:26:23,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:26:23,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:26:23,676 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:26:23,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:26:23,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-10-11 17:26:25,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:26:25,487 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:26:25,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-10-11 17:26:25,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5df51ff4a/6dd1b5b582664c87a407b4cd3a23b75f/FLAG799e43270 [2024-10-11 17:26:25,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5df51ff4a/6dd1b5b582664c87a407b4cd3a23b75f [2024-10-11 17:26:25,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:26:25,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:26:25,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:26:25,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:26:25,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:26:25,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:26:25" (1/1) ... [2024-10-11 17:26:25,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661351f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:25, skipping insertion in model container [2024-10-11 17:26:25,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:26:25" (1/1) ... [2024-10-11 17:26:25,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:26:26,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:26:26,250 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-11 17:26:26,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@75b6d04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:26, skipping insertion in model container [2024-10-11 17:26:26,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:26:26,252 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:26:26,256 INFO L158 Benchmark]: Toolchain (without parser) took 723.43ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 64.8MB in the beginning and 142.7MB in the end (delta: -77.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-10-11 17:26:26,256 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 138.4MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:26:26,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.38ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 64.8MB in the beginning and 142.7MB in the end (delta: -77.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-10-11 17:26:26,259 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.21ms. Allocated memory is still 138.4MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.38ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 64.8MB in the beginning and 142.7MB in the end (delta: -77.9MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 17:26:28,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:26:28,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:26:28,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:26:28,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:26:28,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:26:28,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:26:28,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:26:28,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:26:28,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:26:28,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:26:28,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:26:28,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:26:28,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:26:28,614 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:26:28,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:26:28,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:26:28,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:26:28,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:26:28,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:26:28,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:26:28,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:26:28,621 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:26:28,621 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:26:28,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:26:28,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:26:28,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:26:28,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:26:28,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:26:28,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:26:28,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:26:28,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:26:28,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:26:28,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:26:28,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:26:28,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:26:28,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:26:28,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:26:28,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:26:28,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:26:28,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:26:28,628 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:26:28,629 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:26:28,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:26:28,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:26:28,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:26:28,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:26:28,630 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:26:28,630 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-clean/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-clean/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-10-11 17:26:29,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:26:29,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:26:29,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:26:29,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:26:29,044 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:26:29,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-10-11 17:26:30,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:26:31,038 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:26:31,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-10-11 17:26:31,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/76a4c9564/582d7a63276b4e3bb84deceff6d13423/FLAGbde3a7bfb [2024-10-11 17:26:31,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/76a4c9564/582d7a63276b4e3bb84deceff6d13423 [2024-10-11 17:26:31,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:26:31,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:26:31,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:26:31,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:26:31,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:26:31,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:26:31" (1/1) ... [2024-10-11 17:26:31,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd1afee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:31, skipping insertion in model container [2024-10-11 17:26:31,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:26:31" (1/1) ... [2024-10-11 17:26:31,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:26:31,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:26:32,011 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:26:32,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:26:32,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:26:32,144 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:26:32,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:26:32,294 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:26:32,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32 WrapperNode [2024-10-11 17:26:32,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:26:32,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:26:32,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:26:32,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:26:32,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,439 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1471 [2024-10-11 17:26:32,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:26:32,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:26:32,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:26:32,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:26:32,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,594 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [401, 2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 98 writes are split as follows [98, 0]. [2024-10-11 17:26:32,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:26:32,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:26:32,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:26:32,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:26:32,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (1/1) ... [2024-10-11 17:26:32,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:26:32,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:26:32,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:26:32,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:26:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:26:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:26:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:26:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:26:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:26:32,820 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:26:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:26:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:26:32,820 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:26:32,820 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:26:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:26:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:26:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:26:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:26:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:26:32,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:26:33,079 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:26:33,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:26:48,722 INFO L? ?]: Removed 210 outVars from TransFormulas that were not future-live. [2024-10-11 17:26:48,722 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:26:48,766 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:26:48,769 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-11 17:26:48,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:26:48 BoogieIcfgContainer [2024-10-11 17:26:48,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:26:48,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:26:48,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:26:48,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:26:48,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:26:31" (1/3) ... [2024-10-11 17:26:48,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134a087e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:26:48, skipping insertion in model container [2024-10-11 17:26:48,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:26:32" (2/3) ... [2024-10-11 17:26:48,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134a087e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:26:48, skipping insertion in model container [2024-10-11 17:26:48,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:26:48" (3/3) ... [2024-10-11 17:26:48,778 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2024-10-11 17:26:48,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:26:48,796 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:26:48,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:26:48,871 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;@6e3af8f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:26:48,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:26:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 245 states have (on average 1.6775510204081632) internal successors, (411), 257 states have internal predecessors, (411), 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-10-11 17:26:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:26:48,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:48,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:26:48,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:48,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1132433880, now seen corresponding path program 1 times [2024-10-11 17:26:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:48,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620512257] [2024-10-11 17:26:48,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:48,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:48,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:48,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:26:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:49,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:26:49,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:26:49,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:49,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620512257] [2024-10-11 17:26:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620512257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:49,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:26:49,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226218199] [2024-10-11 17:26:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:49,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:26:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:26:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:26:49,187 INFO L87 Difference]: Start difference. First operand has 266 states, 245 states have (on average 1.6775510204081632) internal successors, (411), 257 states have internal predecessors, (411), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:49,243 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2024-10-11 17:26:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:26:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-10-11 17:26:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:49,262 INFO L225 Difference]: With dead ends: 265 [2024-10-11 17:26:49,263 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 17:26:49,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-10-11 17:26:49,269 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:49,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:26:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 17:26:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-11 17:26:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 244 states have (on average 1.3237704918032787) internal successors, (323), 255 states have internal predecessors, (323), 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-10-11 17:26:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 355 transitions. [2024-10-11 17:26:49,397 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 355 transitions. Word has length 10 [2024-10-11 17:26:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:49,401 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 355 transitions. [2024-10-11 17:26:49,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2024-10-11 17:26:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:26:49,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:49,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:26:49,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 17:26:49,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:49,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:49,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1587648931, now seen corresponding path program 1 times [2024-10-11 17:26:49,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312887902] [2024-10-11 17:26:49,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:49,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:49,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:49,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:26:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:49,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 17:26:49,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:26:49,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:49,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:49,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312887902] [2024-10-11 17:26:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312887902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:49,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:26:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440378182] [2024-10-11 17:26:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:49,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:26:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:26:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:26:49,793 INFO L87 Difference]: Start difference. First operand 264 states and 355 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:50,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:50,034 INFO L93 Difference]: Finished difference Result 438 states and 581 transitions. [2024-10-11 17:26:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:26:50,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-10-11 17:26:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:50,038 INFO L225 Difference]: With dead ends: 438 [2024-10-11 17:26:50,040 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 17:26:50,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-11 17:26:50,043 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 213 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:50,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 695 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:26:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 17:26:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 265. [2024-10-11 17:26:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 245 states have (on average 1.3224489795918368) internal successors, (324), 256 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-10-11 17:26:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2024-10-11 17:26:50,072 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 10 [2024-10-11 17:26:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:50,073 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2024-10-11 17:26:50,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2024-10-11 17:26:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 17:26:50,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:50,078 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] [2024-10-11 17:26:50,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 17:26:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:50,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:50,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1053962185, now seen corresponding path program 1 times [2024-10-11 17:26:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119176276] [2024-10-11 17:26:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:50,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:50,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:50,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:50,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:26:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:50,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:26:50,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:26:51,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:51,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119176276] [2024-10-11 17:26:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119176276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:26:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259440117] [2024-10-11 17:26:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:51,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:26:51,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:26:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:26:51,028 INFO L87 Difference]: Start difference. First operand 265 states and 356 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:51,245 INFO L93 Difference]: Finished difference Result 268 states and 351 transitions. [2024-10-11 17:26:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:26:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 116 [2024-10-11 17:26:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:51,248 INFO L225 Difference]: With dead ends: 268 [2024-10-11 17:26:51,249 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 17:26:51,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:26:51,250 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 30 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:51,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 946 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:26:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 17:26:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-10-11 17:26:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 248 states have (on average 1.2862903225806452) internal successors, (319), 259 states have internal predecessors, (319), 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-10-11 17:26:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 351 transitions. [2024-10-11 17:26:51,270 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 351 transitions. Word has length 116 [2024-10-11 17:26:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:51,270 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 351 transitions. [2024-10-11 17:26:51,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 351 transitions. [2024-10-11 17:26:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 17:26:51,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:51,273 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] [2024-10-11 17:26:51,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 17:26:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:51,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:51,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1127278013, now seen corresponding path program 1 times [2024-10-11 17:26:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033772543] [2024-10-11 17:26:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:51,480 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:51,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:26:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:52,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:26:52,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:26:52,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:52,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:52,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033772543] [2024-10-11 17:26:52,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033772543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:52,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:26:52,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398074752] [2024-10-11 17:26:52,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:52,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:26:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:52,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:26:52,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:26:52,233 INFO L87 Difference]: Start difference. First operand 268 states and 351 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:52,387 INFO L93 Difference]: Finished difference Result 262 states and 341 transitions. [2024-10-11 17:26:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:26:52,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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 116 [2024-10-11 17:26:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:52,389 INFO L225 Difference]: With dead ends: 262 [2024-10-11 17:26:52,390 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 17:26:52,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:26:52,391 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 0 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:52,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 943 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:26:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 17:26:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-11 17:26:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 242 states have (on average 1.2768595041322315) internal successors, (309), 253 states have internal predecessors, (309), 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-10-11 17:26:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 341 transitions. [2024-10-11 17:26:52,406 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 341 transitions. Word has length 116 [2024-10-11 17:26:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 341 transitions. [2024-10-11 17:26:52,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 341 transitions. [2024-10-11 17:26:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 17:26:52,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:52,413 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] [2024-10-11 17:26:52,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 17:26:52,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:52,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:52,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash -541001791, now seen corresponding path program 1 times [2024-10-11 17:26:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:52,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316675175] [2024-10-11 17:26:52,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:52,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:52,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:52,620 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:26:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:53,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:26:53,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:26:53,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:53,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:53,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316675175] [2024-10-11 17:26:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316675175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:53,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:53,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:26:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571065934] [2024-10-11 17:26:53,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:53,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:26:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:26:53,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:26:53,542 INFO L87 Difference]: Start difference. First operand 262 states and 341 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:54,373 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2024-10-11 17:26:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:26:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 116 [2024-10-11 17:26:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:54,382 INFO L225 Difference]: With dead ends: 351 [2024-10-11 17:26:54,382 INFO L226 Difference]: Without dead ends: 351 [2024-10-11 17:26:54,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-10-11 17:26:54,383 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 68 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:54,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 675 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 17:26:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-11 17:26:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 298. [2024-10-11 17:26:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 278 states have (on average 1.2410071942446044) internal successors, (345), 289 states have internal predecessors, (345), 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-10-11 17:26:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 377 transitions. [2024-10-11 17:26:54,393 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 377 transitions. Word has length 116 [2024-10-11 17:26:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:54,393 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 377 transitions. [2024-10-11 17:26:54,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:26:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 377 transitions. [2024-10-11 17:26:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 17:26:54,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:54,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:26:54,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-10-11 17:26:54,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:54,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:54,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash 544270938, now seen corresponding path program 1 times [2024-10-11 17:26:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:54,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755340605] [2024-10-11 17:26:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:54,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:54,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:54,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:54,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:26:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:55,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:26:55,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:26:55,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:55,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755340605] [2024-10-11 17:26:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755340605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:26:55,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078408440] [2024-10-11 17:26:55,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:26:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:55,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:26:55,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:26:55,353 INFO L87 Difference]: Start difference. First operand 298 states and 377 transitions. Second operand has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 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-10-11 17:26:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:55,464 INFO L93 Difference]: Finished difference Result 300 states and 381 transitions. [2024-10-11 17:26:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:26:55,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 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 129 [2024-10-11 17:26:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:55,467 INFO L225 Difference]: With dead ends: 300 [2024-10-11 17:26:55,467 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 17:26:55,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:26:55,468 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:55,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 992 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:26:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 17:26:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-10-11 17:26:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 279 states have (on average 1.2437275985663083) internal successors, (347), 291 states have internal predecessors, (347), 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-10-11 17:26:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 381 transitions. [2024-10-11 17:26:55,481 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 381 transitions. Word has length 129 [2024-10-11 17:26:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:55,481 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 381 transitions. [2024-10-11 17:26:55,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 4 states have internal predecessors, (124), 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-10-11 17:26:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 381 transitions. [2024-10-11 17:26:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 17:26:55,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:55,484 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] [2024-10-11 17:26:55,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:26:55,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:55,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:55,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1777769706, now seen corresponding path program 1 times [2024-10-11 17:26:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745635417] [2024-10-11 17:26:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:26:55,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:55,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:55,687 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:55,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:26:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:26:56,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:26:56,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:26:56,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:26:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:26:56,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745635417] [2024-10-11 17:26:56,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745635417] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:26:56,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:26:56,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:26:56,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712714728] [2024-10-11 17:26:56,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:26:56,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:26:56,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:26:56,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:26:56,543 INFO L87 Difference]: Start difference. First operand 300 states and 381 transitions. Second operand has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:26:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:26:56,933 INFO L93 Difference]: Finished difference Result 309 states and 396 transitions. [2024-10-11 17:26:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:26:56,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 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 131 [2024-10-11 17:26:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:26:56,936 INFO L225 Difference]: With dead ends: 309 [2024-10-11 17:26:56,936 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 17:26:56,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:26:56,937 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 5 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:26:56,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1967 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:26:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 17:26:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2024-10-11 17:26:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 286 states have (on average 1.2587412587412588) internal successors, (360), 298 states have internal predecessors, (360), 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-10-11 17:26:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 394 transitions. [2024-10-11 17:26:56,947 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 394 transitions. Word has length 131 [2024-10-11 17:26:56,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:26:56,949 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 394 transitions. [2024-10-11 17:26:56,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:26:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 394 transitions. [2024-10-11 17:26:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 17:26:56,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:26:56,952 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-11 17:26:56,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 17:26:57,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:57,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:26:57,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:26:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 461319194, now seen corresponding path program 2 times [2024-10-11 17:26:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:26:57,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348258014] [2024-10-11 17:26:57,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:26:57,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:26:57,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:26:57,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:26:57,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 17:26:57,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:26:57,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:26:57,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:26:57,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:26:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 17:26:58,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:26:58,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:26:58,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348258014] [2024-10-11 17:26:58,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348258014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:26:58,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:26:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:26:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222468197] [2024-10-11 17:26:58,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:26:58,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:26:58,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:26:58,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:26:58,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:26:58,501 INFO L87 Difference]: Start difference. First operand 308 states and 394 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:27:02,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:27:07,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:27:09,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:27:12,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:27:16,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:27:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:16,816 INFO L93 Difference]: Finished difference Result 391 states and 503 transitions. [2024-10-11 17:27:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:27:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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 135 [2024-10-11 17:27:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:16,827 INFO L225 Difference]: With dead ends: 391 [2024-10-11 17:27:16,827 INFO L226 Difference]: Without dead ends: 391 [2024-10-11 17:27:16,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:27:16,827 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 46 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:16,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 937 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 18.3s Time] [2024-10-11 17:27:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-11 17:27:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-10-11 17:27:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 366 states have (on average 1.2622950819672132) internal successors, (462), 378 states have internal predecessors, (462), 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-10-11 17:27:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 503 transitions. [2024-10-11 17:27:16,840 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 503 transitions. Word has length 135 [2024-10-11 17:27:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:16,841 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 503 transitions. [2024-10-11 17:27:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:27:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 503 transitions. [2024-10-11 17:27:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 17:27:16,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:16,843 INFO L215 NwaCegarLoop]: trace histogram [12, 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] [2024-10-11 17:27:16,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 17:27:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:17,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:17,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 256275850, now seen corresponding path program 1 times [2024-10-11 17:27:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86897694] [2024-10-11 17:27:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:17,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:17,047 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:17,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 17:27:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:17,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:27:17,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-11 17:27:17,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 17:27:18,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86897694] [2024-10-11 17:27:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86897694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:18,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:27:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169307009] [2024-10-11 17:27:18,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:18,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:27:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:27:18,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:27:18,134 INFO L87 Difference]: Start difference. First operand 391 states and 503 transitions. Second operand has 14 states, 12 states have (on average 11.916666666666666) internal successors, (143), 14 states have internal predecessors, (143), 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-10-11 17:27:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:18,886 INFO L93 Difference]: Finished difference Result 403 states and 524 transitions. [2024-10-11 17:27:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:27:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.916666666666666) internal successors, (143), 14 states have internal predecessors, (143), 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 154 [2024-10-11 17:27:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:18,889 INFO L225 Difference]: With dead ends: 403 [2024-10-11 17:27:18,889 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 17:27:18,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:27:18,890 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 7 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:18,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1974 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:27:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 17:27:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 400. [2024-10-11 17:27:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 375 states have (on average 1.264) internal successors, (474), 387 states have internal predecessors, (474), 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-10-11 17:27:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 515 transitions. [2024-10-11 17:27:18,907 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 515 transitions. Word has length 154 [2024-10-11 17:27:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:18,908 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 515 transitions. [2024-10-11 17:27:18,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 11.916666666666666) internal successors, (143), 14 states have internal predecessors, (143), 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-10-11 17:27:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 515 transitions. [2024-10-11 17:27:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 17:27:18,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:18,910 INFO L215 NwaCegarLoop]: trace histogram [30, 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] [2024-10-11 17:27:18,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 17:27:19,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:19,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash -549108626, now seen corresponding path program 2 times [2024-10-11 17:27:19,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:19,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384665866] [2024-10-11 17:27:19,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:27:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:19,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:19,114 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:19,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 17:27:19,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:27:19,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:19,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:27:19,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 260 proven. 55 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-10-11 17:27:20,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 1 proven. 311 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-10-11 17:27:20,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384665866] [2024-10-11 17:27:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384665866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:20,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:20,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:27:20,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630773125] [2024-10-11 17:27:20,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:20,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:27:20,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:27:20,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:27:20,790 INFO L87 Difference]: Start difference. First operand 400 states and 515 transitions. Second operand has 26 states, 24 states have (on average 6.458333333333333) internal successors, (155), 26 states have internal predecessors, (155), 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-10-11 17:27:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:23,462 INFO L93 Difference]: Finished difference Result 421 states and 554 transitions. [2024-10-11 17:27:23,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:27:23,466 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.458333333333333) internal successors, (155), 26 states have internal predecessors, (155), 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 172 [2024-10-11 17:27:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:23,468 INFO L225 Difference]: With dead ends: 421 [2024-10-11 17:27:23,468 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 17:27:23,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:27:23,470 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 13 mSDsluCounter, 4911 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5243 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:23,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5243 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 17:27:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 17:27:23,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2024-10-11 17:27:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 393 states have (on average 1.2671755725190839) internal successors, (498), 405 states have internal predecessors, (498), 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-10-11 17:27:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 539 transitions. [2024-10-11 17:27:23,485 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 539 transitions. Word has length 172 [2024-10-11 17:27:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:23,485 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 539 transitions. [2024-10-11 17:27:23,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.458333333333333) internal successors, (155), 26 states have internal predecessors, (155), 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-10-11 17:27:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 539 transitions. [2024-10-11 17:27:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 17:27:23,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:23,488 INFO L215 NwaCegarLoop]: trace histogram [66, 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] [2024-10-11 17:27:23,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:23,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:23,689 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:23,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash -595822738, now seen corresponding path program 3 times [2024-10-11 17:27:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347085228] [2024-10-11 17:27:23,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:27:23,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:23,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:23,694 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:23,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 17:27:24,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:27:24,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:24,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:27:24,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2024-10-11 17:27:24,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2427 trivial. 0 not checked. [2024-10-11 17:27:25,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347085228] [2024-10-11 17:27:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347085228] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:25,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 17:27:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357416725] [2024-10-11 17:27:25,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:27:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:27:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:27:25,230 INFO L87 Difference]: Start difference. First operand 418 states and 539 transitions. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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-10-11 17:27:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:25,653 INFO L93 Difference]: Finished difference Result 808 states and 1027 transitions. [2024-10-11 17:27:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:27:25,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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 208 [2024-10-11 17:27:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:25,658 INFO L225 Difference]: With dead ends: 808 [2024-10-11 17:27:25,658 INFO L226 Difference]: Without dead ends: 808 [2024-10-11 17:27:25,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 410 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-10-11 17:27:25,659 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 697 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:25,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1892 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:27:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-10-11 17:27:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2024-10-11 17:27:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 768 states have (on average 1.23828125) internal successors, (951), 780 states have internal predecessors, (951), 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-10-11 17:27:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1027 transitions. [2024-10-11 17:27:25,682 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1027 transitions. Word has length 208 [2024-10-11 17:27:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:25,682 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1027 transitions. [2024-10-11 17:27:25,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 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-10-11 17:27:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1027 transitions. [2024-10-11 17:27:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-10-11 17:27:25,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:25,691 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, 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] [2024-10-11 17:27:25,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 17:27:25,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:25,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1197277990, now seen corresponding path program 1 times [2024-10-11 17:27:25,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:25,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872720927] [2024-10-11 17:27:25,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:27:25,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:25,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:25,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:25,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 17:27:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:27:28,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:27:28,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3055 backedges. 1199 proven. 253 refuted. 0 times theorem prover too weak. 1603 trivial. 0 not checked. [2024-10-11 17:27:28,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3055 backedges. 112 proven. 1337 refuted. 0 times theorem prover too weak. 1606 trivial. 0 not checked. [2024-10-11 17:27:30,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:30,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872720927] [2024-10-11 17:27:30,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872720927] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:30,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:30,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:27:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033265610] [2024-10-11 17:27:30,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:27:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:27:30,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:27:30,777 INFO L87 Difference]: Start difference. First operand 808 states and 1027 transitions. Second operand has 50 states, 48 states have (on average 4.604166666666667) internal successors, (221), 50 states have internal predecessors, (221), 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-10-11 17:27:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:27:40,787 INFO L93 Difference]: Finished difference Result 845 states and 1103 transitions. [2024-10-11 17:27:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 17:27:40,789 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 4.604166666666667) internal successors, (221), 50 states have internal predecessors, (221), 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 526 [2024-10-11 17:27:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:27:40,795 INFO L225 Difference]: With dead ends: 845 [2024-10-11 17:27:40,795 INFO L226 Difference]: Without dead ends: 843 [2024-10-11 17:27:40,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 17:27:40,798 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 26 mSDsluCounter, 7873 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8205 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:27:40,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8205 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 17:27:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-10-11 17:27:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 842. [2024-10-11 17:27:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 802 states have (on average 1.243142144638404) internal successors, (997), 814 states have internal predecessors, (997), 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-10-11 17:27:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1073 transitions. [2024-10-11 17:27:40,823 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1073 transitions. Word has length 526 [2024-10-11 17:27:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:27:40,824 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1073 transitions. [2024-10-11 17:27:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 4.604166666666667) internal successors, (221), 50 states have internal predecessors, (221), 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-10-11 17:27:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1073 transitions. [2024-10-11 17:27:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-10-11 17:27:40,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:27:40,836 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, 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] [2024-10-11 17:27:40,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 17:27:41,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:41,037 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:27:41,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:27:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash 143396826, now seen corresponding path program 2 times [2024-10-11 17:27:41,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:27:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184951389] [2024-10-11 17:27:41,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:27:41,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:27:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:27:41,041 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:27:41,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 17:27:44,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:27:44,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:27:44,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 3735 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:27:44,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:27:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10093 backedges. 5962 proven. 276 refuted. 0 times theorem prover too weak. 3855 trivial. 0 not checked. [2024-10-11 17:27:45,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:27:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10093 backedges. 1193 proven. 1934 refuted. 0 times theorem prover too weak. 6966 trivial. 0 not checked. [2024-10-11 17:27:48,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:27:48,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184951389] [2024-10-11 17:27:48,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184951389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:27:48,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:27:48,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 17:27:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203833543] [2024-10-11 17:27:48,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:27:48,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 17:27:48,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:27:48,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 17:27:48,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:27:48,205 INFO L87 Difference]: Start difference. First operand 842 states and 1073 transitions. Second operand has 52 states, 50 states have (on average 4.46) internal successors, (223), 52 states have internal predecessors, (223), 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)