./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.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 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:15:47,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:15:47,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:15:47,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:15:47,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:15:47,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:15:47,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:15:47,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:15:47,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:15:47,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:15:47,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:15:47,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:15:47,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:15:47,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:15:47,597 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:15:47,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:15:47,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:15:47,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:15:47,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:15:47,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:15:47,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:15:47,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:15:47,600 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:15:47,600 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:15:47,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:15:47,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:15:47,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:15:47,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:15:47,601 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:15:47,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:15:47,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:15:47,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:15:47,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:15:47,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:15:47,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:15:47,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:15:47,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:15:47,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:15:47,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:15:47,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:15:47,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:15:47,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:15:47,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:15:47,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:15:47,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:15:47,605 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 -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2024-11-19 06:15:47,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:15:47,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:15:47,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:15:47,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:15:47,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:15:47,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 06:15:49,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:15:49,261 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:15:49,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 06:15:49,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4240fa4aa/9df1e4aeddef4fa5b409b7788dfce6de/FLAGa287b3a7b [2024-11-19 06:15:49,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4240fa4aa/9df1e4aeddef4fa5b409b7788dfce6de [2024-11-19 06:15:49,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:15:49,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:15:49,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:49,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:15:49,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:15:49,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:49" (1/1) ... [2024-11-19 06:15:49,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110f7769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:49, skipping insertion in model container [2024-11-19 06:15:49,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:49" (1/1) ... [2024-11-19 06:15:49,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:15:49,959 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:49,987 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:49,994 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:49,997 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,008 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,034 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,035 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,036 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,038 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,039 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,041 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,042 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,045 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:50,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:50,064 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:15:50,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72dbf246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:50, skipping insertion in model container [2024-11-19 06:15:50,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:50,066 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:15:50,067 INFO L158 Benchmark]: Toolchain (without parser) took 488.00ms. Allocated memory is still 165.7MB. Free memory was 122.2MB in the beginning and 99.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:15:50,068 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:15:50,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.11ms. Allocated memory is still 165.7MB. Free memory was 121.7MB in the beginning and 99.6MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:15:50,069 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.11ms. Allocated memory is still 165.7MB. Free memory was 121.7MB in the beginning and 99.6MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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_FNV_test7-1.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 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:15:51,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:15:51,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:15:51,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:15:51,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:15:51,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:15:51,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:15:51,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:15:51,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:15:51,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:15:51,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:15:51,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:15:51,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:15:51,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:15:51,776 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:15:51,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:15:51,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:15:51,781 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:15:51,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:15:51,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:15:51,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:15:51,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:15:51,783 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:15:51,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:15:51,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:15:51,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:15:51,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:15:51,785 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:15:51,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:15:51,785 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:15:51,785 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:15:51,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:15:51,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:15:51,786 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:15:51,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:15:51,786 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:15:51,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:15:51,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:15:51,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:15:51,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:15:51,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:15:51,788 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:15:51,788 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:15:51,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:15:51,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:15:51,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:15:51,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:15:51,789 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 -> 89806bf5e92e08240ee093afcceea93b900865db28253b34ac5f2402fc0c0eb8 [2024-11-19 06:15:52,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:15:52,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:15:52,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:15:52,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:15:52,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:15:52,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 06:15:53,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:15:53,630 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:15:53,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-1.i [2024-11-19 06:15:53,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de8176e8/c6f09f2c85264c08bd53ce0ae0f8316e/FLAG2f3402cef [2024-11-19 06:15:53,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de8176e8/c6f09f2c85264c08bd53ce0ae0f8316e [2024-11-19 06:15:53,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:15:53,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:15:53,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:53,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:15:53,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:15:53,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:53" (1/1) ... [2024-11-19 06:15:53,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edf7d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:53, skipping insertion in model container [2024-11-19 06:15:53,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:15:53" (1/1) ... [2024-11-19 06:15:53,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:15:54,022 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,044 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,053 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,071 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,106 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,106 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,108 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,109 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,111 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:54,131 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:15:54,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:15:54,164 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,179 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,181 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,184 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,201 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,202 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,203 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,204 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,210 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,210 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,211 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,213 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,216 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:15:54,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:54,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:15:54,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:15:54,327 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:15:54,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54 WrapperNode [2024-11-19 06:15:54,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:15:54,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:15:54,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:15:54,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:15:54,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,418 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018 [2024-11-19 06:15:54,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:15:54,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:15:54,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:15:54,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:15:54,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,508 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-19 06:15:54,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:15:54,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:15:54,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:15:54,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:15:54,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (1/1) ... [2024-11-19 06:15:54,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:15:54,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:15:54,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:15:54,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:15:54,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:15:54,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 06:15:54,646 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:15:54,646 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:15:54,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 06:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:15:54,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:15:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:15:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:15:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:15:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:15:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:15:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:15:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:15:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:15:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:15:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:15:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:15:54,847 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:15:54,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:16:01,948 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-19 06:16:01,948 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:16:01,963 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:16:01,963 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 06:16:01,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:16:01 BoogieIcfgContainer [2024-11-19 06:16:01,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:16:01,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:16:01,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:16:01,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:16:01,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:15:53" (1/3) ... [2024-11-19 06:16:01,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4562a685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:16:01, skipping insertion in model container [2024-11-19 06:16:01,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:15:54" (2/3) ... [2024-11-19 06:16:01,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4562a685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:16:01, skipping insertion in model container [2024-11-19 06:16:01,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:16:01" (3/3) ... [2024-11-19 06:16:01,973 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-1.i [2024-11-19 06:16:01,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:16:01,985 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:16:02,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:16:02,035 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;@a37ff37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:16:02,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:16:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 187 states have (on average 1.6684491978609626) internal successors, (312), 190 states have internal predecessors, (312), 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-19 06:16:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:16:02,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:02,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:16:02,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash 253905471, now seen corresponding path program 1 times [2024-11-19 06:16:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:02,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377350698] [2024-11-19 06:16:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:02,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:02,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:02,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:16:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:02,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:16:02,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:16:02,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:02,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377350698] [2024-11-19 06:16:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377350698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:02,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:16:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555540047] [2024-11-19 06:16:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:02,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:16:02,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:02,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:16:02,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:16:02,253 INFO L87 Difference]: Start difference. First operand has 197 states, 187 states have (on average 1.6684491978609626) internal successors, (312), 190 states have internal predecessors, (312), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-19 06:16:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:02,282 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2024-11-19 06:16:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:16:02,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-19 06:16:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:02,292 INFO L225 Difference]: With dead ends: 194 [2024-11-19 06:16:02,292 INFO L226 Difference]: Without dead ends: 192 [2024-11-19 06:16:02,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:16:02,297 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:02,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:16:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-19 06:16:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-19 06:16:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 184 states have (on average 1.298913043478261) internal successors, (239), 186 states have internal predecessors, (239), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:16:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2024-11-19 06:16:02,359 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 9 [2024-11-19 06:16:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:02,359 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2024-11-19 06:16:02,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-19 06:16:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2024-11-19 06:16:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:16:02,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:02,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:16:02,388 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-19 06:16:02,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:02,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:02,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1725709565, now seen corresponding path program 1 times [2024-11-19 06:16:02,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:02,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585111886] [2024-11-19 06:16:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:02,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:02,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:02,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:16:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:02,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:16:02,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:02,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:16:02,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:16:02,763 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 33 treesize of output 31 [2024-11-19 06:16:02,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:16:02,811 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 62 treesize of output 22 [2024-11-19 06:16:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:16:02,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:02,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585111886] [2024-11-19 06:16:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585111886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:02,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:02,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:16:02,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956457990] [2024-11-19 06:16:02,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:02,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:16:02,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:02,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:16:02,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:02,837 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 06:16:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:03,350 INFO L93 Difference]: Finished difference Result 372 states and 483 transitions. [2024-11-19 06:16:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:16:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-19 06:16:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:03,353 INFO L225 Difference]: With dead ends: 372 [2024-11-19 06:16:03,353 INFO L226 Difference]: Without dead ends: 372 [2024-11-19 06:16:03,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:16:03,354 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 225 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:03,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 727 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:16:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-19 06:16:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 194. [2024-11-19 06:16:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 186 states have (on average 1.2956989247311828) internal successors, (241), 188 states have internal predecessors, (241), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:16:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 249 transitions. [2024-11-19 06:16:03,372 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 249 transitions. Word has length 11 [2024-11-19 06:16:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:03,373 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 249 transitions. [2024-11-19 06:16:03,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 06:16:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2024-11-19 06:16:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 06:16:03,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:03,376 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:16:03,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:16:03,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:03,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1334240943, now seen corresponding path program 1 times [2024-11-19 06:16:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629430557] [2024-11-19 06:16:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:03,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:03,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:03,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:16:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:03,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:16:03,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:16:03,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:03,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629430557] [2024-11-19 06:16:03,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629430557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:03,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:16:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279095993] [2024-11-19 06:16:03,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:03,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:16:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:03,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:16:03,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:03,966 INFO L87 Difference]: Start difference. First operand 194 states and 249 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-19 06:16:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:04,070 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2024-11-19 06:16:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:16:04,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2024-11-19 06:16:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:04,071 INFO L225 Difference]: With dead ends: 197 [2024-11-19 06:16:04,071 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 06:16:04,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:16:04,072 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 30 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:04,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 632 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:16:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 06:16:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-19 06:16:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 191 states have internal predecessors, (236), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:16:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2024-11-19 06:16:04,078 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 67 [2024-11-19 06:16:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:04,078 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2024-11-19 06:16:04,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-19 06:16:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2024-11-19 06:16:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 06:16:04,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:04,080 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:16:04,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:16:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:04,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:04,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1096998621, now seen corresponding path program 1 times [2024-11-19 06:16:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:04,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132210951] [2024-11-19 06:16:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:04,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:04,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:16:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:04,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:16:04,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:16:04,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:04,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:04,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132210951] [2024-11-19 06:16:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132210951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:04,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:16:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332456817] [2024-11-19 06:16:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:04,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:16:04,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:04,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:16:04,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:16:04,784 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-19 06:16:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:05,255 INFO L93 Difference]: Finished difference Result 308 states and 381 transitions. [2024-11-19 06:16:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:16:05,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2024-11-19 06:16:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:05,257 INFO L225 Difference]: With dead ends: 308 [2024-11-19 06:16:05,257 INFO L226 Difference]: Without dead ends: 308 [2024-11-19 06:16:05,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:16:05,258 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 90 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:05,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 490 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:16:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-19 06:16:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-11-19 06:16:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 297 states have (on average 1.245791245791246) internal successors, (370), 299 states have internal predecessors, (370), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:16:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 378 transitions. [2024-11-19 06:16:05,268 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 378 transitions. Word has length 67 [2024-11-19 06:16:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:05,271 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 378 transitions. [2024-11-19 06:16:05,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-19 06:16:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 378 transitions. [2024-11-19 06:16:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 06:16:05,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:05,274 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] [2024-11-19 06:16:05,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:16:05,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:05,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:05,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1043702760, now seen corresponding path program 1 times [2024-11-19 06:16:05,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:05,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031417399] [2024-11-19 06:16:05,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:05,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:05,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:05,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:16:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:05,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:16:05,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:05,861 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-19 06:16:05,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:05,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031417399] [2024-11-19 06:16:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031417399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:05,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:05,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:16:05,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931878939] [2024-11-19 06:16:05,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:05,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:16:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:05,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:16:05,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:05,864 INFO L87 Difference]: Start difference. First operand 305 states and 378 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:16:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:05,890 INFO L93 Difference]: Finished difference Result 308 states and 382 transitions. [2024-11-19 06:16:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:16:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-19 06:16:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:05,892 INFO L225 Difference]: With dead ends: 308 [2024-11-19 06:16:05,893 INFO L226 Difference]: Without dead ends: 308 [2024-11-19 06:16:05,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:05,893 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 695 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-19 06:16:05,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 695 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:16:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-19 06:16:05,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-19 06:16:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.2474916387959867) internal successors, (373), 302 states have internal predecessors, (373), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 382 transitions. [2024-11-19 06:16:05,900 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 382 transitions. Word has length 82 [2024-11-19 06:16:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:05,900 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 382 transitions. [2024-11-19 06:16:05,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:16:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 382 transitions. [2024-11-19 06:16:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 06:16:05,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:05,902 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] [2024-11-19 06:16:05,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:16:06,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:06,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:06,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash -388445802, now seen corresponding path program 1 times [2024-11-19 06:16:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:06,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779793708] [2024-11-19 06:16:06,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:06,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:06,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:06,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:06,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:16:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:06,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:16:06,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:06,472 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-19 06:16:06,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:06,549 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-19 06:16:06,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779793708] [2024-11-19 06:16:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779793708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:06,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:16:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525044162] [2024-11-19 06:16:06,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:06,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:16:06,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:06,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:16:06,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:16:06,554 INFO L87 Difference]: Start difference. First operand 308 states and 382 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:06,672 INFO L93 Difference]: Finished difference Result 319 states and 398 transitions. [2024-11-19 06:16:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:16:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84 [2024-11-19 06:16:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:06,674 INFO L225 Difference]: With dead ends: 319 [2024-11-19 06:16:06,674 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 06:16:06,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:16:06,675 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 5 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:06,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:16:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 06:16:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2024-11-19 06:16:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 307 states have (on average 1.260586319218241) internal successors, (387), 310 states have internal predecessors, (387), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 396 transitions. [2024-11-19 06:16:06,681 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 396 transitions. Word has length 84 [2024-11-19 06:16:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:06,682 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 396 transitions. [2024-11-19 06:16:06,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 396 transitions. [2024-11-19 06:16:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 06:16:06,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:06,684 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] [2024-11-19 06:16:06,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:16:06,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:06,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:06,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1144462136, now seen corresponding path program 2 times [2024-11-19 06:16:06,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:06,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972232355] [2024-11-19 06:16:06,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:16:06,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:06,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:06,888 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:06,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:16:07,115 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:16:07,115 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:07,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:16:07,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:07,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:16:07,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:16:07,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:16:07,131 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-19 06:16:07,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:16:07,162 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-19 06:16:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 06:16:07,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:07,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972232355] [2024-11-19 06:16:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972232355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:07,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:07,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:16:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47628991] [2024-11-19 06:16:07,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:07,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:16:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:16:07,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:07,173 INFO L87 Difference]: Start difference. First operand 317 states and 396 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:07,606 INFO L93 Difference]: Finished difference Result 477 states and 607 transitions. [2024-11-19 06:16:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:16:07,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-19 06:16:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:07,609 INFO L225 Difference]: With dead ends: 477 [2024-11-19 06:16:07,609 INFO L226 Difference]: Without dead ends: 477 [2024-11-19 06:16:07,609 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-19 06:16:07,612 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 207 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:07,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 697 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:16:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-19 06:16:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 319. [2024-11-19 06:16:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 309 states have (on average 1.2588996763754046) internal successors, (389), 312 states have internal predecessors, (389), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 398 transitions. [2024-11-19 06:16:07,627 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 398 transitions. Word has length 88 [2024-11-19 06:16:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:07,627 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 398 transitions. [2024-11-19 06:16:07,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 398 transitions. [2024-11-19 06:16:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 06:16:07,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:07,629 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:16:07,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:16:07,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:07,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:07,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:07,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1070507670, now seen corresponding path program 1 times [2024-11-19 06:16:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:07,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29258490] [2024-11-19 06:16:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:07,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:07,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:07,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:07,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:16:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:08,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:16:08,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:08,298 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-19 06:16:08,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:08,443 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-19 06:16:08,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29258490] [2024-11-19 06:16:08,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29258490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:08,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:16:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805793719] [2024-11-19 06:16:08,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:08,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:16:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:16:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:16:08,447 INFO L87 Difference]: Start difference. First operand 319 states and 398 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:08,819 INFO L93 Difference]: Finished difference Result 334 states and 420 transitions. [2024-11-19 06:16:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:16:08,820 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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 125 [2024-11-19 06:16:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:08,821 INFO L225 Difference]: With dead ends: 334 [2024-11-19 06:16:08,821 INFO L226 Difference]: Without dead ends: 330 [2024-11-19 06:16:08,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:16:08,822 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 8 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:08,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1619 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:16:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-19 06:16:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-11-19 06:16:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 318 states have (on average 1.2610062893081762) internal successors, (401), 321 states have internal predecessors, (401), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2024-11-19 06:16:08,828 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 125 [2024-11-19 06:16:08,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:08,828 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2024-11-19 06:16:08,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2024-11-19 06:16:08,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 06:16:08,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:08,830 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] [2024-11-19 06:16:08,841 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 (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:16:09,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:09,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:09,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1989466845, now seen corresponding path program 2 times [2024-11-19 06:16:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:09,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186759072] [2024-11-19 06:16:09,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:16:09,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:09,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:09,033 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:09,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:16:09,279 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:16:09,279 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:09,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:16:09,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-19 06:16:09,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:09,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186759072] [2024-11-19 06:16:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186759072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:16:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066045213] [2024-11-19 06:16:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:09,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:16:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:16:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:09,312 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:09,383 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2024-11-19 06:16:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:16:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 134 [2024-11-19 06:16:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:09,385 INFO L225 Difference]: With dead ends: 334 [2024-11-19 06:16:09,385 INFO L226 Difference]: Without dead ends: 334 [2024-11-19 06:16:09,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:16:09,386 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 30 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:09,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 599 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:16:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-19 06:16:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-19 06:16:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.2067901234567902) internal successors, (391), 327 states have internal predecessors, (391), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 400 transitions. [2024-11-19 06:16:09,391 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 400 transitions. Word has length 134 [2024-11-19 06:16:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:09,391 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 400 transitions. [2024-11-19 06:16:09,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2024-11-19 06:16:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 06:16:09,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:09,393 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] [2024-11-19 06:16:09,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:16:09,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:09,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:09,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:09,594 INFO L85 PathProgramCache]: Analyzing trace with hash -639537001, now seen corresponding path program 1 times [2024-11-19 06:16:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517744854] [2024-11-19 06:16:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:09,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:09,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:09,597 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:09,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:16:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:10,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:16:10,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:10,140 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-19 06:16:10,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:10,547 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-19 06:16:10,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:10,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517744854] [2024-11-19 06:16:10,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517744854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:10,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:10,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:16:10,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309372478] [2024-11-19 06:16:10,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:10,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:16:10,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:10,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:16:10,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:16:10,549 INFO L87 Difference]: Start difference. First operand 334 states and 400 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:11,802 INFO L93 Difference]: Finished difference Result 358 states and 440 transitions. [2024-11-19 06:16:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:16:11,803 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134 [2024-11-19 06:16:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:11,804 INFO L225 Difference]: With dead ends: 358 [2024-11-19 06:16:11,804 INFO L226 Difference]: Without dead ends: 354 [2024-11-19 06:16:11,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:16:11,805 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 13 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:11,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2646 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:16:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-19 06:16:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-11-19 06:16:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.213450292397661) internal successors, (415), 345 states have internal predecessors, (415), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 424 transitions. [2024-11-19 06:16:11,813 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 424 transitions. Word has length 134 [2024-11-19 06:16:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:11,813 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 424 transitions. [2024-11-19 06:16:11,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 424 transitions. [2024-11-19 06:16:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 06:16:11,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:11,816 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] [2024-11-19 06:16:11,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:16:12,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:12,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:12,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash -747182601, now seen corresponding path program 2 times [2024-11-19 06:16:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:12,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239396233] [2024-11-19 06:16:12,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:16:12,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:12,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:12,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:12,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:16:12,313 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:16:12,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:12,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:16:12,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-19 06:16:12,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:12,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239396233] [2024-11-19 06:16:12,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239396233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:12,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:12,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:16:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721147734] [2024-11-19 06:16:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:12,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:16:12,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:12,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:16:12,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:16:12,335 INFO L87 Difference]: Start difference. First operand 352 states and 424 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:12,377 INFO L93 Difference]: Finished difference Result 352 states and 418 transitions. [2024-11-19 06:16:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:16:12,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 152 [2024-11-19 06:16:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:12,379 INFO L225 Difference]: With dead ends: 352 [2024-11-19 06:16:12,379 INFO L226 Difference]: Without dead ends: 352 [2024-11-19 06:16:12,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:16:12,380 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:12,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:16:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-19 06:16:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-11-19 06:16:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.195906432748538) internal successors, (409), 345 states have internal predecessors, (409), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 418 transitions. [2024-11-19 06:16:12,386 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 418 transitions. Word has length 152 [2024-11-19 06:16:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 418 transitions. [2024-11-19 06:16:12,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 418 transitions. [2024-11-19 06:16:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 06:16:12,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:12,388 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] [2024-11-19 06:16:12,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:16:12,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:12,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:12,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash 273885753, now seen corresponding path program 1 times [2024-11-19 06:16:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10089400] [2024-11-19 06:16:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:12,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:12,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:12,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:12,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:16:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:13,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:16:13,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:13,546 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-19 06:16:13,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:14,762 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-19 06:16:14,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:14,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10089400] [2024-11-19 06:16:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10089400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:14,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:16:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273473505] [2024-11-19 06:16:14,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:14,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:16:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:16:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:16:14,765 INFO L87 Difference]: Start difference. First operand 352 states and 418 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:19,393 INFO L93 Difference]: Finished difference Result 392 states and 490 transitions. [2024-11-19 06:16:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:16:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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 152 [2024-11-19 06:16:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:19,395 INFO L225 Difference]: With dead ends: 392 [2024-11-19 06:16:19,395 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 06:16:19,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:16:19,397 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 26 mSDsluCounter, 5498 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:19,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5720 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 06:16:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 06:16:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-11-19 06:16:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 376 states have (on average 1.2101063829787233) internal successors, (455), 379 states have internal predecessors, (455), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 464 transitions. [2024-11-19 06:16:19,403 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 464 transitions. Word has length 152 [2024-11-19 06:16:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:19,403 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 464 transitions. [2024-11-19 06:16:19,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:16:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 464 transitions. [2024-11-19 06:16:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 06:16:19,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:19,404 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] [2024-11-19 06:16:19,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:16:19,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:19,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash 94876633, now seen corresponding path program 2 times [2024-11-19 06:16:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:19,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647659045] [2024-11-19 06:16:19,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:16:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:19,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:19,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:16:20,602 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:16:20,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:20,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:16:20,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:21,013 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-19 06:16:21,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:22,317 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-19 06:16:22,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647659045] [2024-11-19 06:16:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647659045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:22,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:16:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012677674] [2024-11-19 06:16:22,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:22,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:16:22,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:16:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:16:22,320 INFO L87 Difference]: Start difference. First operand 386 states and 464 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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-19 06:16:26,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:26,879 INFO L93 Difference]: Finished difference Result 415 states and 518 transitions. [2024-11-19 06:16:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:16:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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 186 [2024-11-19 06:16:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:26,882 INFO L225 Difference]: With dead ends: 415 [2024-11-19 06:16:26,882 INFO L226 Difference]: Without dead ends: 415 [2024-11-19 06:16:26,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-19 06:16:26,885 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 27 mSDsluCounter, 5477 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5698 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:26,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5698 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 06:16:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-19 06:16:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2024-11-19 06:16:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 401 states have (on average 1.259351620947631) internal successors, (505), 404 states have internal predecessors, (505), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 514 transitions. [2024-11-19 06:16:26,892 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 514 transitions. Word has length 186 [2024-11-19 06:16:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:26,892 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 514 transitions. [2024-11-19 06:16:26,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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-19 06:16:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 514 transitions. [2024-11-19 06:16:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-19 06:16:26,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:26,894 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] [2024-11-19 06:16:26,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:16:27,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:27,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:27,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash -402225536, now seen corresponding path program 3 times [2024-11-19 06:16:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:27,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847834083] [2024-11-19 06:16:27,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:16:27,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:27,100 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:27,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 (15)] Waiting until timeout for monitored process [2024-11-19 06:16:27,628 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:16:27,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:16:27,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:16:27,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-19 06:16:27,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:16:27,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:27,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847834083] [2024-11-19 06:16:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847834083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:16:27,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:16:27,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:16:27,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463148236] [2024-11-19 06:16:27,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:16:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:16:27,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:27,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:16:27,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:16:27,811 INFO L87 Difference]: Start difference. First operand 411 states and 514 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:32,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:16:36,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:16:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:16:37,843 INFO L93 Difference]: Finished difference Result 502 states and 621 transitions. [2024-11-19 06:16:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:16:37,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 211 [2024-11-19 06:16:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:16:37,846 INFO L225 Difference]: With dead ends: 502 [2024-11-19 06:16:37,846 INFO L226 Difference]: Without dead ends: 502 [2024-11-19 06:16:37,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:16:37,847 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 396 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:16:37,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 387 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2024-11-19 06:16:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-19 06:16:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-11-19 06:16:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 489 states have (on average 1.2453987730061349) internal successors, (609), 492 states have internal predecessors, (609), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:16:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 618 transitions. [2024-11-19 06:16:37,858 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 618 transitions. Word has length 211 [2024-11-19 06:16:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:16:37,858 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 618 transitions. [2024-11-19 06:16:37,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:16:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 618 transitions. [2024-11-19 06:16:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-19 06:16:37,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:16:37,860 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] [2024-11-19 06:16:37,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:16:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:38,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:16:38,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:16:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1038220470, now seen corresponding path program 1 times [2024-11-19 06:16:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:16:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011260005] [2024-11-19 06:16:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:16:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:16:38,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:16:38,063 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:16:38,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:16:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:16:39,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:16:39,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:16:40,772 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-19 06:16:40,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:16:45,374 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-19 06:16:45,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:16:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011260005] [2024-11-19 06:16:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011260005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:16:45,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:16:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:16:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627007564] [2024-11-19 06:16:45,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:16:45,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:16:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:16:45,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:16:45,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:16:45,378 INFO L87 Difference]: Start difference. First operand 499 states and 618 transitions. Second operand has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 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-19 06:17:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:17:10,440 INFO L93 Difference]: Finished difference Result 557 states and 729 transitions. [2024-11-19 06:17:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-19 06:17:10,441 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 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 219 [2024-11-19 06:17:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:17:10,443 INFO L225 Difference]: With dead ends: 557 [2024-11-19 06:17:10,443 INFO L226 Difference]: Without dead ends: 557 [2024-11-19 06:17:10,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-11-19 06:17:10,451 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 106 mSDsluCounter, 10951 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 11172 SdHoareTripleChecker+Invalid, 5316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:17:10,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 11172 Invalid, 5316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 06:17:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-19 06:17:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2024-11-19 06:17:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 543 states have (on average 1.3186003683241252) internal successors, (716), 546 states have internal predecessors, (716), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:17:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 725 transitions. [2024-11-19 06:17:10,458 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 725 transitions. Word has length 219 [2024-11-19 06:17:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:17:10,458 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 725 transitions. [2024-11-19 06:17:10,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 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-19 06:17:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 725 transitions. [2024-11-19 06:17:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-19 06:17:10,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:17:10,461 INFO L215 NwaCegarLoop]: trace histogram [142, 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] [2024-11-19 06:17:10,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:17:10,661 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-19 06:17:10,661 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:17:10,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:17:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1417198230, now seen corresponding path program 2 times [2024-11-19 06:17:10,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:17:10,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270144458] [2024-11-19 06:17:10,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:17:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:17:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:17:10,664 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-19 06:17:10,665 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-19 06:17:12,516 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:17:12,516 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:17:12,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 2112 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-19 06:17:12,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:17:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10301 backedges. 4459 proven. 4851 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:17:17,364 INFO L311 TraceCheckSpWp]: Computing backward predicates...