./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:25:08,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:25:08,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:25:08,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:25:08,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:25:08,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:25:08,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:25:08,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:25:08,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:25:08,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:25:08,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:25:08,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:25:08,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:25:08,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:25:08,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:25:08,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:25:08,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:25:08,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:25:08,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:25:08,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:25:08,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:25:08,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:25:08,575 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:25:08,575 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:25:08,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:25:08,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:25:08,576 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:25:08,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:25:08,576 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:25:08,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:25:08,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:25:08,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:25:08,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:25:08,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:25:08,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:25:08,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:25:08,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:25:08,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:25:08,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:25:08,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:25:08,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:25:08,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:25:08,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:25:08,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:25:08,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:25:08,586 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-09 07:25:08,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:25:08,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:25:08,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:25:08,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:25:08,859 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:25:08,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-09 07:25:10,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:25:10,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:25:10,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-09 07:25:10,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7b6ecb9/784b8b851871498fa01b4ef61b1d6dfd/FLAG95786fb6a [2024-11-09 07:25:10,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7b6ecb9/784b8b851871498fa01b4ef61b1d6dfd [2024-11-09 07:25:10,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:25:10,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:25:10,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:25:10,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:25:10,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:25:10,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:25:10" (1/1) ... [2024-11-09 07:25:10,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e22969d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:10, skipping insertion in model container [2024-11-09 07:25:10,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:25:10" (1/1) ... [2024-11-09 07:25:10,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:25:11,126 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,165 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,172 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,176 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,189 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,224 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,225 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,227 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,227 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,229 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,231 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,234 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,239 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,244 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:11,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:25:11,265 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-09 07:25:11,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@36e5b3b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:11, skipping insertion in model container [2024-11-09 07:25:11,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:25:11,267 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:25:11,268 INFO L158 Benchmark]: Toolchain (without parser) took 665.13ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 64.8MB in the beginning and 159.7MB in the end (delta: -94.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-09 07:25:11,269 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:25:11,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.71ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 64.6MB in the beginning and 159.7MB in the end (delta: -95.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-09 07:25:11,271 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.13ms. Allocated memory is still 138.4MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.71ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 64.6MB in the beginning and 159.7MB in the end (delta: -95.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:25:13,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:25:13,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-09 07:25:13,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:25:13,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:25:13,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:25:13,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:25:13,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:25:13,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:25:13,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:25:13,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:25:13,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:25:13,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:25:13,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:25:13,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:25:13,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:25:13,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:25:13,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:25:13,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:25:13,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:25:13,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:25:13,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:25:13,347 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:25:13,347 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:25:13,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:25:13,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:25:13,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:25:13,348 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:25:13,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:25:13,349 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:25:13,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:25:13,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:25:13,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:25:13,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:25:13,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:25:13,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:25:13,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:25:13,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:25:13,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:25:13,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:25:13,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:25:13,352 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:25:13,352 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:25:13,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:25:13,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:25:13,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:25:13,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:25:13,353 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-09 07:25:13,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:25:13,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:25:13,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:25:13,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:25:13,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:25:13,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-09 07:25:15,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:25:15,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:25:15,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2024-11-09 07:25:15,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f50e0ac5/a31ce1ecd5364970a2af15d1196a3f75/FLAGe086714f2 [2024-11-09 07:25:15,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f50e0ac5/a31ce1ecd5364970a2af15d1196a3f75 [2024-11-09 07:25:15,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:25:15,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:25:15,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:25:15,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:25:15,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:25:15,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:25:15" (1/1) ... [2024-11-09 07:25:15,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289fb10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:15, skipping insertion in model container [2024-11-09 07:25:15,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:25:15" (1/1) ... [2024-11-09 07:25:15,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:25:16,217 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,251 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,260 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,266 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,272 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,306 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,306 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,319 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,319 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,323 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,324 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,325 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,326 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,329 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:25:16,343 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:25:16,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:25:16,389 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,401 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,403 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,405 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,409 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,434 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,438 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,442 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,445 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,447 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,448 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,448 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,449 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,451 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,453 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:25:16,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:25:16,466 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:25:16,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:25:16,628 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:25:16,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16 WrapperNode [2024-11-09 07:25:16,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:25:16,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:25:16,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:25:16,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:25:16,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,739 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1040 [2024-11-09 07:25:16,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:25:16,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:25:16,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:25:16,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:25:16,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,855 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 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-09 07:25:16,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:25:16,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:25:16,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:25:16,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:25:16,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (1/1) ... [2024-11-09 07:25:16,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:25:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:25:16,984 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-09 07:25:16,989 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-09 07:25:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:25:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:25:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:25:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:25:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:25:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:25:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 07:25:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 07:25:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 07:25:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 07:25:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 07:25:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 07:25:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:25:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:25:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:25:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:25:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:25:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:25:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:25:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:25:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:25:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:25:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:25:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:25:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:25:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:25:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:25:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:25:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:25:17,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:25:17,284 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:25:17,286 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:25:24,140 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-09 07:25:24,140 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:25:24,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:25:24,163 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 07:25:24,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:25:24 BoogieIcfgContainer [2024-11-09 07:25:24,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:25:24,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:25:24,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:25:24,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:25:24,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:25:15" (1/3) ... [2024-11-09 07:25:24,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689f5aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:25:24, skipping insertion in model container [2024-11-09 07:25:24,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:25:16" (2/3) ... [2024-11-09 07:25:24,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689f5aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:25:24, skipping insertion in model container [2024-11-09 07:25:24,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:25:24" (3/3) ... [2024-11-09 07:25:24,173 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-2.i [2024-11-09 07:25:24,190 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:25:24,190 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:25:24,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:25:24,249 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;@d36fe16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:25:24,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:25:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 196 states have internal predecessors, (322), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:25:24,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:24,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:25:24,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:24,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1665218, now seen corresponding path program 1 times [2024-11-09 07:25:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908231213] [2024-11-09 07:25:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:24,275 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-09 07:25:24,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:24,276 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-09 07:25:24,278 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-09 07:25:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:24,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:25:24,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:24,547 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_16| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16|)))) is different from true [2024-11-09 07:25:24,549 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-09 07:25:24,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:24,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908231213] [2024-11-09 07:25:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908231213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:25:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69822581] [2024-11-09 07:25:24,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:24,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:25:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:25:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:25:24,591 INFO L87 Difference]: Start difference. First operand has 201 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 196 states have internal predecessors, (322), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-09 07:25:28,783 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-09 07:25:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:29,144 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2024-11-09 07:25:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:25:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-09 07:25:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:29,168 INFO L225 Difference]: With dead ends: 299 [2024-11-09 07:25:29,168 INFO L226 Difference]: Without dead ends: 296 [2024-11-09 07:25:29,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:25:29,173 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 126 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:29,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 487 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 389 Unchecked, 4.5s Time] [2024-11-09 07:25:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-09 07:25:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 198. [2024-11-09 07:25:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.296875) internal successors, (249), 193 states have internal predecessors, (249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 255 transitions. [2024-11-09 07:25:29,221 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 255 transitions. Word has length 4 [2024-11-09 07:25:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:29,221 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 255 transitions. [2024-11-09 07:25:29,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-09 07:25:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 255 transitions. [2024-11-09 07:25:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:25:29,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:29,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:25:29,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 07:25:29,426 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-09 07:25:29,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1839730301, now seen corresponding path program 1 times [2024-11-09 07:25:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:29,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56390696] [2024-11-09 07:25:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:29,429 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-09 07:25:29,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:29,431 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-09 07:25:29,432 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-09 07:25:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:29,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:25:29,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:29,711 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-09 07:25:29,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:29,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56390696] [2024-11-09 07:25:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56390696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:29,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:29,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:25:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020285825] [2024-11-09 07:25:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:29,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:25:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:25:29,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:25:29,715 INFO L87 Difference]: Start difference. First operand 198 states and 255 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-09 07:25:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:30,390 INFO L93 Difference]: Finished difference Result 322 states and 414 transitions. [2024-11-09 07:25:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:25:30,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-09 07:25:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:30,393 INFO L225 Difference]: With dead ends: 322 [2024-11-09 07:25:30,393 INFO L226 Difference]: Without dead ends: 322 [2024-11-09 07:25:30,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:25:30,394 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 150 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:30,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 471 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:25:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-09 07:25:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2024-11-09 07:25:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.297872340425532) internal successors, (366), 283 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 372 transitions. [2024-11-09 07:25:30,410 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 372 transitions. Word has length 14 [2024-11-09 07:25:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:30,411 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 372 transitions. [2024-11-09 07:25:30,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-09 07:25:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 372 transitions. [2024-11-09 07:25:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:25:30,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:30,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:25:30,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 07:25:30,612 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-09 07:25:30,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:30,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1837883259, now seen corresponding path program 1 times [2024-11-09 07:25:30,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:30,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323422833] [2024-11-09 07:25:30,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:30,614 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-09 07:25:30,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:30,616 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-09 07:25:30,617 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-09 07:25:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:30,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:25:30,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:31,034 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_17| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17|)))) is different from true [2024-11-09 07:25:31,035 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-09 07:25:31,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:31,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323422833] [2024-11-09 07:25:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323422833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:31,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:31,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:25:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318715588] [2024-11-09 07:25:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:31,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:25:31,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:31,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:25:31,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:25:31,042 INFO L87 Difference]: Start difference. First operand 288 states and 372 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-09 07:25:35,250 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-09 07:25:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:36,045 INFO L93 Difference]: Finished difference Result 367 states and 472 transitions. [2024-11-09 07:25:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:25:36,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-09 07:25:36,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:36,054 INFO L225 Difference]: With dead ends: 367 [2024-11-09 07:25:36,054 INFO L226 Difference]: Without dead ends: 365 [2024-11-09 07:25:36,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:25:36,055 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 91 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:36,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 484 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 358 Unchecked, 5.0s Time] [2024-11-09 07:25:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-09 07:25:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2024-11-09 07:25:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 332 states have (on average 1.2951807228915662) internal successors, (430), 333 states have internal predecessors, (430), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 436 transitions. [2024-11-09 07:25:36,073 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 436 transitions. Word has length 14 [2024-11-09 07:25:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:36,074 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 436 transitions. [2024-11-09 07:25:36,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-09 07:25:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 436 transitions. [2024-11-09 07:25:36,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:25:36,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:36,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:25:36,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:25:36,275 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-09 07:25:36,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:36,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:36,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1271284979, now seen corresponding path program 1 times [2024-11-09 07:25:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:36,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236138568] [2024-11-09 07:25:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:36,278 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-09 07:25:36,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:36,281 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-09 07:25:36,282 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-09 07:25:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:36,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:25:36,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:25:36,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:36,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236138568] [2024-11-09 07:25:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236138568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:36,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:25:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569545530] [2024-11-09 07:25:36,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:36,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:25:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:36,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:25:36,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:25:36,588 INFO L87 Difference]: Start difference. First operand 338 states and 436 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-09 07:25:40,855 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-09 07:25:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:42,810 INFO L93 Difference]: Finished difference Result 374 states and 479 transitions. [2024-11-09 07:25:42,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:25:42,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-11-09 07:25:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:42,814 INFO L225 Difference]: With dead ends: 374 [2024-11-09 07:25:42,814 INFO L226 Difference]: Without dead ends: 370 [2024-11-09 07:25:42,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-09 07:25:42,815 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 152 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:42,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 743 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 07:25:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-09 07:25:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 336. [2024-11-09 07:25:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 330 states have (on average 1.293939393939394) internal successors, (427), 331 states have internal predecessors, (427), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 433 transitions. [2024-11-09 07:25:42,826 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 433 transitions. Word has length 24 [2024-11-09 07:25:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 433 transitions. [2024-11-09 07:25:42,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-09 07:25:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 433 transitions. [2024-11-09 07:25:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:25:42,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:42,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:25:42,834 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-09 07:25:43,032 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-09 07:25:43,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:43,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1931809730, now seen corresponding path program 1 times [2024-11-09 07:25:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323101274] [2024-11-09 07:25:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:43,034 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-09 07:25:43,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:43,036 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-09 07:25:43,036 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-09 07:25:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:43,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:25:43,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:43,248 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-09 07:25:43,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:43,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323101274] [2024-11-09 07:25:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323101274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:43,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:25:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211982158] [2024-11-09 07:25:43,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:43,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:25:43,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:43,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:25:43,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:25:43,251 INFO L87 Difference]: Start difference. First operand 336 states and 433 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-09 07:25:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:43,400 INFO L93 Difference]: Finished difference Result 345 states and 418 transitions. [2024-11-09 07:25:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:25:43,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-11-09 07:25:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:43,404 INFO L225 Difference]: With dead ends: 345 [2024-11-09 07:25:43,404 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 07:25:43,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-09 07:25:43,405 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 30 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 656 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-09 07:25:43,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 656 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:25:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 07:25:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-11-09 07:25:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 339 states have (on average 1.2153392330383481) internal successors, (412), 340 states have internal predecessors, (412), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 418 transitions. [2024-11-09 07:25:43,425 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 418 transitions. Word has length 49 [2024-11-09 07:25:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:43,425 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 418 transitions. [2024-11-09 07:25:43,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-09 07:25:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 418 transitions. [2024-11-09 07:25:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:25:43,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:43,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:25:43,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:25:43,631 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-09 07:25:43,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -856581962, now seen corresponding path program 1 times [2024-11-09 07:25:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736922373] [2024-11-09 07:25:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:43,633 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-09 07:25:43,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:43,634 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-09 07:25:43,635 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-09 07:25:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:43,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:25:43,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:43,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:25:43,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:25:43,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:25:43,894 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-09 07:25:43,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:25:43,975 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-09 07:25:44,033 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-09 07:25:44,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:44,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:44,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736922373] [2024-11-09 07:25:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736922373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:25:44,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089466728] [2024-11-09 07:25:44,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:44,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:25:44,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:44,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:25:44,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:25:44,035 INFO L87 Difference]: Start difference. First operand 345 states and 418 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-09 07:25:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:44,652 INFO L93 Difference]: Finished difference Result 345 states and 425 transitions. [2024-11-09 07:25:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:25:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 49 [2024-11-09 07:25:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:44,655 INFO L225 Difference]: With dead ends: 345 [2024-11-09 07:25:44,655 INFO L226 Difference]: Without dead ends: 342 [2024-11-09 07:25:44,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:25:44,656 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 108 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:44,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1003 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:25:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-09 07:25:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 295. [2024-11-09 07:25:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 289 states have (on average 1.231833910034602) internal successors, (356), 290 states have internal predecessors, (356), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 362 transitions. [2024-11-09 07:25:44,670 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 362 transitions. Word has length 49 [2024-11-09 07:25:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:44,670 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 362 transitions. [2024-11-09 07:25:44,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-09 07:25:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 362 transitions. [2024-11-09 07:25:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:25:44,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:44,672 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-09 07:25:44,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 07:25:44,876 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-09 07:25:44,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:44,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 359142474, now seen corresponding path program 1 times [2024-11-09 07:25:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:44,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781715234] [2024-11-09 07:25:44,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:44,879 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-09 07:25:44,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:44,886 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-09 07:25:44,887 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-09 07:25:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:45,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:25:45,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:45,419 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-09 07:25:45,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:45,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781715234] [2024-11-09 07:25:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781715234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:25:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222931474] [2024-11-09 07:25:45,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:45,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:25:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:25:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:25:45,422 INFO L87 Difference]: Start difference. First operand 295 states and 362 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:25:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:45,579 INFO L93 Difference]: Finished difference Result 301 states and 352 transitions. [2024-11-09 07:25:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:25:45,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-09 07:25:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:45,582 INFO L225 Difference]: With dead ends: 301 [2024-11-09 07:25:45,582 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 07:25:45,582 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-09 07:25:45,583 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 33 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:45,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 620 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:25:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 07:25:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-09 07:25:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 295 states have (on average 1.1728813559322033) internal successors, (346), 296 states have internal predecessors, (346), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 352 transitions. [2024-11-09 07:25:45,590 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 352 transitions. Word has length 85 [2024-11-09 07:25:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:45,591 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 352 transitions. [2024-11-09 07:25:45,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:25:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 352 transitions. [2024-11-09 07:25:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:25:45,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:45,592 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-09 07:25:45,604 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-09 07:25:45,793 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-09 07:25:45,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:45,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1571995686, now seen corresponding path program 1 times [2024-11-09 07:25:45,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:45,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947347736] [2024-11-09 07:25:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:45,795 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-09 07:25:45,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:45,799 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-09 07:25:45,800 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-09 07:25:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:46,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:25:46,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:46,337 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-09 07:25:46,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:46,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947347736] [2024-11-09 07:25:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947347736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:25:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025824580] [2024-11-09 07:25:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:25:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:25:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:25:46,340 INFO L87 Difference]: Start difference. First operand 301 states and 352 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:25:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:46,418 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2024-11-09 07:25:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:25:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-09 07:25:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:46,420 INFO L225 Difference]: With dead ends: 289 [2024-11-09 07:25:46,420 INFO L226 Difference]: Without dead ends: 289 [2024-11-09 07:25:46,421 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-09 07:25:46,421 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 2 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:46,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 822 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:25:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-09 07:25:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-09 07:25:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 283 states have (on average 1.1519434628975265) internal successors, (326), 284 states have internal predecessors, (326), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:25:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2024-11-09 07:25:46,428 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 85 [2024-11-09 07:25:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:46,428 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2024-11-09 07:25:46,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:25:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2024-11-09 07:25:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:25:46,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:46,430 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-09 07:25:46,441 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-09 07:25:46,630 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-09 07:25:46,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash -368631724, now seen corresponding path program 1 times [2024-11-09 07:25:46,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:46,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186783130] [2024-11-09 07:25:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:46,633 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-09 07:25:46,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:46,635 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-09 07:25:46,637 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-09 07:25:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:47,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:25:47,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:47,088 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-09 07:25:47,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:47,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186783130] [2024-11-09 07:25:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186783130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:47,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:47,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:25:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345896713] [2024-11-09 07:25:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:47,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:25:47,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:25:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:25:47,111 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:25:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:47,146 INFO L93 Difference]: Finished difference Result 292 states and 336 transitions. [2024-11-09 07:25:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:25:47,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2024-11-09 07:25:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:47,149 INFO L225 Difference]: With dead ends: 292 [2024-11-09 07:25:47,149 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 07:25:47,150 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-09 07:25:47,150 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 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-09 07:25:47,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:25:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 07:25:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-09 07:25:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 285 states have (on average 1.1543859649122807) internal successors, (329), 287 states have internal predecessors, (329), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:25:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 336 transitions. [2024-11-09 07:25:47,157 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 336 transitions. Word has length 85 [2024-11-09 07:25:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:47,157 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 336 transitions. [2024-11-09 07:25:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:25:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 336 transitions. [2024-11-09 07:25:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 07:25:47,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:47,158 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-09 07:25:47,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:25:47,358 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-09 07:25:47,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:47,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1324618674, now seen corresponding path program 1 times [2024-11-09 07:25:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754504562] [2024-11-09 07:25:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:47,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:25:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:47,361 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-09 07:25:47,362 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-09 07:25:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:47,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:25:47,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:47,820 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-09 07:25:47,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:25:47,909 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-09 07:25:47,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754504562] [2024-11-09 07:25:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754504562] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:25:47,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:25:47,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:25:47,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276223139] [2024-11-09 07:25:47,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:25:47,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:25:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:25:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:25:47,912 INFO L87 Difference]: Start difference. First operand 292 states and 336 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:25:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:48,048 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2024-11-09 07:25:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:25:48,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2024-11-09 07:25:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:48,050 INFO L225 Difference]: With dead ends: 303 [2024-11-09 07:25:48,050 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 07:25:48,050 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-09 07:25:48,051 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 5 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:48,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 677 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:25:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 07:25:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-11-09 07:25:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 293 states have (on average 1.1706484641638226) internal successors, (343), 295 states have internal predecessors, (343), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:25:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 350 transitions. [2024-11-09 07:25:48,057 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 350 transitions. Word has length 87 [2024-11-09 07:25:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:48,058 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 350 transitions. [2024-11-09 07:25:48,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:25:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 350 transitions. [2024-11-09 07:25:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 07:25:48,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:48,059 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-09 07:25:48,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 07:25:48,262 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-09 07:25:48,263 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:25:48,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1453468396, now seen corresponding path program 2 times [2024-11-09 07:25:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:25:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861348550] [2024-11-09 07:25:48,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:25:48,270 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-09 07:25:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:25:48,271 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-09 07:25:48,272 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-09 07:25:48,533 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:25:48,533 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:25:48,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:25:48,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:48,594 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-09 07:25:48,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:25:48,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:25:48,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861348550] [2024-11-09 07:25:48,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861348550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:25:48,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:25:48,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:25:48,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576235254] [2024-11-09 07:25:48,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:25:48,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:25:48,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:25:48,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:25:48,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:25:48,596 INFO L87 Difference]: Start difference. First operand 301 states and 350 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:25:52,870 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-09 07:25:56,877 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-09 07:25:59,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:26:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:01,315 INFO L93 Difference]: Finished difference Result 439 states and 521 transitions. [2024-11-09 07:26:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:26:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-09 07:26:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:01,321 INFO L225 Difference]: With dead ends: 439 [2024-11-09 07:26:01,321 INFO L226 Difference]: Without dead ends: 439 [2024-11-09 07:26:01,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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-09 07:26:01,322 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 488 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:01,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 388 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2024-11-09 07:26:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-09 07:26:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 412. [2024-11-09 07:26:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 403 states have (on average 1.1811414392059554) internal successors, (476), 405 states have internal predecessors, (476), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:26:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 486 transitions. [2024-11-09 07:26:01,334 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 486 transitions. Word has length 91 [2024-11-09 07:26:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:01,335 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 486 transitions. [2024-11-09 07:26:01,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:26:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 486 transitions. [2024-11-09 07:26:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 07:26:01,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:01,337 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] [2024-11-09 07:26:01,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:26:01,537 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-09 07:26:01,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:26:01,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1931554110, now seen corresponding path program 1 times [2024-11-09 07:26:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:26:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130766570] [2024-11-09 07:26:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:01,539 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-09 07:26:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:26:01,540 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-09 07:26:01,541 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-09 07:26:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:02,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:26:02,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:26:02,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:26:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:26:02,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:26:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130766570] [2024-11-09 07:26:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130766570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:26:02,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:26:02,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:26:02,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932426821] [2024-11-09 07:26:02,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:26:02,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:26:02,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:26:02,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:26:02,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:26:02,636 INFO L87 Difference]: Start difference. First operand 412 states and 486 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:26:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:03,374 INFO L93 Difference]: Finished difference Result 427 states and 509 transitions. [2024-11-09 07:26:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:26:03,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 101 [2024-11-09 07:26:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:03,377 INFO L225 Difference]: With dead ends: 427 [2024-11-09 07:26:03,377 INFO L226 Difference]: Without dead ends: 423 [2024-11-09 07:26:03,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:26:03,379 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 8 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:03,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1791 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:26:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-09 07:26:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2024-11-09 07:26:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 412 states have (on average 1.1844660194174756) internal successors, (488), 414 states have internal predecessors, (488), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:26:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 498 transitions. [2024-11-09 07:26:03,389 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 498 transitions. Word has length 101 [2024-11-09 07:26:03,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:03,390 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 498 transitions. [2024-11-09 07:26:03,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:26:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 498 transitions. [2024-11-09 07:26:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 07:26:03,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:03,391 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] [2024-11-09 07:26:03,407 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-09 07:26:03,595 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-09 07:26:03,596 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:26:03,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2031045768, now seen corresponding path program 2 times [2024-11-09 07:26:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:26:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384652484] [2024-11-09 07:26:03,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:26:03,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:26:03,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:26:03,602 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-09 07:26:03,603 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-09 07:26:04,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:26:04,192 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:26:04,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:26:04,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:26:04,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:26:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 07:26:05,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:26:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384652484] [2024-11-09 07:26:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384652484] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:26:05,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:26:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 07:26:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8055385] [2024-11-09 07:26:05,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:26:05,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:26:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:26:05,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:26:05,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:26:05,538 INFO L87 Difference]: Start difference. First operand 421 states and 498 transitions. Second operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 26 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:26:07,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:07,928 INFO L93 Difference]: Finished difference Result 445 states and 539 transitions. [2024-11-09 07:26:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 07:26:07,929 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 26 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2024-11-09 07:26:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:07,931 INFO L225 Difference]: With dead ends: 445 [2024-11-09 07:26:07,931 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 07:26:07,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:26:07,933 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 14 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:07,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2915 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:26:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 07:26:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-11-09 07:26:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 430 states have (on average 1.1906976744186046) internal successors, (512), 432 states have internal predecessors, (512), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:26:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 522 transitions. [2024-11-09 07:26:07,945 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 522 transitions. Word has length 110 [2024-11-09 07:26:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:07,946 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 522 transitions. [2024-11-09 07:26:07,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 26 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:26:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 522 transitions. [2024-11-09 07:26:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 07:26:07,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:07,948 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] [2024-11-09 07:26:07,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:26:08,149 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-09 07:26:08,149 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:26:08,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:08,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1320936136, now seen corresponding path program 3 times [2024-11-09 07:26:08,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:26:08,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116860692] [2024-11-09 07:26:08,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:26:08,150 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-09 07:26:08,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:26:08,152 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-09 07:26:08,153 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-09 07:26:08,674 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:26:08,674 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:26:08,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:26:08,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-09 07:26:08,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:26:08,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:26:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116860692] [2024-11-09 07:26:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116860692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:26:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022998892] [2024-11-09 07:26:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:26:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:26:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:26:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:26:08,707 INFO L87 Difference]: Start difference. First operand 439 states and 522 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:26:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:08,731 INFO L93 Difference]: Finished difference Result 440 states and 523 transitions. [2024-11-09 07:26:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:26:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2024-11-09 07:26:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:08,734 INFO L225 Difference]: With dead ends: 440 [2024-11-09 07:26:08,734 INFO L226 Difference]: Without dead ends: 440 [2024-11-09 07:26:08,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:26:08,735 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:08,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:26:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-09 07:26:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-09 07:26:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 431 states have (on average 1.1902552204176333) internal successors, (513), 433 states have internal predecessors, (513), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:26:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 523 transitions. [2024-11-09 07:26:08,744 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 523 transitions. Word has length 128 [2024-11-09 07:26:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 523 transitions. [2024-11-09 07:26:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:26:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 523 transitions. [2024-11-09 07:26:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 07:26:08,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:08,746 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] [2024-11-09 07:26:08,760 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-09 07:26:08,947 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-09 07:26:08,947 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:26:08,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2022000714, now seen corresponding path program 1 times [2024-11-09 07:26:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:26:08,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746963159] [2024-11-09 07:26:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:08,949 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-09 07:26:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:26:08,950 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-09 07:26:08,951 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-09 07:26:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:26:09,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:26:09,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 07:26:10,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:26:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 07:26:11,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:26:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746963159] [2024-11-09 07:26:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746963159] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:26:11,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:26:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 07:26:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351850019] [2024-11-09 07:26:11,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:26:11,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:26:11,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:26:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:26:11,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:26:11,831 INFO L87 Difference]: Start difference. First operand 440 states and 523 transitions. Second operand has 50 states, 50 states have (on average 2.86) internal successors, (143), 50 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:26:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:18,495 INFO L93 Difference]: Finished difference Result 480 states and 596 transitions. [2024-11-09 07:26:18,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 07:26:18,496 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.86) internal successors, (143), 50 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 128 [2024-11-09 07:26:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:18,498 INFO L225 Difference]: With dead ends: 480 [2024-11-09 07:26:18,498 INFO L226 Difference]: Without dead ends: 476 [2024-11-09 07:26:18,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 07:26:18,501 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 25 mSDsluCounter, 5156 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5382 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:18,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5382 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 07:26:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-09 07:26:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2024-11-09 07:26:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 465 states have (on average 1.2021505376344086) internal successors, (559), 467 states have internal predecessors, (559), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:26:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 569 transitions. [2024-11-09 07:26:18,513 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 569 transitions. Word has length 128 [2024-11-09 07:26:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:18,513 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 569 transitions. [2024-11-09 07:26:18,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.86) internal successors, (143), 50 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:26:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 569 transitions. [2024-11-09 07:26:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 07:26:18,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:18,515 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] [2024-11-09 07:26:18,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 07:26:18,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:26:18,717 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:26:18,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:18,717 INFO L85 PathProgramCache]: Analyzing trace with hash 817815094, now seen corresponding path program 2 times [2024-11-09 07:26:18,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:26:18,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902952098] [2024-11-09 07:26:18,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:26:18,719 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-09 07:26:18,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:26:18,721 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:26:18,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 07:26:19,863 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:26:19,863 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:26:19,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:26:19,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2024-11-09 07:26:20,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:26:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2024-11-09 07:26:23,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:26:23,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902952098] [2024-11-09 07:26:23,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902952098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:26:23,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:26:23,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 07:26:23,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107539866] [2024-11-09 07:26:23,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:26:23,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:26:23,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:26:23,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:26:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:26:23,055 INFO L87 Difference]: Start difference. First operand 474 states and 569 transitions. Second operand has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 52 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:26:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:26:30,324 INFO L93 Difference]: Finished difference Result 503 states and 625 transitions. [2024-11-09 07:26:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-09 07:26:30,324 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 52 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2024-11-09 07:26:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:26:30,327 INFO L225 Difference]: With dead ends: 503 [2024-11-09 07:26:30,327 INFO L226 Difference]: Without dead ends: 503 [2024-11-09 07:26:30,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-09 07:26:30,329 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 27 mSDsluCounter, 5355 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5580 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:26:30,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5580 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 07:26:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-09 07:26:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2024-11-09 07:26:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 490 states have (on average 1.2428571428571429) internal successors, (609), 492 states have internal predecessors, (609), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:26:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2024-11-09 07:26:30,339 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 162 [2024-11-09 07:26:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:26:30,339 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2024-11-09 07:26:30,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 52 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:26:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2024-11-09 07:26:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-09 07:26:30,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:30,342 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] [2024-11-09 07:26:30,370 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 (17)] Ended with exit code 0 [2024-11-09 07:26:30,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-09 07:26:30,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:26:30,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash 455740544, now seen corresponding path program 3 times [2024-11-09 07:26:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:26:30,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788192436] [2024-11-09 07:26:30,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:26:30,544 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-09 07:26:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:26:30,545 INFO L229 MonitoredProcess]: Starting monitored process 18 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-09 07:26:30,546 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 (18)] Waiting until timeout for monitored process [2024-11-09 07:26:31,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:26:31,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:26:31,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:26:31,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:26:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4377 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4376 trivial. 0 not checked. [2024-11-09 07:26:31,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:26:31,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:26:31,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788192436] [2024-11-09 07:26:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788192436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:26:31,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:26:31,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:26:31,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378206221] [2024-11-09 07:26:31,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:26:31,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:26:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:26:31,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:26:31,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:26:31,215 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:26:35,539 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 []