./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:58:08,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:58:08,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-16 23:58:08,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:58:08,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:58:08,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:58:08,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:58:08,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:58:08,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:58:08,319 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:58:08,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:58:08,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:58:08,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:58:08,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:58:08,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:58:08,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:58:08,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:58:08,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:58:08,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:58:08,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:58:08,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:58:08,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:58:08,323 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:58:08,323 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:58:08,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:58:08,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:58:08,324 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:58:08,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:58:08,324 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:58:08,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:58:08,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:58:08,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:58:08,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:58:08,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:58:08,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:58:08,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:58:08,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:58:08,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:58:08,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:58:08,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:58:08,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:58:08,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:58:08,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:58:08,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:58:08,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:58:08,335 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-16 23:58:08,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:58:08,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:58:08,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:58:08,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:58:08,578 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:58:08,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-16 23:58:09,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:58:10,236 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:58:10,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-16 23:58:10,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f62d60b8/d6e582b1c3704b8aab64171c65074cdd/FLAG2aa7950a7 [2024-11-16 23:58:10,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f62d60b8/d6e582b1c3704b8aab64171c65074cdd [2024-11-16 23:58:10,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:58:10,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:58:10,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:58:10,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:58:10,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:58:10,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:10" (1/1) ... [2024-11-16 23:58:10,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10cb5fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:10, skipping insertion in model container [2024-11-16 23:58:10,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:10" (1/1) ... [2024-11-16 23:58:10,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:58:10,961 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:10,996 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,001 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,003 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,010 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,045 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,045 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,048 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,050 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,051 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,051 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,052 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,055 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:11,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:58:11,076 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-16 23:58:11,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f6b70c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:11, skipping insertion in model container [2024-11-16 23:58:11,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:58:11,077 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-16 23:58:11,079 INFO L158 Benchmark]: Toolchain (without parser) took 548.76ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 69.4MB in the beginning and 163.4MB in the end (delta: -94.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-16 23:58:11,080 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:58:11,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.00ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 69.2MB in the beginning and 163.4MB in the end (delta: -94.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-16 23:58:11,082 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.00ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 69.2MB in the beginning and 163.4MB in the end (delta: -94.2MB). Peak memory consumption was 12.5MB. 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_BER_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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:58:12,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:58:12,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-16 23:58:12,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:58:12,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:58:12,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:58:12,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:58:12,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:58:12,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:58:12,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:58:12,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:58:12,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:58:12,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:58:12,955 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:58:12,956 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:58:12,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:58:12,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:58:12,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:58:12,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:58:12,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:58:12,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:58:12,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:58:12,959 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:58:12,960 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:58:12,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:58:12,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:58:12,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:58:12,960 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 23:58:12,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:58:12,961 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 23:58:12,961 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:58:12,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:58:12,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:58:12,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:58:12,961 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:58:12,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:58:12,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:58:12,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:58:12,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:58:12,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:58:12,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:58:12,963 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 23:58:12,964 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 23:58:12,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:58:12,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:58:12,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:58:12,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:58:12,964 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-16 23:58:13,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:58:13,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:58:13,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:58:13,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:58:13,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:58:13,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-16 23:58:14,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:58:14,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:58:14,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-16 23:58:14,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d6597ee/9df519a904e346a5a2d558d866368f82/FLAG6c955182e [2024-11-16 23:58:14,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8d6597ee/9df519a904e346a5a2d558d866368f82 [2024-11-16 23:58:14,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:58:14,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:58:14,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:58:14,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:58:14,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:58:14,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:14" (1/1) ... [2024-11-16 23:58:14,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3eab4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:14, skipping insertion in model container [2024-11-16 23:58:14,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:58:14" (1/1) ... [2024-11-16 23:58:15,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:58:15,324 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,346 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,349 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,351 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,359 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,389 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,390 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,391 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,391 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,393 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,394 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,395 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,396 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,398 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:58:15,411 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-16 23:58:15,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:58:15,447 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,457 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,459 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,460 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,463 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,482 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,482 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,486 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,486 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,487 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,487 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,489 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:58:15,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:58:15,499 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:58:15,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:58:15,660 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:58:15,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15 WrapperNode [2024-11-16 23:58:15,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:58:15,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:58:15,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:58:15,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:58:15,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,752 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 983 [2024-11-16 23:58:15,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:58:15,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:58:15,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:58:15,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:58:15,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,836 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 217, 34]. 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, 50, 4]. [2024-11-16 23:58:15,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:58:15,905 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:58:15,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:58:15,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:58:15,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (1/1) ... [2024-11-16 23:58:15,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:58:15,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:58:15,938 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-16 23:58:15,943 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-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-16 23:58:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 23:58:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 23:58:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 23:58:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 23:58:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 23:58:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 23:58:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:58:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:58:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 23:58:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 23:58:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 23:58:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:58:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 23:58:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 23:58:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 23:58:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:58:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 23:58:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 23:58:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 23:58:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 23:58:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 23:58:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 23:58:15,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:58:15,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:58:16,208 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:58:16,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:58:23,212 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 23:58:23,261 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-16 23:58:23,261 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:58:23,272 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:58:23,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:58:23,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:58:23 BoogieIcfgContainer [2024-11-16 23:58:23,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:58:23,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:58:23,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:58:23,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:58:23,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:58:14" (1/3) ... [2024-11-16 23:58:23,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfbf723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:58:23, skipping insertion in model container [2024-11-16 23:58:23,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:58:15" (2/3) ... [2024-11-16 23:58:23,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfbf723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:58:23, skipping insertion in model container [2024-11-16 23:58:23,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:58:23" (3/3) ... [2024-11-16 23:58:23,280 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2024-11-16 23:58:23,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:58:23,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 23:58:23,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:58:23,355 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;@3baa44b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:58:23,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 23:58:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 194 states have (on average 1.6443298969072164) internal successors, (319), 197 states have internal predecessors, (319), 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-16 23:58:23,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 23:58:23,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:23,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:23,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:23,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 20540130, now seen corresponding path program 1 times [2024-11-16 23:58:23,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:23,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493009490] [2024-11-16 23:58:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:23,380 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-16 23:58:23,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:23,382 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-16 23:58:23,415 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-16 23:58:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:23,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 23:58:23,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:23,551 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-16 23:58:23,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:23,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:23,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493009490] [2024-11-16 23:58:23,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493009490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:23,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:23,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:58:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602496811] [2024-11-16 23:58:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:23,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:58:23,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:58:23,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:58:23,578 INFO L87 Difference]: Start difference. First operand has 204 states, 194 states have (on average 1.6443298969072164) internal successors, (319), 197 states have internal predecessors, (319), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:58:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:23,599 INFO L93 Difference]: Finished difference Result 201 states and 256 transitions. [2024-11-16 23:58:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:58:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-16 23:58:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:23,608 INFO L225 Difference]: With dead ends: 201 [2024-11-16 23:58:23,608 INFO L226 Difference]: Without dead ends: 198 [2024-11-16 23:58:23,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:58:23,612 INFO L432 NwaCegarLoop]: 256 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, 256 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-16 23:58:23,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:58:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-16 23:58:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-16 23:58:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 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-16 23:58:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 253 transitions. [2024-11-16 23:58:23,660 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 253 transitions. Word has length 11 [2024-11-16 23:58:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:23,661 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 253 transitions. [2024-11-16 23:58:23,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:58:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 253 transitions. [2024-11-16 23:58:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 23:58:23,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:23,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:23,667 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-16 23:58:23,862 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-16 23:58:23,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:23,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:23,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1619080756, now seen corresponding path program 1 times [2024-11-16 23:58:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:23,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715156357] [2024-11-16 23:58:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:23,865 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-16 23:58:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:23,866 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-16 23:58:23,867 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-16 23:58:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:23,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:58:23,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:24,063 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-16 23:58:24,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:24,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:24,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715156357] [2024-11-16 23:58:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715156357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:24,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:24,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:24,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005878092] [2024-11-16 23:58:24,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:24,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:24,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:24,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:24,066 INFO L87 Difference]: Start difference. First operand 198 states and 253 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:58:28,293 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-16 23:58:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:29,788 INFO L93 Difference]: Finished difference Result 313 states and 403 transitions. [2024-11-16 23:58:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:58:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 23:58:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:29,792 INFO L225 Difference]: With dead ends: 313 [2024-11-16 23:58:29,792 INFO L226 Difference]: Without dead ends: 313 [2024-11-16 23:58:29,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-16 23:58:29,793 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:29,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 680 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-16 23:58:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-16 23:58:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2024-11-16 23:58:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 303 states have (on average 1.297029702970297) internal successors, (393), 305 states have internal predecessors, (393), 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-16 23:58:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 401 transitions. [2024-11-16 23:58:29,840 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 401 transitions. Word has length 13 [2024-11-16 23:58:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:29,841 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 401 transitions. [2024-11-16 23:58:29,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:58:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 401 transitions. [2024-11-16 23:58:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 23:58:29,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:29,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:29,851 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 (3)] Forceful destruction successful, exit code 0 [2024-11-16 23:58:30,047 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-16 23:58:30,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:30,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1618741107, now seen corresponding path program 1 times [2024-11-16 23:58:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761107405] [2024-11-16 23:58:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:30,052 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-16 23:58:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:30,056 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-16 23:58:30,058 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-16 23:58:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:30,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:58:30,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:30,212 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:58:30,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:58:30,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:58:30,224 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-16 23:58:30,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:58:30,287 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-16 23:58:30,298 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-16 23:58:30,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:30,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:30,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761107405] [2024-11-16 23:58:30,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761107405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:30,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:30,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592297773] [2024-11-16 23:58:30,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:30,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:30,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:30,301 INFO L87 Difference]: Start difference. First operand 311 states and 401 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 23:58:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:30,716 INFO L93 Difference]: Finished difference Result 478 states and 619 transitions. [2024-11-16 23:58:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:58:30,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-16 23:58:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:30,719 INFO L225 Difference]: With dead ends: 478 [2024-11-16 23:58:30,719 INFO L226 Difference]: Without dead ends: 478 [2024-11-16 23:58:30,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:58:30,720 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 227 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 747 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:30,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 747 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 23:58:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-16 23:58:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 310. [2024-11-16 23:58:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 302 states have (on average 1.294701986754967) internal successors, (391), 304 states have internal predecessors, (391), 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-16 23:58:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 399 transitions. [2024-11-16 23:58:30,731 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 399 transitions. Word has length 13 [2024-11-16 23:58:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:30,731 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 399 transitions. [2024-11-16 23:58:30,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 23:58:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 399 transitions. [2024-11-16 23:58:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 23:58:30,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:30,733 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:30,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 23:58:30,934 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-16 23:58:30,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:30,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash -833514811, now seen corresponding path program 1 times [2024-11-16 23:58:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:30,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345841281] [2024-11-16 23:58:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:30,935 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-16 23:58:30,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:30,938 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-16 23:58:30,939 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-16 23:58:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:31,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:58:31,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:58:31,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:31,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:31,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345841281] [2024-11-16 23:58:31,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345841281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:31,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:31,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:31,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702981409] [2024-11-16 23:58:31,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:31,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:31,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:31,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:31,347 INFO L87 Difference]: Start difference. First operand 310 states and 399 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:58:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:31,443 INFO L93 Difference]: Finished difference Result 316 states and 389 transitions. [2024-11-16 23:58:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:58:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-16 23:58:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:31,444 INFO L225 Difference]: With dead ends: 316 [2024-11-16 23:58:31,444 INFO L226 Difference]: Without dead ends: 316 [2024-11-16 23:58:31,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 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-16 23:58:31,445 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 30 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:31,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 647 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:58:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-16 23:58:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-16 23:58:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 308 states have (on average 1.2370129870129871) internal successors, (381), 310 states have internal predecessors, (381), 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-16 23:58:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 389 transitions. [2024-11-16 23:58:31,453 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 389 transitions. Word has length 85 [2024-11-16 23:58:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:31,454 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 389 transitions. [2024-11-16 23:58:31,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:58:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 389 transitions. [2024-11-16 23:58:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 23:58:31,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:31,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:31,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 23:58:31,656 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-16 23:58:31,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:31,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash -828668275, now seen corresponding path program 1 times [2024-11-16 23:58:31,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:31,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890202266] [2024-11-16 23:58:31,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:31,658 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-16 23:58:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:31,659 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-16 23:58:31,661 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-16 23:58:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:32,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:58:32,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:58:32,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:32,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890202266] [2024-11-16 23:58:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890202266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:32,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:32,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:58:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744098186] [2024-11-16 23:58:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:32,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:58:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:58:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:58:32,114 INFO L87 Difference]: Start difference. First operand 316 states and 389 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:58:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:32,192 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2024-11-16 23:58:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:58:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-16 23:58:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:32,194 INFO L225 Difference]: With dead ends: 304 [2024-11-16 23:58:32,194 INFO L226 Difference]: Without dead ends: 304 [2024-11-16 23:58:32,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:58:32,195 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 3 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:32,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 647 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:58:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-16 23:58:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-16 23:58:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 296 states have (on average 1.2195945945945945) internal successors, (361), 298 states have internal predecessors, (361), 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-16 23:58:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 369 transitions. [2024-11-16 23:58:32,201 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 369 transitions. Word has length 85 [2024-11-16 23:58:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:32,201 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 369 transitions. [2024-11-16 23:58:32,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 23:58:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 369 transitions. [2024-11-16 23:58:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 23:58:32,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:32,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:32,212 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-16 23:58:32,407 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-16 23:58:32,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:32,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:32,409 INFO L85 PathProgramCache]: Analyzing trace with hash 403472331, now seen corresponding path program 1 times [2024-11-16 23:58:32,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:32,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678676720] [2024-11-16 23:58:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:32,410 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-16 23:58:32,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:32,412 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-16 23:58:32,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 23:58:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:32,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:58:32,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:32,812 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-16 23:58:32,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:32,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678676720] [2024-11-16 23:58:32,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678676720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503021231] [2024-11-16 23:58:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:32,814 INFO L87 Difference]: Start difference. First operand 304 states and 369 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 23:58:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:32,853 INFO L93 Difference]: Finished difference Result 307 states and 373 transitions. [2024-11-16 23:58:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:58:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2024-11-16 23:58:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:32,856 INFO L225 Difference]: With dead ends: 307 [2024-11-16 23:58:32,856 INFO L226 Difference]: Without dead ends: 307 [2024-11-16 23:58:32,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 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-16 23:58:32,857 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 701 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-16 23:58:32,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 701 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:58:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-16 23:58:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-16 23:58:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 298 states have (on average 1.221476510067114) internal successors, (364), 301 states have internal predecessors, (364), 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-16 23:58:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 373 transitions. [2024-11-16 23:58:32,863 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 373 transitions. Word has length 85 [2024-11-16 23:58:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:32,863 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 373 transitions. [2024-11-16 23:58:32,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 23:58:32,864 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 373 transitions. [2024-11-16 23:58:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-16 23:58:32,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:32,870 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:32,888 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 (7)] Forceful destruction successful, exit code 0 [2024-11-16 23:58:33,071 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-16 23:58:33,071 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:33,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1795116591, now seen corresponding path program 1 times [2024-11-16 23:58:33,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623294468] [2024-11-16 23:58:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:33,073 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-16 23:58:33,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:33,077 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-16 23:58:33,078 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-16 23:58:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:33,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:58:33,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:33,483 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-16 23:58:33,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:33,560 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-16 23:58:33,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:33,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623294468] [2024-11-16 23:58:33,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623294468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:33,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:33,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 23:58:33,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828947931] [2024-11-16 23:58:33,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:33,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:58:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:58:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:58:33,562 INFO L87 Difference]: Start difference. First operand 307 states and 373 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-16 23:58:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:33,690 INFO L93 Difference]: Finished difference Result 318 states and 389 transitions. [2024-11-16 23:58:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:58:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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 87 [2024-11-16 23:58:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:33,692 INFO L225 Difference]: With dead ends: 318 [2024-11-16 23:58:33,693 INFO L226 Difference]: Without dead ends: 318 [2024-11-16 23:58:33,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 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-16 23:58:33,693 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 4 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:33,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1394 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:58:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-16 23:58:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2024-11-16 23:58:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 306 states have (on average 1.2352941176470589) internal successors, (378), 309 states have internal predecessors, (378), 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-16 23:58:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 387 transitions. [2024-11-16 23:58:33,699 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 387 transitions. Word has length 87 [2024-11-16 23:58:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:33,699 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 387 transitions. [2024-11-16 23:58:33,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-16 23:58:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 387 transitions. [2024-11-16 23:58:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 23:58:33,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:33,700 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] [2024-11-16 23:58:33,713 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-16 23:58:33,901 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-16 23:58:33,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:33,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1385133269, now seen corresponding path program 2 times [2024-11-16 23:58:33,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650503783] [2024-11-16 23:58:33,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:58:33,903 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-16 23:58:33,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:33,905 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-16 23:58:33,906 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-16 23:58:34,146 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 23:58:34,146 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:34,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 23:58:34,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:34,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:58:34,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:58:34,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:58:34,162 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-16 23:58:34,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:58:34,197 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-16 23:58:34,208 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-16 23:58:34,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:34,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650503783] [2024-11-16 23:58:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650503783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:34,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250886076] [2024-11-16 23:58:34,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:34,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:34,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:34,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:34,210 INFO L87 Difference]: Start difference. First operand 316 states and 387 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-16 23:58:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:34,762 INFO L93 Difference]: Finished difference Result 479 states and 601 transitions. [2024-11-16 23:58:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:58:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 91 [2024-11-16 23:58:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:34,766 INFO L225 Difference]: With dead ends: 479 [2024-11-16 23:58:34,766 INFO L226 Difference]: Without dead ends: 479 [2024-11-16 23:58:34,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-16 23:58:34,767 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 207 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 649 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.5s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:34,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 649 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 23:58:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-16 23:58:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 318. [2024-11-16 23:58:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 308 states have (on average 1.2337662337662338) internal successors, (380), 311 states have internal predecessors, (380), 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-16 23:58:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 389 transitions. [2024-11-16 23:58:34,785 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 389 transitions. Word has length 91 [2024-11-16 23:58:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:34,785 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 389 transitions. [2024-11-16 23:58:34,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-16 23:58:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 389 transitions. [2024-11-16 23:58:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 23:58:34,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:34,787 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, 1, 1] [2024-11-16 23:58:34,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-16 23:58:34,987 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-16 23:58:34,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:34,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:34,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1943865020, now seen corresponding path program 1 times [2024-11-16 23:58:34,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:34,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217048248] [2024-11-16 23:58:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:34,990 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-16 23:58:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:34,991 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-16 23:58:34,994 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-16 23:58:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:35,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 23:58:35,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:35,495 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-16 23:58:35,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:35,660 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-16 23:58:35,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217048248] [2024-11-16 23:58:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217048248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:35,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-16 23:58:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753221369] [2024-11-16 23:58:35,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:35,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 23:58:35,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:35,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 23:58:35,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-16 23:58:35,662 INFO L87 Difference]: Start difference. First operand 318 states and 389 transitions. Second operand has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 23:58:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:36,165 INFO L93 Difference]: Finished difference Result 333 states and 411 transitions. [2024-11-16 23:58:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 23:58:36,166 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 127 [2024-11-16 23:58:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:36,167 INFO L225 Difference]: With dead ends: 333 [2024-11-16 23:58:36,167 INFO L226 Difference]: Without dead ends: 329 [2024-11-16 23:58:36,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-16 23:58:36,168 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 7 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:36,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1633 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 23:58:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-16 23:58:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2024-11-16 23:58:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 317 states have (on average 1.2365930599369086) internal successors, (392), 320 states have internal predecessors, (392), 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-16 23:58:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 401 transitions. [2024-11-16 23:58:36,174 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 401 transitions. Word has length 127 [2024-11-16 23:58:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:36,174 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 401 transitions. [2024-11-16 23:58:36,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 23:58:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 401 transitions. [2024-11-16 23:58:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 23:58:36,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:36,176 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:36,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-16 23:58:36,379 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-16 23:58:36,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:36,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2036111267, now seen corresponding path program 2 times [2024-11-16 23:58:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862065603] [2024-11-16 23:58:36,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:58:36,381 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-16 23:58:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:36,382 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-16 23:58:36,383 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-16 23:58:36,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 23:58:36,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:36,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:58:36,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:36,698 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-16 23:58:36,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:36,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862065603] [2024-11-16 23:58:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862065603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:36,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:36,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178699656] [2024-11-16 23:58:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:36,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:36,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:36,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:36,700 INFO L87 Difference]: Start difference. First operand 327 states and 401 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-16 23:58:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:36,827 INFO L93 Difference]: Finished difference Result 333 states and 391 transitions. [2024-11-16 23:58:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:58:36,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 136 [2024-11-16 23:58:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:36,829 INFO L225 Difference]: With dead ends: 333 [2024-11-16 23:58:36,829 INFO L226 Difference]: Without dead ends: 333 [2024-11-16 23:58:36,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 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-16 23:58:36,830 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 30 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 604 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-16 23:58:36,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 604 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:58:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-16 23:58:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2024-11-16 23:58:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.1826625386996905) internal successors, (382), 326 states have internal predecessors, (382), 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-16 23:58:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 391 transitions. [2024-11-16 23:58:36,835 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 391 transitions. Word has length 136 [2024-11-16 23:58:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:36,836 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 391 transitions. [2024-11-16 23:58:36,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-16 23:58:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 391 transitions. [2024-11-16 23:58:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 23:58:36,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:36,837 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:36,845 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-16 23:58:37,040 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-16 23:58:37,041 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:37,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1349830218, now seen corresponding path program 1 times [2024-11-16 23:58:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:37,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492099689] [2024-11-16 23:58:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:37,043 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-16 23:58:37,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:37,044 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-16 23:58:37,046 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-16 23:58:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:37,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 23:58:37,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:37,942 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-16 23:58:37,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:38,624 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-16 23:58:38,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492099689] [2024-11-16 23:58:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492099689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:38,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:38,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-16 23:58:38,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890816159] [2024-11-16 23:58:38,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:38,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 23:58:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:38,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 23:58:38,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-16 23:58:38,631 INFO L87 Difference]: Start difference. First operand 333 states and 391 transitions. Second operand has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 26 states have internal predecessors, (144), 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-16 23:58:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:40,285 INFO L93 Difference]: Finished difference Result 357 states and 431 transitions. [2024-11-16 23:58:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-16 23:58:40,285 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 26 states have internal predecessors, (144), 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 136 [2024-11-16 23:58:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:40,287 INFO L225 Difference]: With dead ends: 357 [2024-11-16 23:58:40,287 INFO L226 Difference]: Without dead ends: 353 [2024-11-16 23:58:40,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 23:58:40,288 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 13 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:40,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2669 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 23:58:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-16 23:58:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2024-11-16 23:58:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 341 states have (on average 1.1906158357771262) internal successors, (406), 344 states have internal predecessors, (406), 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-16 23:58:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 415 transitions. [2024-11-16 23:58:40,295 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 415 transitions. Word has length 136 [2024-11-16 23:58:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:40,295 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 415 transitions. [2024-11-16 23:58:40,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 26 states have internal predecessors, (144), 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-16 23:58:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 415 transitions. [2024-11-16 23:58:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-16 23:58:40,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:40,297 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:40,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-16 23:58:40,501 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-16 23:58:40,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:40,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1559993238, now seen corresponding path program 2 times [2024-11-16 23:58:40,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:40,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72731257] [2024-11-16 23:58:40,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:58:40,503 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-16 23:58:40,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:40,505 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-16 23:58:40,514 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-16 23:58:41,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:58:41,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:41,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 23:58:41,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:41,626 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-16 23:58:41,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:43,202 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-16 23:58:43,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:43,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72731257] [2024-11-16 23:58:43,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72731257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:43,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:43,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-16 23:58:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599800668] [2024-11-16 23:58:43,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:43,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-16 23:58:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:43,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-16 23:58:43,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-16 23:58:43,206 INFO L87 Difference]: Start difference. First operand 351 states and 415 transitions. Second operand has 50 states, 50 states have (on average 3.36) internal successors, (168), 50 states have internal predecessors, (168), 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-16 23:58:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:48,965 INFO L93 Difference]: Finished difference Result 391 states and 487 transitions. [2024-11-16 23:58:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-16 23:58:48,966 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.36) internal successors, (168), 50 states have internal predecessors, (168), 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 154 [2024-11-16 23:58:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:48,967 INFO L225 Difference]: With dead ends: 391 [2024-11-16 23:58:48,967 INFO L226 Difference]: Without dead ends: 387 [2024-11-16 23:58:48,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-16 23:58:48,969 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 25 mSDsluCounter, 5329 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5553 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:48,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5553 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-16 23:58:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-16 23:58:48,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2024-11-16 23:58:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 375 states have (on average 1.2053333333333334) internal successors, (452), 378 states have internal predecessors, (452), 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-16 23:58:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 461 transitions. [2024-11-16 23:58:48,975 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 461 transitions. Word has length 154 [2024-11-16 23:58:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:48,975 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 461 transitions. [2024-11-16 23:58:48,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.36) internal successors, (168), 50 states have internal predecessors, (168), 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-16 23:58:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 461 transitions. [2024-11-16 23:58:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-16 23:58:48,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:48,976 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:48,994 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-16 23:58:49,180 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-16 23:58:49,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:49,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:49,182 INFO L85 PathProgramCache]: Analyzing trace with hash -775033098, now seen corresponding path program 3 times [2024-11-16 23:58:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63062074] [2024-11-16 23:58:49,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 23:58:49,183 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-16 23:58:49,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:49,186 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-16 23:58:49,188 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-16 23:58:49,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 23:58:49,690 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:49,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:58:49,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-16 23:58:49,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:49,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63062074] [2024-11-16 23:58:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63062074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693418952] [2024-11-16 23:58:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:49,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:49,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:49,952 INFO L87 Difference]: Start difference. First operand 385 states and 461 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-16 23:58:54,244 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-16 23:58:58,251 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-16 23:59:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:00,832 INFO L93 Difference]: Finished difference Result 479 states and 574 transitions. [2024-11-16 23:59:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:59:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 188 [2024-11-16 23:59:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:00,837 INFO L225 Difference]: With dead ends: 479 [2024-11-16 23:59:00,837 INFO L226 Difference]: Without dead ends: 479 [2024-11-16 23:59:00,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 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-16 23:59:00,837 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 397 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 386 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.9s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:00,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 386 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2024-11-16 23:59:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-16 23:59:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2024-11-16 23:59:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 466 states have (on average 1.206008583690987) internal successors, (562), 469 states have internal predecessors, (562), 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-16 23:59:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 571 transitions. [2024-11-16 23:59:00,844 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 571 transitions. Word has length 188 [2024-11-16 23:59:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:00,844 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 571 transitions. [2024-11-16 23:59:00,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-16 23:59:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 571 transitions. [2024-11-16 23:59:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-16 23:59:00,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:00,846 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:59:00,861 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-16 23:59:01,046 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-16 23:59:01,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:01,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash -135248938, now seen corresponding path program 1 times [2024-11-16 23:59:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:01,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932473140] [2024-11-16 23:59:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:59:01,048 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-16 23:59:01,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:01,053 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-16 23:59:01,053 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-16 23:59:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:59:02,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 23:59:02,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:02,988 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-16 23:59:02,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:59:06,062 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-16 23:59:06,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:06,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932473140] [2024-11-16 23:59:06,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932473140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:59:06,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:59:06,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-16 23:59:06,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201758229] [2024-11-16 23:59:06,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:59:06,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-16 23:59:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:06,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-16 23:59:06,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 23:59:06,066 INFO L87 Difference]: Start difference. First operand 476 states and 571 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 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-16 23:59:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:59:14,555 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2024-11-16 23:59:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-16 23:59:14,556 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 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 197 [2024-11-16 23:59:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:59:14,558 INFO L225 Difference]: With dead ends: 505 [2024-11-16 23:59:14,558 INFO L226 Difference]: Without dead ends: 505 [2024-11-16 23:59:14,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-16 23:59:14,560 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 27 mSDsluCounter, 5967 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6190 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-16 23:59:14,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6190 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-16 23:59:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-16 23:59:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501. [2024-11-16 23:59:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 491 states have (on average 1.2464358452138493) internal successors, (612), 494 states have internal predecessors, (612), 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-16 23:59:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 621 transitions. [2024-11-16 23:59:14,567 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 621 transitions. Word has length 197 [2024-11-16 23:59:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:59:14,567 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 621 transitions. [2024-11-16 23:59:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 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-16 23:59:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 621 transitions. [2024-11-16 23:59:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-16 23:59:14,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:59:14,569 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:59:14,592 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-16 23:59:14,773 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-16 23:59:14,774 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:59:14,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:59:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2041117239, now seen corresponding path program 2 times [2024-11-16 23:59:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:59:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092681895] [2024-11-16 23:59:14,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:59:14,775 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-16 23:59:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:59:14,778 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-16 23:59:14,779 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-16 23:59:16,518 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:59:16,518 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:59:16,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-16 23:59:16,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:59:18,544 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-16 23:59:18,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:59:27,086 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-16 23:59:27,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092681895] [2024-11-16 23:59:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092681895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:59:27,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:59:27,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-16 23:59:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563636297] [2024-11-16 23:59:27,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:59:27,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-16 23:59:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:27,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-16 23:59:27,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-16 23:59:27,099 INFO L87 Difference]: Start difference. First operand 501 states and 621 transitions. Second operand has 102 states, 102 states have (on average 2.2058823529411766) internal successors, (225), 102 states have internal predecessors, (225), 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)