./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:10:11,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:10:11,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:10:11,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:10:11,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:10:11,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:10:11,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:10:11,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:10:11,604 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:10:11,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:10:11,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:10:11,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:10:11,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:10:11,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:10:11,609 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:10:11,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:10:11,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:10:11,610 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:10:11,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:10:11,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:10:11,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:10:11,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:10:11,612 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:10:11,612 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:10:11,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:10:11,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:10:11,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:10:11,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:10:11,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:10:11,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:10:11,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:10:11,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:10:11,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:10:11,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:10:11,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:10:11,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:10:11,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:10:11,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:10:11,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:10:11,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:10:11,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:10:11,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:10:11,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:10:11,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:10:11,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:10:11,617 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-17 00:10:11,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:10:11,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:10:11,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:10:11,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:10:11,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:10:11,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-17 00:10:13,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:10:13,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:10:13,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-17 00:10:13,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7820a3e/71b6ff6c3e774534a07d3da04ea47c8c/FLAG4ace564a9 [2024-11-17 00:10:13,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7820a3e/71b6ff6c3e774534a07d3da04ea47c8c [2024-11-17 00:10:13,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:10:13,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:10:13,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:10:13,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:10:13,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:10:13,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:13" (1/1) ... [2024-11-17 00:10:13,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1613ffea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:13, skipping insertion in model container [2024-11-17 00:10:13,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:13" (1/1) ... [2024-11-17 00:10:13,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:10:14,299 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,319 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,321 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,324 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,332 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,376 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,379 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,381 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,382 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,387 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,388 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,390 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,392 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,395 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,400 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,402 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,407 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,408 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,408 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,413 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:14,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:10:14,437 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 00:10:14,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@49a630fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:14, skipping insertion in model container [2024-11-17 00:10:14,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:10:14,439 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:10:14,440 INFO L158 Benchmark]: Toolchain (without parser) took 648.88ms. Allocated memory is still 218.1MB. Free memory was 186.1MB in the beginning and 161.7MB in the end (delta: 24.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-17 00:10:14,441 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 138.4MB. Free memory was 102.3MB in the beginning and 102.1MB in the end (delta: 142.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:10:14,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.73ms. Allocated memory is still 218.1MB. Free memory was 185.9MB in the beginning and 161.7MB in the end (delta: 24.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-17 00:10:14,443 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.26ms. Allocated memory is still 138.4MB. Free memory was 102.3MB in the beginning and 102.1MB in the end (delta: 142.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.73ms. Allocated memory is still 218.1MB. Free memory was 185.9MB in the beginning and 161.7MB in the end (delta: 24.2MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:10:16,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:10:16,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:10:16,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:10:16,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:10:16,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:10:16,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:10:16,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:10:16,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:10:16,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:10:16,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:10:16,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:10:16,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:10:16,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:10:16,600 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:10:16,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:10:16,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:10:16,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:10:16,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:10:16,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:10:16,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:10:16,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:10:16,604 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:10:16,604 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:10:16,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:10:16,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:10:16,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:10:16,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:10:16,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:10:16,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:10:16,605 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:10:16,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:10:16,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:10:16,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:10:16,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:10:16,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:10:16,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:10:16,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:10:16,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:10:16,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:10:16,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:10:16,607 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:10:16,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:10:16,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:10:16,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:10:16,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:10:16,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:10:16,609 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-17 00:10:16,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:10:16,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:10:16,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:10:16,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:10:16,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:10:16,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-17 00:10:18,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:10:18,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:10:18,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-17 00:10:18,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab194f66/5f501f21e34b4bc59122b1e20ed89fa5/FLAG588b3e52d [2024-11-17 00:10:18,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ab194f66/5f501f21e34b4bc59122b1e20ed89fa5 [2024-11-17 00:10:18,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:10:18,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:10:18,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:10:18,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:10:18,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:10:19,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:18" (1/1) ... [2024-11-17 00:10:19,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b56789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:19, skipping insertion in model container [2024-11-17 00:10:19,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:10:18" (1/1) ... [2024-11-17 00:10:19,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:10:19,634 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,691 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,697 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,701 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,708 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,752 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,756 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,759 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,760 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,763 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,769 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,774 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,775 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,782 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,783 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,788 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,789 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,796 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,797 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,800 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:10:19,821 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:10:19,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:10:19,867 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,882 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,884 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,886 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,892 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,912 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,915 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,917 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,919 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,921 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,922 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,922 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,923 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,925 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,926 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,927 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,929 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,930 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,930 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,934 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:10:19,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:10:19,945 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:10:20,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:10:20,109 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:10:20,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20 WrapperNode [2024-11-17 00:10:20,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:10:20,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:10:20,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:10:20,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:10:20,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,205 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1193 [2024-11-17 00:10:20,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:10:20,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:10:20,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:10:20,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:10:20,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,304 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-17 00:10:20,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:10:20,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:10:20,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:10:20,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:10:20,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (1/1) ... [2024-11-17 00:10:20,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:10:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:10:20,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:10:20,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:10:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:10:20,441 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:10:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:10:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:10:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-17 00:10:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-17 00:10:20,444 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-17 00:10:20,445 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-17 00:10:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:10:20,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:10:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:10:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:10:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-17 00:10:20,445 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-17 00:10:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:10:20,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:10:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:10:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-17 00:10:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-17 00:10:20,446 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-17 00:10:20,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:10:20,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:10:20,656 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:10:20,661 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:10:20,721 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2024-11-17 00:10:26,576 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2024-11-17 00:10:26,577 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2024-11-17 00:10:26,577 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:10:26,647 INFO L? ?]: Removed 169 outVars from TransFormulas that were not future-live. [2024-11-17 00:10:26,647 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:10:26,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:10:26,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:10:26,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:10:26 BoogieIcfgContainer [2024-11-17 00:10:26,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:10:26,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:10:26,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:10:26,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:10:26,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:10:18" (1/3) ... [2024-11-17 00:10:26,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bf2f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:10:26, skipping insertion in model container [2024-11-17 00:10:26,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:10:20" (2/3) ... [2024-11-17 00:10:26,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bf2f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:10:26, skipping insertion in model container [2024-11-17 00:10:26,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:10:26" (3/3) ... [2024-11-17 00:10:26,670 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-11-17 00:10:26,683 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:10:26,683 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:10:26,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:10:26,737 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;@b2a3135, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:10:26,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:10:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 277 states, 249 states have (on average 1.5943775100401607) internal successors, (397), 255 states have internal predecessors, (397), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-17 00:10:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:10:26,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:26,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:26,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:26,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1598944414, now seen corresponding path program 1 times [2024-11-17 00:10:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:26,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621736577] [2024-11-17 00:10:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:26,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:26,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:26,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:26,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:10:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:26,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:10:26,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:26,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:26,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621736577] [2024-11-17 00:10:26,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621736577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:26,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:26,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:10:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022368858] [2024-11-17 00:10:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:26,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:10:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:27,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:10:27,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:10:27,020 INFO L87 Difference]: Start difference. First operand has 277 states, 249 states have (on average 1.5943775100401607) internal successors, (397), 255 states have internal predecessors, (397), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:27,057 INFO L93 Difference]: Finished difference Result 272 states and 350 transitions. [2024-11-17 00:10:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:10:27,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:10:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:27,092 INFO L225 Difference]: With dead ends: 272 [2024-11-17 00:10:27,092 INFO L226 Difference]: Without dead ends: 269 [2024-11-17 00:10:27,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:10:27,104 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:27,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:10:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-17 00:10:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-17 00:10:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 244 states have (on average 1.2827868852459017) internal successors, (313), 249 states have internal predecessors, (313), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 00:10:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 347 transitions. [2024-11-17 00:10:27,214 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 347 transitions. Word has length 11 [2024-11-17 00:10:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:27,214 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 347 transitions. [2024-11-17 00:10:27,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 347 transitions. [2024-11-17 00:10:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:10:27,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:27,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:27,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 00:10:27,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:27,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:27,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -394307484, now seen corresponding path program 1 times [2024-11-17 00:10:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:27,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844493569] [2024-11-17 00:10:27,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:27,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:27,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:27,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:27,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:10:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:27,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:10:27,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:27,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:27,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844493569] [2024-11-17 00:10:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844493569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:27,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:10:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769915495] [2024-11-17 00:10:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:27,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:10:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:10:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:10:27,826 INFO L87 Difference]: Start difference. First operand 269 states and 347 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:30,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:10:33,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:10:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:33,150 INFO L93 Difference]: Finished difference Result 430 states and 557 transitions. [2024-11-17 00:10:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:10:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:10:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:33,154 INFO L225 Difference]: With dead ends: 430 [2024-11-17 00:10:33,154 INFO L226 Difference]: Without dead ends: 430 [2024-11-17 00:10:33,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:10:33,156 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 192 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:33,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 993 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-17 00:10:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-17 00:10:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 392. [2024-11-17 00:10:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 364 states have (on average 1.2857142857142858) internal successors, (468), 369 states have internal predecessors, (468), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 00:10:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 508 transitions. [2024-11-17 00:10:33,187 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 508 transitions. Word has length 13 [2024-11-17 00:10:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:33,187 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 508 transitions. [2024-11-17 00:10:33,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 508 transitions. [2024-11-17 00:10:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:10:33,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:33,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:33,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:10:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:33,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:33,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash -612130187, now seen corresponding path program 1 times [2024-11-17 00:10:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097015446] [2024-11-17 00:10:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:33,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:33,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:33,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:33,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:10:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:33,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:10:33,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:33,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:10:33,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:10:33,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:10:33,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:10:33,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:10:33,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:10:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:33,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:33,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097015446] [2024-11-17 00:10:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097015446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:33,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:33,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:10:33,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132106738] [2024-11-17 00:10:33,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:33,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:10:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:33,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:10:33,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:10:33,701 INFO L87 Difference]: Start difference. First operand 392 states and 508 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:34,144 INFO L93 Difference]: Finished difference Result 612 states and 801 transitions. [2024-11-17 00:10:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:10:34,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 00:10:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:34,146 INFO L225 Difference]: With dead ends: 612 [2024-11-17 00:10:34,147 INFO L226 Difference]: Without dead ends: 612 [2024-11-17 00:10:34,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:10:34,147 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 280 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:34,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1080 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:10:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-17 00:10:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 391. [2024-11-17 00:10:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 363 states have (on average 1.2837465564738293) internal successors, (466), 368 states have internal predecessors, (466), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 00:10:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 506 transitions. [2024-11-17 00:10:34,166 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 506 transitions. Word has length 16 [2024-11-17 00:10:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:34,166 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 506 transitions. [2024-11-17 00:10:34,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 506 transitions. [2024-11-17 00:10:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:10:34,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:34,171 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] [2024-11-17 00:10:34,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 00:10:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:34,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:34,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash -632000200, now seen corresponding path program 1 times [2024-11-17 00:10:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:34,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105090766] [2024-11-17 00:10:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:34,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:34,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:34,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:10:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:34,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:10:34,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:34,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:34,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105090766] [2024-11-17 00:10:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105090766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:34,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:34,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:10:34,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94399106] [2024-11-17 00:10:34,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:34,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:10:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:10:34,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:10:34,682 INFO L87 Difference]: Start difference. First operand 391 states and 506 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:34,770 INFO L93 Difference]: Finished difference Result 397 states and 496 transitions. [2024-11-17 00:10:34,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:10:34,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 00:10:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:34,772 INFO L225 Difference]: With dead ends: 397 [2024-11-17 00:10:34,772 INFO L226 Difference]: Without dead ends: 397 [2024-11-17 00:10:34,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:10:34,773 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 30 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:34,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 931 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:10:34,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-17 00:10:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-17 00:10:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 369 states have (on average 1.2357723577235773) internal successors, (456), 374 states have internal predecessors, (456), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 00:10:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 496 transitions. [2024-11-17 00:10:34,783 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 496 transitions. Word has length 52 [2024-11-17 00:10:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:34,783 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 496 transitions. [2024-11-17 00:10:34,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 496 transitions. [2024-11-17 00:10:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:10:34,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:34,785 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] [2024-11-17 00:10:34,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 00:10:34,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:34,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:34,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:34,986 INFO L85 PathProgramCache]: Analyzing trace with hash 322401599, now seen corresponding path program 1 times [2024-11-17 00:10:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:34,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659267583] [2024-11-17 00:10:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:34,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:34,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:34,990 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:34,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:10:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:35,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:10:35,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:35,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:35,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:35,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659267583] [2024-11-17 00:10:35,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659267583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:35,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:35,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:10:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371122971] [2024-11-17 00:10:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:35,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:10:35,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:10:35,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:10:35,273 INFO L87 Difference]: Start difference. First operand 397 states and 496 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:35,351 INFO L93 Difference]: Finished difference Result 407 states and 506 transitions. [2024-11-17 00:10:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:10:35,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 00:10:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:35,353 INFO L225 Difference]: With dead ends: 407 [2024-11-17 00:10:35,353 INFO L226 Difference]: Without dead ends: 407 [2024-11-17 00:10:35,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:10:35,354 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 9 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:35,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1646 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:10:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-17 00:10:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2024-11-17 00:10:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 376 states have (on average 1.2340425531914894) internal successors, (464), 382 states have internal predecessors, (464), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-17 00:10:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 506 transitions. [2024-11-17 00:10:35,383 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 506 transitions. Word has length 52 [2024-11-17 00:10:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:35,383 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 506 transitions. [2024-11-17 00:10:35,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:10:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 506 transitions. [2024-11-17 00:10:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 00:10:35,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:35,385 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:35,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:10:35,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:35,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:35,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash 329262938, now seen corresponding path program 1 times [2024-11-17 00:10:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541563735] [2024-11-17 00:10:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:35,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:35,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:35,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:35,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:10:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:35,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:10:35,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:36,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:36,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:36,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541563735] [2024-11-17 00:10:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541563735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:36,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:36,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:10:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025925583] [2024-11-17 00:10:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:36,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:10:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:36,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:10:36,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:10:36,061 INFO L87 Difference]: Start difference. First operand 407 states and 506 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:10:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:36,229 INFO L93 Difference]: Finished difference Result 416 states and 517 transitions. [2024-11-17 00:10:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:10:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2024-11-17 00:10:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:36,232 INFO L225 Difference]: With dead ends: 416 [2024-11-17 00:10:36,232 INFO L226 Difference]: Without dead ends: 416 [2024-11-17 00:10:36,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:10:36,233 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 20 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:36,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1206 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:10:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-17 00:10:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2024-11-17 00:10:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 379 states have (on average 1.2321899736147757) internal successors, (467), 386 states have internal predecessors, (467), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-17 00:10:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 512 transitions. [2024-11-17 00:10:36,241 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 512 transitions. Word has length 67 [2024-11-17 00:10:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:36,241 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 512 transitions. [2024-11-17 00:10:36,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:10:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 512 transitions. [2024-11-17 00:10:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 00:10:36,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:36,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:36,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:10:36,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:36,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:36,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 706056536, now seen corresponding path program 1 times [2024-11-17 00:10:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:36,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278878425] [2024-11-17 00:10:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:36,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:36,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:36,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:10:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:36,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:10:36,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:36,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:36,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278878425] [2024-11-17 00:10:36,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278878425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:36,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:10:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13210485] [2024-11-17 00:10:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:36,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:10:36,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:36,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:10:36,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:10:36,873 INFO L87 Difference]: Start difference. First operand 412 states and 512 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:10:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:36,916 INFO L93 Difference]: Finished difference Result 416 states and 517 transitions. [2024-11-17 00:10:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:10:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2024-11-17 00:10:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:36,919 INFO L225 Difference]: With dead ends: 416 [2024-11-17 00:10:36,919 INFO L226 Difference]: Without dead ends: 416 [2024-11-17 00:10:36,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:10:36,920 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:36,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 991 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:10:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-17 00:10:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-17 00:10:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 382 states have (on average 1.2329842931937174) internal successors, (471), 390 states have internal predecessors, (471), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-17 00:10:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 517 transitions. [2024-11-17 00:10:36,929 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 517 transitions. Word has length 72 [2024-11-17 00:10:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:36,930 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 517 transitions. [2024-11-17 00:10:36,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:10:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 517 transitions. [2024-11-17 00:10:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 00:10:36,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:36,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:36,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:10:37,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:37,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:37,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1515247231, now seen corresponding path program 1 times [2024-11-17 00:10:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:37,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125584007] [2024-11-17 00:10:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:37,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:37,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:37,139 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:37,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:10:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:37,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:10:37,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:37,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:10:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:10:37,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125584007] [2024-11-17 00:10:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125584007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:10:37,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:10:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:10:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451454786] [2024-11-17 00:10:37,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:10:37,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:10:37,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:37,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:10:37,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:10:37,723 INFO L87 Difference]: Start difference. First operand 416 states and 517 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 00:10:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:37,963 INFO L93 Difference]: Finished difference Result 429 states and 535 transitions. [2024-11-17 00:10:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:10:37,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-17 00:10:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:37,966 INFO L225 Difference]: With dead ends: 429 [2024-11-17 00:10:37,966 INFO L226 Difference]: Without dead ends: 429 [2024-11-17 00:10:37,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:10:37,967 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 4 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:37,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2298 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:10:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-17 00:10:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2024-11-17 00:10:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 391 states have (on average 1.2429667519181586) internal successors, (486), 399 states have internal predecessors, (486), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-17 00:10:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 532 transitions. [2024-11-17 00:10:37,985 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 532 transitions. Word has length 73 [2024-11-17 00:10:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:37,986 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 532 transitions. [2024-11-17 00:10:37,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 00:10:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 532 transitions. [2024-11-17 00:10:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 00:10:37,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:37,990 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:38,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 00:10:38,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:38,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash 22094616, now seen corresponding path program 2 times [2024-11-17 00:10:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699502680] [2024-11-17 00:10:38,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:10:38,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:38,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:38,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:38,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:10:38,764 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:10:38,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:10:38,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:10:38,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:10:38,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:10:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:10:39,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699502680] [2024-11-17 00:10:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699502680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:10:39,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:10:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-17 00:10:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141698513] [2024-11-17 00:10:39,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:10:39,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:10:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:39,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:10:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:10:39,312 INFO L87 Difference]: Start difference. First operand 426 states and 532 transitions. Second operand has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 10 states have internal predecessors, (121), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:10:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:41,153 INFO L93 Difference]: Finished difference Result 3228 states and 4109 transitions. [2024-11-17 00:10:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 00:10:41,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 10 states have internal predecessors, (121), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 76 [2024-11-17 00:10:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:41,166 INFO L225 Difference]: With dead ends: 3228 [2024-11-17 00:10:41,166 INFO L226 Difference]: Without dead ends: 3228 [2024-11-17 00:10:41,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:10:41,167 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 4500 mSDsluCounter, 4895 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4526 SdHoareTripleChecker+Valid, 5818 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:41,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4526 Valid, 5818 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 00:10:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2024-11-17 00:10:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2207. [2024-11-17 00:10:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2207 states, 2069 states have (on average 1.2590623489608506) internal successors, (2605), 2090 states have internal predecessors, (2605), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-17 00:10:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 2805 transitions. [2024-11-17 00:10:41,209 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 2805 transitions. Word has length 76 [2024-11-17 00:10:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:41,209 INFO L471 AbstractCegarLoop]: Abstraction has 2207 states and 2805 transitions. [2024-11-17 00:10:41,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 10 states have internal predecessors, (121), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:10:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2805 transitions. [2024-11-17 00:10:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-17 00:10:41,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:41,210 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:41,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:10:41,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:41,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:41,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1453324412, now seen corresponding path program 1 times [2024-11-17 00:10:41,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:41,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992028334] [2024-11-17 00:10:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:41,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:41,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:41,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:41,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:10:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:41,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:10:41,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:10:42,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:10:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:10:42,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:42,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992028334] [2024-11-17 00:10:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992028334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:10:42,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:10:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:10:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831682644] [2024-11-17 00:10:42,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:10:42,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:10:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:10:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:10:42,369 INFO L87 Difference]: Start difference. First operand 2207 states and 2805 transitions. Second operand has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-17 00:10:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:42,933 INFO L93 Difference]: Finished difference Result 2297 states and 2930 transitions. [2024-11-17 00:10:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:10:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2024-11-17 00:10:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:42,942 INFO L225 Difference]: With dead ends: 2297 [2024-11-17 00:10:42,942 INFO L226 Difference]: Without dead ends: 2267 [2024-11-17 00:10:42,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:10:42,943 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 7 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:42,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2627 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:10:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2024-11-17 00:10:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2252. [2024-11-17 00:10:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2114 states have (on average 1.260643330179754) internal successors, (2665), 2135 states have internal predecessors, (2665), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-17 00:10:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 2865 transitions. [2024-11-17 00:10:42,975 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 2865 transitions. Word has length 113 [2024-11-17 00:10:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:42,976 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 2865 transitions. [2024-11-17 00:10:42,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-17 00:10:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2865 transitions. [2024-11-17 00:10:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-17 00:10:42,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:42,977 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:10:42,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:10:43,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:43,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:43,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1128309041, now seen corresponding path program 2 times [2024-11-17 00:10:43,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:43,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561086884] [2024-11-17 00:10:43,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:10:43,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:43,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:43,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:43,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:10:43,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:10:43,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:10:43,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:10:43,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:43,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:10:43,523 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:10:43,524 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:10:43,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:10:43,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:10:43,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:10:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-17 00:10:43,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:10:43,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561086884] [2024-11-17 00:10:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561086884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:10:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:10:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:10:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284815492] [2024-11-17 00:10:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:10:43,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:10:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:10:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:10:43,588 INFO L87 Difference]: Start difference. First operand 2252 states and 2865 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 00:10:44,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:44,097 INFO L93 Difference]: Finished difference Result 3036 states and 3899 transitions. [2024-11-17 00:10:44,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:10:44,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 122 [2024-11-17 00:10:44,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:44,106 INFO L225 Difference]: With dead ends: 3036 [2024-11-17 00:10:44,107 INFO L226 Difference]: Without dead ends: 3036 [2024-11-17 00:10:44,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:10:44,107 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 220 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:44,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 934 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:10:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2024-11-17 00:10:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2264. [2024-11-17 00:10:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2126 states have (on average 1.2591721542803387) internal successors, (2677), 2147 states have internal predecessors, (2677), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-17 00:10:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2877 transitions. [2024-11-17 00:10:44,167 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2877 transitions. Word has length 122 [2024-11-17 00:10:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:44,168 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 2877 transitions. [2024-11-17 00:10:44,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 00:10:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2877 transitions. [2024-11-17 00:10:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-17 00:10:44,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:44,169 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:10:44,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-17 00:10:44,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:44,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:44,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash -120384690, now seen corresponding path program 1 times [2024-11-17 00:10:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:44,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401965307] [2024-11-17 00:10:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:10:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:44,379 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:44,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:10:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:10:44,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:10:44,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 00:10:45,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:10:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-17 00:10:46,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:46,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401965307] [2024-11-17 00:10:46,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401965307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:10:46,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:10:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:10:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30964336] [2024-11-17 00:10:46,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:10:46,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:10:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:10:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:10:46,085 INFO L87 Difference]: Start difference. First operand 2264 states and 2877 transitions. Second operand has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:10:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:10:49,339 INFO L93 Difference]: Finished difference Result 2399 states and 3092 transitions. [2024-11-17 00:10:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:10:49,340 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-17 00:10:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:10:49,346 INFO L225 Difference]: With dead ends: 2399 [2024-11-17 00:10:49,347 INFO L226 Difference]: Without dead ends: 2369 [2024-11-17 00:10:49,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:10:49,348 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 14 mSDsluCounter, 3611 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3943 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:10:49,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3943 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:10:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2024-11-17 00:10:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2354. [2024-11-17 00:10:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2216 states have (on average 1.2621841155234657) internal successors, (2797), 2237 states have internal predecessors, (2797), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-17 00:10:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 2997 transitions. [2024-11-17 00:10:49,384 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 2997 transitions. Word has length 128 [2024-11-17 00:10:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:10:49,384 INFO L471 AbstractCegarLoop]: Abstraction has 2354 states and 2997 transitions. [2024-11-17 00:10:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:10:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 2997 transitions. [2024-11-17 00:10:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-17 00:10:49,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:10:49,385 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:10:49,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 00:10:49,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:49,587 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:10:49,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:10:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1961815890, now seen corresponding path program 2 times [2024-11-17 00:10:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:10:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235775480] [2024-11-17 00:10:49,588 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:10:49,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:10:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:10:49,591 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:10:49,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:10:50,755 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:10:50,755 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:10:50,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:10:50,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:10:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-17 00:10:51,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:10:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-17 00:10:54,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:10:54,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235775480] [2024-11-17 00:10:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235775480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:10:54,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:10:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:10:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587637202] [2024-11-17 00:10:54,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:10:54,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:10:54,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:10:54,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:10:54,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:10:54,217 INFO L87 Difference]: Start difference. First operand 2354 states and 2997 transitions. Second operand has 50 states, 50 states have (on average 2.88) internal successors, (144), 50 states have internal predecessors, (144), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:11:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:10,437 INFO L93 Difference]: Finished difference Result 2569 states and 3372 transitions. [2024-11-17 00:11:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:11:10,438 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.88) internal successors, (144), 50 states have internal predecessors, (144), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 146 [2024-11-17 00:11:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:10,444 INFO L225 Difference]: With dead ends: 2569 [2024-11-17 00:11:10,444 INFO L226 Difference]: Without dead ends: 2539 [2024-11-17 00:11:10,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:11:10,447 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 25 mSDsluCounter, 8525 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8857 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:10,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8857 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-17 00:11:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2024-11-17 00:11:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2524. [2024-11-17 00:11:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2524 states, 2386 states have (on average 1.2686504610226321) internal successors, (3027), 2407 states have internal predecessors, (3027), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-11-17 00:11:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3227 transitions. [2024-11-17 00:11:10,481 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3227 transitions. Word has length 146 [2024-11-17 00:11:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 2524 states and 3227 transitions. [2024-11-17 00:11:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.88) internal successors, (144), 50 states have internal predecessors, (144), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:11:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3227 transitions. [2024-11-17 00:11:10,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-17 00:11:10,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:10,483 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:11:10,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 00:11:10,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:11:10,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:10,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash -401199474, now seen corresponding path program 3 times [2024-11-17 00:11:10,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:11:10,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356567813] [2024-11-17 00:11:10,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:11:10,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:11:10,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:11:10,687 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:11:10,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 00:11:11,914 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:11:11,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:11:11,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:11:11,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:11:11,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2024-11-17 00:11:12,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 334 [2024-11-17 00:11:12,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 214 [2024-11-17 00:11:12,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:11:12,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 94 [2024-11-17 00:11:13,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-11-17 00:11:13,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-11-17 00:11:13,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:11:13,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 20 [2024-11-17 00:11:14,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:11:14,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 106 [2024-11-17 00:11:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-17 00:11:14,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:11:14,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:11:14,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356567813] [2024-11-17 00:11:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356567813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:11:14,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:11:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-17 00:11:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409809671] [2024-11-17 00:11:14,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:11:14,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:11:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:11:14,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:11:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:11:14,552 INFO L87 Difference]: Start difference. First operand 2524 states and 3227 transitions. Second operand has 16 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-17 00:11:16,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:11:18,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:11:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:27,403 INFO L93 Difference]: Finished difference Result 3206 states and 4107 transitions. [2024-11-17 00:11:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 00:11:27,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 180 [2024-11-17 00:11:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:27,411 INFO L225 Difference]: With dead ends: 3206 [2024-11-17 00:11:27,411 INFO L226 Difference]: Without dead ends: 3191 [2024-11-17 00:11:27,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:11:27,412 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 360 mSDsluCounter, 2878 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:27,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 3268 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2024-11-17 00:11:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2024-11-17 00:11:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 2807. [2024-11-17 00:11:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2653 states have (on average 1.2589521296645307) internal successors, (3340), 2677 states have internal predecessors, (3340), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-11-17 00:11:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3565 transitions. [2024-11-17 00:11:27,446 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3565 transitions. Word has length 180 [2024-11-17 00:11:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:27,447 INFO L471 AbstractCegarLoop]: Abstraction has 2807 states and 3565 transitions. [2024-11-17 00:11:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-17 00:11:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3565 transitions. [2024-11-17 00:11:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-17 00:11:27,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:27,448 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:11:27,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 00:11:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:11:27,653 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -424062729, now seen corresponding path program 4 times [2024-11-17 00:11:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:11:27,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882458216] [2024-11-17 00:11:27,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 00:11:27,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:11:27,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:11:27,657 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:11:27,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 00:11:29,709 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 00:11:29,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:11:29,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:11:29,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:11:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-17 00:11:29,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:11:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-17 00:11:29,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:11:29,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882458216] [2024-11-17 00:11:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882458216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:11:29,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:11:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:11:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746336569] [2024-11-17 00:11:29,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:11:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:11:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:11:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:11:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:11:29,974 INFO L87 Difference]: Start difference. First operand 2807 states and 3565 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-17 00:11:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:11:30,260 INFO L93 Difference]: Finished difference Result 2837 states and 3585 transitions. [2024-11-17 00:11:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:11:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 181 [2024-11-17 00:11:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:11:30,268 INFO L225 Difference]: With dead ends: 2837 [2024-11-17 00:11:30,268 INFO L226 Difference]: Without dead ends: 2807 [2024-11-17 00:11:30,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:11:30,269 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 4 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:11:30,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1981 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:11:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2024-11-17 00:11:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2807. [2024-11-17 00:11:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2653 states have (on average 1.2532981530343008) internal successors, (3325), 2677 states have internal predecessors, (3325), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-11-17 00:11:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3550 transitions. [2024-11-17 00:11:30,305 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3550 transitions. Word has length 181 [2024-11-17 00:11:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:11:30,305 INFO L471 AbstractCegarLoop]: Abstraction has 2807 states and 3550 transitions. [2024-11-17 00:11:30,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-17 00:11:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3550 transitions. [2024-11-17 00:11:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-17 00:11:30,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:11:30,307 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:11:30,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-17 00:11:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:11:30,508 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:11:30,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:11:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash 150995150, now seen corresponding path program 5 times [2024-11-17 00:11:30,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:11:30,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017965522] [2024-11-17 00:11:30,510 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 00:11:30,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:11:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:11:30,512 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:11:30,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 00:11:32,716 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-17 00:11:32,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:11:32,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-17 00:11:32,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:11:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1446 proven. 276 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-17 00:11:33,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:11:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1083 proven. 399 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2024-11-17 00:11:35,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:11:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017965522] [2024-11-17 00:11:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017965522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:11:35,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:11:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:11:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516040844] [2024-11-17 00:11:35,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:11:35,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:11:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:11:35,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:11:35,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:11:35,529 INFO L87 Difference]: Start difference. First operand 2807 states and 3550 transitions. Second operand has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 52 states have internal predecessors, (146), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)