./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-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_nondet_test3-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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:08:32,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:08:32,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:08:32,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:08:32,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:08:32,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:08:32,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:08:32,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:08:32,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:08:32,755 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:08:32,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:08:32,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:08:32,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:08:32,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:08:32,758 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:08:32,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:08:32,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:08:32,759 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:08:32,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:08:32,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:08:32,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:08:32,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:08:32,763 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:08:32,763 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:08:32,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:08:32,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:08:32,764 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:08:32,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:08:32,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:08:32,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:08:32,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:08:32,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:08:32,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:08:32,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:08:32,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:08:32,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:08:32,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:08:32,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:08:32,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:08:32,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:08:32,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:08:32,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:08:32,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:08:32,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:08:32,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:08:32,771 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-17 00:08:33,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:08:33,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:08:33,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:08:33,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:08:33,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:08:33,060 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_nondet_test3-2.i [2024-11-17 00:08:34,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:08:34,820 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:08:34,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i [2024-11-17 00:08:34,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc1eb94c/b12895ba4ed84776a8ec95663149f4e6/FLAG6f09edd12 [2024-11-17 00:08:34,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dc1eb94c/b12895ba4ed84776a8ec95663149f4e6 [2024-11-17 00:08:34,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:08:34,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:08:34,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:34,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:08:34,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:08:34,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:34" (1/1) ... [2024-11-17 00:08:34,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515a9e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:34, skipping insertion in model container [2024-11-17 00:08:34,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:34" (1/1) ... [2024-11-17 00:08:34,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:08:35,329 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:08:35,377 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:08:35,385 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:08:35,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:08:35,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:08:35,432 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:08:35,433 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:08:35,437 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:08:35,438 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:08:35,462 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:08:35,463 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:08:35,464 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:08:35,465 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:08:35,474 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:08:35,475 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:08:35,477 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:08:35,482 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:08:35,483 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:08:35,487 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:08:35,508 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:08:35,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:35,538 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:08:35,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40344bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:35, skipping insertion in model container [2024-11-17 00:08:35,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:35,539 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:08:35,541 INFO L158 Benchmark]: Toolchain (without parser) took 679.46ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 75.3MB in the beginning and 159.9MB in the end (delta: -84.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-11-17 00:08:35,541 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:08:35,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.33ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 75.3MB in the beginning and 161.0MB in the end (delta: -85.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-11-17 00:08:35,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.33ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 75.3MB in the beginning and 161.0MB in the end (delta: -85.7MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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_nondet_test3-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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:08:37,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:08:37,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:08:37,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:08:37,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:08:37,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:08:37,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:08:37,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:08:37,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:08:37,697 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:08:37,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:08:37,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:08:37,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:08:37,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:08:37,699 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:08:37,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:08:37,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:08:37,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:08:37,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:08:37,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:08:37,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:08:37,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:08:37,705 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:08:37,705 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:08:37,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:08:37,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:08:37,706 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:08:37,706 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:08:37,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:08:37,706 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:08:37,707 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:08:37,707 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:08:37,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:08:37,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:08:37,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:08:37,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:08:37,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:08:37,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:08:37,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:08:37,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:08:37,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:08:37,712 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:08:37,712 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:08:37,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:08:37,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:08:37,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:08:37,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:08:37,713 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-17 00:08:38,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:08:38,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:08:38,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:08:38,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:08:38,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:08:38,101 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_nondet_test3-2.i [2024-11-17 00:08:39,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:08:39,988 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:08:39,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i [2024-11-17 00:08:40,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5ee439e/dfdc4c9f57bc457f9fe145e81219951b/FLAG536105204 [2024-11-17 00:08:40,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5ee439e/dfdc4c9f57bc457f9fe145e81219951b [2024-11-17 00:08:40,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:08:40,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:08:40,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:40,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:08:40,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:08:40,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:40" (1/1) ... [2024-11-17 00:08:40,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f251f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:40, skipping insertion in model container [2024-11-17 00:08:40,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:08:40" (1/1) ... [2024-11-17 00:08:40,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:08:40,561 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:08:40,603 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:08:40,607 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:08:40,615 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:08:40,622 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:08:40,658 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:08:40,658 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:08:40,664 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:08:40,668 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:08:40,671 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:08:40,676 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:08:40,677 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:08:40,678 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:08:40,685 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:08:40,690 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:08:40,693 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:08:40,698 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:08:40,699 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:08:40,699 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:08:40,707 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:08:40,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:40,733 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:08:40,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:08:40,780 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:08:40,794 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:08:40,809 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:08:40,812 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:08:40,820 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:08:40,843 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:08:40,844 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:08:40,846 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:08:40,846 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:08:40,848 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:08:40,849 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:08:40,850 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:08:40,851 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:08:40,854 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:08:40,854 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:08:40,856 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:08:40,857 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:08:40,858 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:08:40,858 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:08:40,861 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:08:40,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:40,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:08:40,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:08:41,008 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:08:41,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41 WrapperNode [2024-11-17 00:08:41,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:08:41,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:08:41,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:08:41,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:08:41,019 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:08:41" (1/1) ... [2024-11-17 00:08:41,068 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:08:41" (1/1) ... [2024-11-17 00:08:41,149 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1149 [2024-11-17 00:08:41,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:08:41,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:08:41,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:08:41,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:08:41,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,279 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 266, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-17 00:08:41,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:08:41,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:08:41,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:08:41,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:08:41,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (1/1) ... [2024-11-17 00:08:41,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:08:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:08:41,397 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:08:41,399 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:08:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:08:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:08:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:08:41,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:08:41,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:08:41,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:08:41,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:08:41,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:08:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:08:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:08:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:08:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:08:41,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:08:41,715 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:08:41,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:08:49,680 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: 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:08:49,770 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-11-17 00:08:49,770 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:08:49,797 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:08:49,797 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:08:49,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:08:49 BoogieIcfgContainer [2024-11-17 00:08:49,799 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:08:49,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:08:49,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:08:49,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:08:49,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:08:40" (1/3) ... [2024-11-17 00:08:49,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372dad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:08:49, skipping insertion in model container [2024-11-17 00:08:49,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:08:41" (2/3) ... [2024-11-17 00:08:49,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372dad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:08:49, skipping insertion in model container [2024-11-17 00:08:49,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:08:49" (3/3) ... [2024-11-17 00:08:49,810 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test3-2.i [2024-11-17 00:08:49,828 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:08:49,828 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:08:49,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:08:49,894 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;@4165c410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:08:49,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:08:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 229 states have (on average 1.6419213973799127) internal successors, (376), 232 states have internal predecessors, (376), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:08:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:08:49,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:49,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:08:49,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:49,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 407442376, now seen corresponding path program 1 times [2024-11-17 00:08:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:08:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206243077] [2024-11-17 00:08:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:49,928 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:08:49,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:08:49,930 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:08:49,948 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:08:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:50,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:08:50,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:50,223 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_18| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_18| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-17 00:08:50,240 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:08:50,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:08:50,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:08:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206243077] [2024-11-17 00:08:50,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206243077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:08:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:08:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908770953] [2024-11-17 00:08:50,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:50,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:08:50,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:08:50,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:08:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:08:50,311 INFO L87 Difference]: Start difference. First operand has 239 states, 229 states have (on average 1.6419213973799127) internal successors, (376), 232 states have internal predecessors, (376), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:08:54,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:08:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:08:55,121 INFO L93 Difference]: Finished difference Result 366 states and 478 transitions. [2024-11-17 00:08:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:08:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 00:08:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:08:55,139 INFO L225 Difference]: With dead ends: 366 [2024-11-17 00:08:55,140 INFO L226 Difference]: Without dead ends: 361 [2024-11-17 00:08:55,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:08:55,143 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 160 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 479 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-17 00:08:55,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 583 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 1 Unknown, 479 Unchecked, 4.7s Time] [2024-11-17 00:08:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-17 00:08:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 235. [2024-11-17 00:08:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 226 states have (on average 1.2964601769911503) internal successors, (293), 228 states have internal predecessors, (293), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 00:08:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 303 transitions. [2024-11-17 00:08:55,190 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 303 transitions. Word has length 5 [2024-11-17 00:08:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:08:55,191 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 303 transitions. [2024-11-17 00:08:55,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:08:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 303 transitions. [2024-11-17 00:08:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:08:55,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:08:55,197 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:08:55,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:08:55,397 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:08:55,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:08:55,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:08:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 264698789, now seen corresponding path program 1 times [2024-11-17 00:08:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:08:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426426287] [2024-11-17 00:08:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:08:55,400 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:08:55,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:08:55,403 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:08:55,405 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:08:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:08:55,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:08:55,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:08:55,804 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:08:55,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:08:55,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:08:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426426287] [2024-11-17 00:08:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426426287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:08:55,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:08:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:08:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420899110] [2024-11-17 00:08:55,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:08:55,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:08:55,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:08:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:08:55,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:08:55,810 INFO L87 Difference]: Start difference. First operand 235 states and 303 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:09:00,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:01,994 INFO L93 Difference]: Finished difference Result 387 states and 500 transitions. [2024-11-17 00:09:01,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:09:01,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 16 [2024-11-17 00:09:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:02,000 INFO L225 Difference]: With dead ends: 387 [2024-11-17 00:09:02,000 INFO L226 Difference]: Without dead ends: 387 [2024-11-17 00:09:02,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:02,002 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 188 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:02,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 851 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-11-17 00:09:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-17 00:09:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 354. [2024-11-17 00:09:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 344 states have (on average 1.2965116279069768) internal successors, (446), 347 states have internal predecessors, (446), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:09:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 458 transitions. [2024-11-17 00:09:02,023 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 458 transitions. Word has length 16 [2024-11-17 00:09:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:02,024 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 458 transitions. [2024-11-17 00:09:02,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:09:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 458 transitions. [2024-11-17 00:09:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:09:02,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:02,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:02,030 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:09:02,225 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:09:02,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:02,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash 555985661, now seen corresponding path program 1 times [2024-11-17 00:09:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:02,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36780576] [2024-11-17 00:09:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:02,228 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:09:02,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:02,231 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:09:02,232 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:09:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:02,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:09:02,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:02,633 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_19| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_19|)))) is different from true [2024-11-17 00:09:02,646 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:09:02,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:02,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36780576] [2024-11-17 00:09:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36780576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:02,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:09:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139883756] [2024-11-17 00:09:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:02,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:02,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:09:02,649 INFO L87 Difference]: Start difference. First operand 354 states and 458 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:09:06,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:07,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:07,200 INFO L93 Difference]: Finished difference Result 451 states and 581 transitions. [2024-11-17 00:09:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:09:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 00:09:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:07,208 INFO L225 Difference]: With dead ends: 451 [2024-11-17 00:09:07,209 INFO L226 Difference]: Without dead ends: 440 [2024-11-17 00:09:07,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 00:09:07,210 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 87 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:07,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 577 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 409 Unchecked, 4.5s Time] [2024-11-17 00:09:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-17 00:09:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 400. [2024-11-17 00:09:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 389 states have (on average 1.2956298200514138) internal successors, (504), 392 states have internal predecessors, (504), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 00:09:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 518 transitions. [2024-11-17 00:09:07,231 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 518 transitions. Word has length 19 [2024-11-17 00:09:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:07,231 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 518 transitions. [2024-11-17 00:09:07,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:09:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 518 transitions. [2024-11-17 00:09:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:09:07,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:07,236 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:09:07,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:07,436 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:09:07,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:07,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1082907658, now seen corresponding path program 1 times [2024-11-17 00:09:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:07,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305211440] [2024-11-17 00:09:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:07,439 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:09:07,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:07,440 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:09:07,442 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:09:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:07,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:07,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:07,696 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:09:07,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:07,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305211440] [2024-11-17 00:09:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305211440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082609295] [2024-11-17 00:09:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:07,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:07,699 INFO L87 Difference]: Start difference. First operand 400 states and 518 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:07,855 INFO L93 Difference]: Finished difference Result 409 states and 503 transitions. [2024-11-17 00:09:07,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:07,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 52 [2024-11-17 00:09:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:07,858 INFO L225 Difference]: With dead ends: 409 [2024-11-17 00:09:07,858 INFO L226 Difference]: Without dead ends: 409 [2024-11-17 00:09:07,858 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:09:07,859 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 30 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 799 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:09:07,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 799 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:09:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-17 00:09:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2024-11-17 00:09:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 398 states have (on average 1.228643216080402) internal successors, (489), 401 states have internal predecessors, (489), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 00:09:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 503 transitions. [2024-11-17 00:09:07,883 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 503 transitions. Word has length 52 [2024-11-17 00:09:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 503 transitions. [2024-11-17 00:09:07,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:09:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 503 transitions. [2024-11-17 00:09:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:09:07,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:07,886 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:09:07,896 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:09:08,089 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:09:08,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:08,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1303184143, now seen corresponding path program 1 times [2024-11-17 00:09:08,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323638724] [2024-11-17 00:09:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:08,128 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:09:08,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:08,139 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:09:08,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 (6)] Waiting until timeout for monitored process [2024-11-17 00:09:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:08,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:09:08,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:08,389 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:08,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:08,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:08,398 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:09:08,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:09:08,480 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:09:08,547 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:09:08,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:08,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323638724] [2024-11-17 00:09:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323638724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:08,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:08,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:09:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495512635] [2024-11-17 00:09:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:08,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:09:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:09:08,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:08,555 INFO L87 Difference]: Start difference. First operand 409 states and 503 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:09:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:09,136 INFO L93 Difference]: Finished difference Result 410 states and 510 transitions. [2024-11-17 00:09:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2024-11-17 00:09:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:09,140 INFO L225 Difference]: With dead ends: 410 [2024-11-17 00:09:09,140 INFO L226 Difference]: Without dead ends: 407 [2024-11-17 00:09:09,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:09:09,141 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 110 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:09,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1198 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:09:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-17 00:09:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 359. [2024-11-17 00:09:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 349 states have (on average 1.2435530085959885) internal successors, (434), 352 states have internal predecessors, (434), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:09:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 446 transitions. [2024-11-17 00:09:09,154 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 446 transitions. Word has length 52 [2024-11-17 00:09:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:09,155 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 446 transitions. [2024-11-17 00:09:09,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:09:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 446 transitions. [2024-11-17 00:09:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:09:09,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:09,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:09,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:09:09,358 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:09:09,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:09,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1931357654, now seen corresponding path program 1 times [2024-11-17 00:09:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:09,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877060885] [2024-11-17 00:09:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:09,360 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:09:09,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:09,363 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:09:09,364 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:09:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:09,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:09,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:09:09,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:09,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:09,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877060885] [2024-11-17 00:09:09,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877060885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:09,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152058891] [2024-11-17 00:09:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:09,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:09,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:09,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:09,869 INFO L87 Difference]: Start difference. First operand 359 states and 446 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:10,003 INFO L93 Difference]: Finished difference Result 365 states and 436 transitions. [2024-11-17 00:09:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:10,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-17 00:09:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:10,005 INFO L225 Difference]: With dead ends: 365 [2024-11-17 00:09:10,007 INFO L226 Difference]: Without dead ends: 365 [2024-11-17 00:09:10,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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:09:10,008 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 30 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:10,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 764 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:09:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-17 00:09:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-17 00:09:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 355 states have (on average 1.1943661971830986) internal successors, (424), 358 states have internal predecessors, (424), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:09:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 436 transitions. [2024-11-17 00:09:10,018 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 436 transitions. Word has length 88 [2024-11-17 00:09:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 436 transitions. [2024-11-17 00:09:10,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 436 transitions. [2024-11-17 00:09:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:09:10,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:10,023 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:10,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:09:10,224 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:09:10,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2001055842, now seen corresponding path program 1 times [2024-11-17 00:09:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:10,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641352403] [2024-11-17 00:09:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:10,226 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:09:10,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:10,227 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:09:10,228 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:09:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:10,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:09:10,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:09:10,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:10,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641352403] [2024-11-17 00:09:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641352403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:09:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982017558] [2024-11-17 00:09:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:10,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:09:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:09:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:10,805 INFO L87 Difference]: Start difference. First operand 365 states and 436 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:10,906 INFO L93 Difference]: Finished difference Result 353 states and 416 transitions. [2024-11-17 00:09:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-17 00:09:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:10,908 INFO L225 Difference]: With dead ends: 353 [2024-11-17 00:09:10,908 INFO L226 Difference]: Without dead ends: 353 [2024-11-17 00:09:10,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:09:10,909 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 4 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:10,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 763 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:09:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-17 00:09:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2024-11-17 00:09:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 1.1778425655976676) internal successors, (404), 346 states have internal predecessors, (404), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:09:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 416 transitions. [2024-11-17 00:09:10,918 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 416 transitions. Word has length 88 [2024-11-17 00:09:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:10,918 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 416 transitions. [2024-11-17 00:09:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 416 transitions. [2024-11-17 00:09:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 00:09:10,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:10,920 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:10,932 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:09:11,120 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:09:11,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:11,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash 970060124, now seen corresponding path program 1 times [2024-11-17 00:09:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638919470] [2024-11-17 00:09:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:11,122 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:09:11,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:11,123 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:09:11,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:09:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:11,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:11,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:09:11,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:11,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638919470] [2024-11-17 00:09:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638919470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:11,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:11,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008005083] [2024-11-17 00:09:11,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:11,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:11,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:11,635 INFO L87 Difference]: Start difference. First operand 353 states and 416 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:09:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:11,679 INFO L93 Difference]: Finished difference Result 356 states and 420 transitions. [2024-11-17 00:09:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:09:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2024-11-17 00:09:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:11,683 INFO L225 Difference]: With dead ends: 356 [2024-11-17 00:09:11,683 INFO L226 Difference]: Without dead ends: 356 [2024-11-17 00:09:11,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 85 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:09:11,684 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:11,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 818 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:09:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-17 00:09:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-11-17 00:09:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 345 states have (on average 1.1797101449275362) internal successors, (407), 349 states have internal predecessors, (407), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:09:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 420 transitions. [2024-11-17 00:09:11,695 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 420 transitions. Word has length 88 [2024-11-17 00:09:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:11,696 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 420 transitions. [2024-11-17 00:09:11,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:09:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 420 transitions. [2024-11-17 00:09:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-17 00:09:11,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:11,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:11,710 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:09:11,898 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:09:11,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1328637792, now seen corresponding path program 1 times [2024-11-17 00:09:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:11,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059545364] [2024-11-17 00:09:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:11,900 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:09:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:11,902 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:09:11,903 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:09:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:12,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:09:12,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:09:12,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:09:12,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:12,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059545364] [2024-11-17 00:09:12,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059545364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:12,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:12,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:09:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739490853] [2024-11-17 00:09:12,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:12,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:09:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:09:12,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:09:12,491 INFO L87 Difference]: Start difference. First operand 356 states and 420 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:12,736 INFO L93 Difference]: Finished difference Result 367 states and 436 transitions. [2024-11-17 00:09:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:09:12,737 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 90 [2024-11-17 00:09:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:12,739 INFO L225 Difference]: With dead ends: 367 [2024-11-17 00:09:12,739 INFO L226 Difference]: Without dead ends: 367 [2024-11-17 00:09:12,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 172 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:09:12,741 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 4 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:12,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1897 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:09:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-17 00:09:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-11-17 00:09:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.1926345609065157) internal successors, (421), 357 states have internal predecessors, (421), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:09:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 434 transitions. [2024-11-17 00:09:12,751 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 434 transitions. Word has length 90 [2024-11-17 00:09:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:12,751 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 434 transitions. [2024-11-17 00:09:12,751 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 434 transitions. [2024-11-17 00:09:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 00:09:12,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:12,753 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:12,771 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:09:12,953 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:09:12,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:12,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2057035428, now seen corresponding path program 2 times [2024-11-17 00:09:12,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:12,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629158650] [2024-11-17 00:09:12,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:09:12,955 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:09:12,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:12,958 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:09:12,959 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:09:13,479 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:09:13,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:13,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:09:13,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:09:13,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:09:13,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:13,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629158650] [2024-11-17 00:09:13,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629158650] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:13,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:13,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:09:13,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076869946] [2024-11-17 00:09:13,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:13,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:09:13,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:13,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:09:13,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:09:13,935 INFO L87 Difference]: Start difference. First operand 365 states and 434 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:14,515 INFO L93 Difference]: Finished difference Result 380 states and 456 transitions. [2024-11-17 00:09:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:09:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 94 [2024-11-17 00:09:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:14,518 INFO L225 Difference]: With dead ends: 380 [2024-11-17 00:09:14,518 INFO L226 Difference]: Without dead ends: 376 [2024-11-17 00:09:14,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 174 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:09:14,519 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 8 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:14,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2175 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:09:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-17 00:09:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2024-11-17 00:09:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 362 states have (on average 1.1961325966850829) internal successors, (433), 366 states have internal predecessors, (433), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:09:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 446 transitions. [2024-11-17 00:09:14,527 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 446 transitions. Word has length 94 [2024-11-17 00:09:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:14,528 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 446 transitions. [2024-11-17 00:09:14,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 446 transitions. [2024-11-17 00:09:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 00:09:14,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:14,529 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-11-17 00:09:14,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:14,729 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:09:14,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1526456884, now seen corresponding path program 3 times [2024-11-17 00:09:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686988515] [2024-11-17 00:09:14,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:09:14,731 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:09:14,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:14,732 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:09:14,733 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:09:15,184 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:09:15,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:15,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:09:15,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:15,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:15,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:15,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:09:15,636 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:09:15,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:09:15,738 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:09:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-17 00:09:15,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:15,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:15,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686988515] [2024-11-17 00:09:15,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686988515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:15,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:15,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:09:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106049293] [2024-11-17 00:09:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:15,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:09:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:15,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:09:15,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:09:15,780 INFO L87 Difference]: Start difference. First operand 374 states and 446 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:16,076 INFO L93 Difference]: Finished difference Result 493 states and 596 transitions. [2024-11-17 00:09:16,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:09:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-17 00:09:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:16,081 INFO L225 Difference]: With dead ends: 493 [2024-11-17 00:09:16,081 INFO L226 Difference]: Without dead ends: 493 [2024-11-17 00:09:16,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:09:16,082 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 345 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:16,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 784 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:09:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-17 00:09:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 376. [2024-11-17 00:09:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 364 states have (on average 1.195054945054945) internal successors, (435), 368 states have internal predecessors, (435), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:09:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 448 transitions. [2024-11-17 00:09:16,096 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 448 transitions. Word has length 103 [2024-11-17 00:09:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:16,097 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 448 transitions. [2024-11-17 00:09:16,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 448 transitions. [2024-11-17 00:09:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-17 00:09:16,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:16,100 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:16,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 00:09:16,300 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:09:16,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash -777646562, now seen corresponding path program 1 times [2024-11-17 00:09:16,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191514514] [2024-11-17 00:09:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:16,302 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:09:16,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:16,306 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:09:16,307 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:09:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:16,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:09:16,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:09:17,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:09:17,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191514514] [2024-11-17 00:09:17,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191514514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:17,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:17,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:09:17,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711177266] [2024-11-17 00:09:17,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:17,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:09:17,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:09:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:09:17,879 INFO L87 Difference]: Start difference. First operand 376 states and 448 transitions. Second operand has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:20,087 INFO L93 Difference]: Finished difference Result 400 states and 488 transitions. [2024-11-17 00:09:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:09:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-11-17 00:09:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:20,090 INFO L225 Difference]: With dead ends: 400 [2024-11-17 00:09:20,091 INFO L226 Difference]: Without dead ends: 396 [2024-11-17 00:09:20,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:09:20,093 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 13 mSDsluCounter, 3265 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3539 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:20,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3539 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-17 00:09:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-17 00:09:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 394. [2024-11-17 00:09:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 382 states have (on average 1.2015706806282722) internal successors, (459), 386 states have internal predecessors, (459), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:09:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 472 transitions. [2024-11-17 00:09:20,102 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 472 transitions. Word has length 139 [2024-11-17 00:09:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:20,103 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 472 transitions. [2024-11-17 00:09:20,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 472 transitions. [2024-11-17 00:09:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-17 00:09:20,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:20,106 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:20,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:20,306 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:09:20,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:20,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1192305122, now seen corresponding path program 2 times [2024-11-17 00:09:20,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:20,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336967419] [2024-11-17 00:09:20,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:09:20,308 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:09:20,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:20,310 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:09:20,311 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:09:21,050 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:09:21,051 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:21,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:09:21,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 00:09:21,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-17 00:09:23,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336967419] [2024-11-17 00:09:23,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336967419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:23,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:23,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:09:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649953816] [2024-11-17 00:09:23,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:23,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:09:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:09:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:09:23,721 INFO L87 Difference]: Start difference. First operand 394 states and 472 transitions. Second operand has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:30,468 INFO L93 Difference]: Finished difference Result 434 states and 544 transitions. [2024-11-17 00:09:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:09:30,469 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 157 [2024-11-17 00:09:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:30,470 INFO L225 Difference]: With dead ends: 434 [2024-11-17 00:09:30,470 INFO L226 Difference]: Without dead ends: 430 [2024-11-17 00:09:30,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:09:30,473 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 26 mSDsluCounter, 6529 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6803 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:30,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6803 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-17 00:09:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-17 00:09:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2024-11-17 00:09:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 416 states have (on average 1.2139423076923077) internal successors, (505), 420 states have internal predecessors, (505), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 00:09:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 518 transitions. [2024-11-17 00:09:30,484 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 518 transitions. Word has length 157 [2024-11-17 00:09:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:30,484 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 518 transitions. [2024-11-17 00:09:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:09:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 518 transitions. [2024-11-17 00:09:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-17 00:09:30,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:30,486 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:30,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:30,687 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:09:30,687 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:30,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2187422, now seen corresponding path program 3 times [2024-11-17 00:09:30,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:30,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607296884] [2024-11-17 00:09:30,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:09:30,689 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:09:30,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:30,691 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:09:30,692 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:09:31,251 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:09:31,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:31,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:09:31,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-17 00:09:31,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:09:31,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:31,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607296884] [2024-11-17 00:09:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607296884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:09:31,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:09:31,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:09:31,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633572677] [2024-11-17 00:09:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:09:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:09:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:31,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:09:31,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:09:31,586 INFO L87 Difference]: Start difference. First operand 428 states and 518 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:35,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:39,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:09:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:42,098 INFO L93 Difference]: Finished difference Result 603 states and 737 transitions. [2024-11-17 00:09:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:09:42,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 191 [2024-11-17 00:09:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:42,103 INFO L225 Difference]: With dead ends: 603 [2024-11-17 00:09:42,103 INFO L226 Difference]: Without dead ends: 603 [2024-11-17 00:09:42,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 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:09:42,105 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 531 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:42,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 594 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-11-17 00:09:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-17 00:09:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 529. [2024-11-17 00:09:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 515 states have (on average 1.2116504854368932) internal successors, (624), 520 states have internal predecessors, (624), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-17 00:09:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 641 transitions. [2024-11-17 00:09:42,118 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 641 transitions. Word has length 191 [2024-11-17 00:09:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:42,119 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 641 transitions. [2024-11-17 00:09:42,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:09:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 641 transitions. [2024-11-17 00:09:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-17 00:09:42,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:42,121 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:42,136 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:09:42,321 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:09:42,322 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1982164362, now seen corresponding path program 1 times [2024-11-17 00:09:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270780078] [2024-11-17 00:09:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:09:42,323 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:09:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:42,325 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:09:42,326 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:09:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:09:43,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 1293 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:09:43,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:09:44,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:09:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:09:45,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:09:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270780078] [2024-11-17 00:09:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270780078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:09:45,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:09:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:09:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410469914] [2024-11-17 00:09:45,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:09:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:09:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:09:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:09:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:09:45,959 INFO L87 Difference]: Start difference. First operand 529 states and 641 transitions. Second operand has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:09:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:09:52,869 INFO L93 Difference]: Finished difference Result 558 states and 695 transitions. [2024-11-17 00:09:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-17 00:09:52,871 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 200 [2024-11-17 00:09:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:09:52,873 INFO L225 Difference]: With dead ends: 558 [2024-11-17 00:09:52,873 INFO L226 Difference]: Without dead ends: 558 [2024-11-17 00:09:52,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-17 00:09:52,877 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 26 mSDsluCounter, 6507 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6780 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:09:52,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6780 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 00:09:52,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-17 00:09:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 554. [2024-11-17 00:09:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 540 states have (on average 1.2481481481481482) internal successors, (674), 545 states have internal predecessors, (674), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-17 00:09:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 691 transitions. [2024-11-17 00:09:52,889 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 691 transitions. Word has length 200 [2024-11-17 00:09:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:09:52,889 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 691 transitions. [2024-11-17 00:09:52,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:09:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 691 transitions. [2024-11-17 00:09:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-17 00:09:52,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:09:52,892 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:09:52,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:09:53,092 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:09:53,094 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:09:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:09:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1813960754, now seen corresponding path program 2 times [2024-11-17 00:09:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:09:53,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454359369] [2024-11-17 00:09:53,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:09:53,096 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:09:53,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:09:53,099 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:09:53,101 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:09:55,078 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:09:55,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:09:55,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 00:09:55,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:09:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:09:56,916 INFO L311 TraceCheckSpWp]: Computing backward predicates...