./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:48:24,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:48:24,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:48:24,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:48:24,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:48:24,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:48:24,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:48:24,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:48:24,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:48:24,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:48:24,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:48:24,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:48:24,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:48:24,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:48:24,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:48:24,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:48:24,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:48:24,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:48:24,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:48:24,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:48:24,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:48:24,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:48:24,217 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:48:24,217 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:48:24,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:48:24,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:48:24,218 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:48:24,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:48:24,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:48:24,219 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:48:24,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:48:24,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:48:24,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:48:24,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:48:24,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:48:24,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:48:24,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:48:24,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:48:24,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:48:24,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:48:24,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:48:24,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:48:24,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:48:24,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:48:24,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:48:24,222 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-10-24 15:48:24,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:48:24,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:48:24,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:48:24,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:48:24,443 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:48:24,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-24 15:48:25,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:48:25,867 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:48:25,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-24 15:48:25,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030c9c31c/ee72ccd56104448dac9f92ee076332c9/FLAGcb02826db [2024-10-24 15:48:26,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/030c9c31c/ee72ccd56104448dac9f92ee076332c9 [2024-10-24 15:48:26,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:48:26,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:48:26,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:48:26,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:48:26,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:48:26,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:48:26" (1/1) ... [2024-10-24 15:48:26,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29bbe60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:26, skipping insertion in model container [2024-10-24 15:48:26,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:48:26" (1/1) ... [2024-10-24 15:48:26,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:48:26,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:48:26,684 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-10-24 15:48:26,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@20fe8b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:26, skipping insertion in model container [2024-10-24 15:48:26,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:48:26,685 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:48:26,694 INFO L158 Benchmark]: Toolchain (without parser) took 486.10ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 111.2MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 15:48:26,694 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:48:26,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.57ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 111.2MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 15:48:26,696 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.15ms. Allocated memory is still 117.4MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.57ms. Allocated memory is still 176.2MB. Free memory was 137.6MB in the beginning and 111.2MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.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 a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:48:28,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:48:28,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:48:28,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:48:28,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:48:28,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:48:28,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:48:28,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:48:28,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:48:28,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:48:28,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:48:28,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:48:28,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:48:28,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:48:28,365 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:48:28,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:48:28,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:48:28,366 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:48:28,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:48:28,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:48:28,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:48:28,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:48:28,369 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:48:28,369 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:48:28,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:48:28,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:48:28,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:48:28,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:48:28,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:48:28,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:48:28,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:48:28,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:48:28,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:48:28,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:48:28,372 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:48:28,372 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:48:28,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:48:28,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:48:28,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:48:28,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:48:28,373 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:48:28,373 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-10-24 15:48:28,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:48:28,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:48:28,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:48:28,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:48:28,619 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:48:28,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-24 15:48:29,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:48:30,143 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:48:30,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-10-24 15:48:30,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfaf09cb/094959d2df6b4960814e8ef15e66b08a/FLAG6d0511318 [2024-10-24 15:48:30,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfaf09cb/094959d2df6b4960814e8ef15e66b08a [2024-10-24 15:48:30,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:48:30,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:48:30,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:48:30,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:48:30,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:48:30,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:48:30" (1/1) ... [2024-10-24 15:48:30,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ddbe8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:30, skipping insertion in model container [2024-10-24 15:48:30,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:48:30" (1/1) ... [2024-10-24 15:48:30,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:48:30,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:48:31,011 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:48:31,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:48:31,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:48:31,099 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:48:31,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:48:31,221 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:48:31,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31 WrapperNode [2024-10-24 15:48:31,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:48:31,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:48:31,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:48:31,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:48:31,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,314 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1728 [2024-10-24 15:48:31,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:48:31,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:48:31,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:48:31,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:48:31,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,469 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2024-10-24 15:48:31,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:48:31,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:48:31,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:48:31,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:48:31,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (1/1) ... [2024-10-24 15:48:31,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:48:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:48:31,579 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-10-24 15:48:31,582 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-10-24 15:48:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:48:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:48:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:48:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:48:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:48:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:48:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:48:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:48:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:48:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:48:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:48:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:48:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 15:48:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:48:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:48:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:48:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:48:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:48:31,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:48:31,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:48:31,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:48:44,085 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live. [2024-10-24 15:48:44,085 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:48:44,132 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:48:44,132 INFO L314 CfgBuilder]: Removed 100 assume(true) statements. [2024-10-24 15:48:44,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:48:44 BoogieIcfgContainer [2024-10-24 15:48:44,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:48:44,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:48:44,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:48:44,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:48:44,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:48:30" (1/3) ... [2024-10-24 15:48:44,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313fc0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:48:44, skipping insertion in model container [2024-10-24 15:48:44,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:48:31" (2/3) ... [2024-10-24 15:48:44,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313fc0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:48:44, skipping insertion in model container [2024-10-24 15:48:44,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:48:44" (3/3) ... [2024-10-24 15:48:44,142 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2024-10-24 15:48:44,153 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:48:44,154 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:48:44,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:48:44,200 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;@4886c85b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:48:44,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:48:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 299 states have (on average 1.6822742474916388) internal successors, (503), 308 states have internal predecessors, (503), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:48:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 15:48:44,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:44,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:48:44,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:44,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1408030666, now seen corresponding path program 1 times [2024-10-24 15:48:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934799502] [2024-10-24 15:48:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:44,222 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-10-24 15:48:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:44,223 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-10-24 15:48:44,239 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-10-24 15:48:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:44,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:48:44,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:48:44,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:48:44,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934799502] [2024-10-24 15:48:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934799502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:48:44,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:48:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:48:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246617205] [2024-10-24 15:48:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:48:44,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:48:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:44,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:48:44,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:48:44,431 INFO L87 Difference]: Start difference. First operand has 318 states, 299 states have (on average 1.6822742474916388) internal successors, (503), 308 states have internal predecessors, (503), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:48:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:44,473 INFO L93 Difference]: Finished difference Result 316 states and 417 transitions. [2024-10-24 15:48:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:48:44,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 15:48:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:44,485 INFO L225 Difference]: With dead ends: 316 [2024-10-24 15:48:44,486 INFO L226 Difference]: Without dead ends: 315 [2024-10-24 15:48:44,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:48:44,491 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:44,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:48:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-24 15:48:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-10-24 15:48:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 298 states have (on average 1.3154362416107384) internal successors, (392), 305 states have internal predecessors, (392), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 15:48:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 416 transitions. [2024-10-24 15:48:44,546 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 416 transitions. Word has length 9 [2024-10-24 15:48:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:44,547 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 416 transitions. [2024-10-24 15:48:44,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:48:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 416 transitions. [2024-10-24 15:48:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 15:48:44,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:44,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:48:44,558 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-10-24 15:48:44,751 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-10-24 15:48:44,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:44,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1581269798, now seen corresponding path program 1 times [2024-10-24 15:48:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503626361] [2024-10-24 15:48:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:44,753 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-10-24 15:48:44,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:44,756 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-10-24 15:48:44,757 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-10-24 15:48:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:44,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 15:48:44,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:48:44,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:48:44,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503626361] [2024-10-24 15:48:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503626361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:48:44,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:48:44,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:48:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985958928] [2024-10-24 15:48:44,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:48:44,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:48:44,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:44,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:48:44,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:48:44,909 INFO L87 Difference]: Start difference. First operand 315 states and 416 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-24 15:48:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:45,116 INFO L93 Difference]: Finished difference Result 561 states and 744 transitions. [2024-10-24 15:48:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:48:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-24 15:48:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:45,120 INFO L225 Difference]: With dead ends: 561 [2024-10-24 15:48:45,123 INFO L226 Difference]: Without dead ends: 561 [2024-10-24 15:48:45,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10-24 15:48:45,124 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 303 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:45,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 840 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:48:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-24 15:48:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 317. [2024-10-24 15:48:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 300 states have (on average 1.3133333333333332) internal successors, (394), 307 states have internal predecessors, (394), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 15:48:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 418 transitions. [2024-10-24 15:48:45,150 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 418 transitions. Word has length 10 [2024-10-24 15:48:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:45,151 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 418 transitions. [2024-10-24 15:48:45,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-10-24 15:48:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 418 transitions. [2024-10-24 15:48:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 15:48:45,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:45,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:45,161 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-10-24 15:48:45,360 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-10-24 15:48:45,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1412388192, now seen corresponding path program 1 times [2024-10-24 15:48:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077326825] [2024-10-24 15:48:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:45,363 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-10-24 15:48:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:45,366 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-10-24 15:48:45,366 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-10-24 15:48:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:45,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:48:45,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:48:45,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:48:45,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077326825] [2024-10-24 15:48:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077326825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:48:45,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:48:45,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:48:45,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171988295] [2024-10-24 15:48:45,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:48:45,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:48:45,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:45,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:48:45,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:48:45,847 INFO L87 Difference]: Start difference. First operand 317 states and 418 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:48:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:45,951 INFO L93 Difference]: Finished difference Result 320 states and 413 transitions. [2024-10-24 15:48:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:48:45,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2024-10-24 15:48:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:45,953 INFO L225 Difference]: With dead ends: 320 [2024-10-24 15:48:45,953 INFO L226 Difference]: Without dead ends: 320 [2024-10-24 15:48:45,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 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-10-24 15:48:45,957 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 30 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:45,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1129 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:48:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-24 15:48:45,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-10-24 15:48:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 303 states have (on average 1.283828382838284) internal successors, (389), 310 states have internal predecessors, (389), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 15:48:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 413 transitions. [2024-10-24 15:48:45,967 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 413 transitions. Word has length 151 [2024-10-24 15:48:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:45,967 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 413 transitions. [2024-10-24 15:48:45,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:48:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 413 transitions. [2024-10-24 15:48:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 15:48:45,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:45,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:45,982 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-10-24 15:48:46,170 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-10-24 15:48:46,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:46,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1506775084, now seen corresponding path program 1 times [2024-10-24 15:48:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006900590] [2024-10-24 15:48:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:46,172 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-10-24 15:48:46,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:46,175 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-10-24 15:48:46,176 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-10-24 15:48:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:46,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:48:46,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:48:46,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:48:46,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:46,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006900590] [2024-10-24 15:48:46,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006900590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:48:46,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:48:46,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:48:46,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966715806] [2024-10-24 15:48:46,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:48:46,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:48:46,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:46,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:48:46,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:48:46,837 INFO L87 Difference]: Start difference. First operand 320 states and 413 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:48:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:47,339 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2024-10-24 15:48:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:48:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2024-10-24 15:48:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:47,342 INFO L225 Difference]: With dead ends: 415 [2024-10-24 15:48:47,342 INFO L226 Difference]: Without dead ends: 415 [2024-10-24 15:48:47,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 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-10-24 15:48:47,343 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 72 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:47,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 805 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 15:48:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-24 15:48:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 362. [2024-10-24 15:48:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 345 states have (on average 1.2608695652173914) internal successors, (435), 352 states have internal predecessors, (435), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 15:48:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 459 transitions. [2024-10-24 15:48:47,350 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 459 transitions. Word has length 151 [2024-10-24 15:48:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:47,350 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 459 transitions. [2024-10-24 15:48:47,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:48:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 459 transitions. [2024-10-24 15:48:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 15:48:47,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:47,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:47,372 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-10-24 15:48:47,557 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-10-24 15:48:47,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:47,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash 206796108, now seen corresponding path program 1 times [2024-10-24 15:48:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:47,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258364357] [2024-10-24 15:48:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:47,560 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-10-24 15:48:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:47,562 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-10-24 15:48:47,563 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-10-24 15:48:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:48,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:48:48,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:48:48,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:48:48,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258364357] [2024-10-24 15:48:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258364357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:48:48,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:48:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:48:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442713567] [2024-10-24 15:48:48,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:48:48,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:48:48,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:48:48,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:48:48,120 INFO L87 Difference]: Start difference. First operand 362 states and 459 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:48:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:48,184 INFO L93 Difference]: Finished difference Result 364 states and 463 transitions. [2024-10-24 15:48:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:48:48,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 164 [2024-10-24 15:48:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:48,186 INFO L225 Difference]: With dead ends: 364 [2024-10-24 15:48:48,187 INFO L226 Difference]: Without dead ends: 364 [2024-10-24 15:48:48,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 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-10-24 15:48:48,188 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 0 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:48,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1187 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:48:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-24 15:48:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-10-24 15:48:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 346 states have (on average 1.2630057803468209) internal successors, (437), 354 states have internal predecessors, (437), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:48:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 463 transitions. [2024-10-24 15:48:48,198 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 463 transitions. Word has length 164 [2024-10-24 15:48:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:48,198 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 463 transitions. [2024-10-24 15:48:48,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:48:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 463 transitions. [2024-10-24 15:48:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 15:48:48,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:48,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:48,213 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-10-24 15:48:48,400 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-10-24 15:48:48,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:48,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash 540844976, now seen corresponding path program 1 times [2024-10-24 15:48:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045130376] [2024-10-24 15:48:48,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:48,403 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-10-24 15:48:48,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:48,405 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-10-24 15:48:48,409 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-10-24 15:48:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:48,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:48:48,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:48:48,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:48:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:48:49,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045130376] [2024-10-24 15:48:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045130376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:48:49,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:48:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:48:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364814732] [2024-10-24 15:48:49,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:48:49,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:48:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:48:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:48:49,041 INFO L87 Difference]: Start difference. First operand 364 states and 463 transitions. Second operand has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:48:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:49,208 INFO L93 Difference]: Finished difference Result 373 states and 478 transitions. [2024-10-24 15:48:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:48:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 166 [2024-10-24 15:48:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:49,211 INFO L225 Difference]: With dead ends: 373 [2024-10-24 15:48:49,211 INFO L226 Difference]: Without dead ends: 373 [2024-10-24 15:48:49,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 324 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-10-24 15:48:49,211 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 4 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:49,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1576 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:48:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-24 15:48:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2024-10-24 15:48:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 353 states have (on average 1.274787535410765) internal successors, (450), 361 states have internal predecessors, (450), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:48:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 476 transitions. [2024-10-24 15:48:49,218 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 476 transitions. Word has length 166 [2024-10-24 15:48:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:49,218 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 476 transitions. [2024-10-24 15:48:49,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:48:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 476 transitions. [2024-10-24 15:48:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 15:48:49,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:49,220 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:49,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 15:48:49,420 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-10-24 15:48:49,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:49,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash -482685716, now seen corresponding path program 2 times [2024-10-24 15:48:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:49,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084045629] [2024-10-24 15:48:49,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:48:49,422 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-10-24 15:48:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:49,423 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-10-24 15:48:49,424 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-10-24 15:48:49,731 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:48:49,731 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:48:49,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:48:49,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-24 15:48:49,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:48:49,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:49,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084045629] [2024-10-24 15:48:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084045629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:48:49,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:48:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:48:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276721981] [2024-10-24 15:48:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:48:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:48:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:48:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:48:49,760 INFO L87 Difference]: Start difference. First operand 372 states and 476 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:48:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:49,855 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2024-10-24 15:48:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:48:49,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-24 15:48:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:49,859 INFO L225 Difference]: With dead ends: 375 [2024-10-24 15:48:49,859 INFO L226 Difference]: Without dead ends: 375 [2024-10-24 15:48:49,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 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-10-24 15:48:49,860 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 33 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:49,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1093 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:48:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-24 15:48:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-24 15:48:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 356 states have (on average 1.25) internal successors, (445), 364 states have internal predecessors, (445), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:48:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 471 transitions. [2024-10-24 15:48:49,866 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 471 transitions. Word has length 170 [2024-10-24 15:48:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:49,867 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 471 transitions. [2024-10-24 15:48:49,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:48:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 471 transitions. [2024-10-24 15:48:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 15:48:49,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:49,868 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:49,873 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-10-24 15:48:50,071 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-10-24 15:48:50,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:50,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2125336678, now seen corresponding path program 1 times [2024-10-24 15:48:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273012966] [2024-10-24 15:48:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:50,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:48:50,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:50,075 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-10-24 15:48:50,076 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-10-24 15:48:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:50,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:48:50,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:48:50,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:48:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 15:48:50,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273012966] [2024-10-24 15:48:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273012966] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:48:50,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:48:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:48:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134454002] [2024-10-24 15:48:50,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:48:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:48:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:50,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:48:50,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:48:50,859 INFO L87 Difference]: Start difference. First operand 375 states and 471 transitions. Second operand has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:48:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:51,354 INFO L93 Difference]: Finished difference Result 387 states and 491 transitions. [2024-10-24 15:48:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:48:51,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 170 [2024-10-24 15:48:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:51,356 INFO L225 Difference]: With dead ends: 387 [2024-10-24 15:48:51,356 INFO L226 Difference]: Without dead ends: 385 [2024-10-24 15:48:51,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:48:51,357 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 8 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2679 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:51,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2679 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:48:51,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-24 15:48:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2024-10-24 15:48:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 365 states have (on average 1.252054794520548) internal successors, (457), 373 states have internal predecessors, (457), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:48:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 483 transitions. [2024-10-24 15:48:51,365 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 483 transitions. Word has length 170 [2024-10-24 15:48:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:51,365 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 483 transitions. [2024-10-24 15:48:51,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:48:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 483 transitions. [2024-10-24 15:48:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 15:48:51,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:51,369 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:51,384 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-10-24 15:48:51,569 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-10-24 15:48:51,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -432570703, now seen corresponding path program 2 times [2024-10-24 15:48:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049269283] [2024-10-24 15:48:51,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:48:51,571 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-10-24 15:48:51,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:51,572 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-10-24 15:48:51,574 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-10-24 15:48:51,896 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:48:51,896 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:48:51,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:48:51,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-24 15:48:51,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:48:51,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049269283] [2024-10-24 15:48:51,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049269283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:48:51,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:48:51,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:48:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658698518] [2024-10-24 15:48:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:48:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:48:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:48:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:48:51,972 INFO L87 Difference]: Start difference. First operand 384 states and 483 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:48:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:52,048 INFO L93 Difference]: Finished difference Result 378 states and 473 transitions. [2024-10-24 15:48:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:48:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 179 [2024-10-24 15:48:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:52,051 INFO L225 Difference]: With dead ends: 378 [2024-10-24 15:48:52,052 INFO L226 Difference]: Without dead ends: 378 [2024-10-24 15:48:52,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 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-10-24 15:48:52,053 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 6 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:52,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1093 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:48:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-24 15:48:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2024-10-24 15:48:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 359 states have (on average 1.2451253481894151) internal successors, (447), 367 states have internal predecessors, (447), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:48:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 473 transitions. [2024-10-24 15:48:52,062 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 473 transitions. Word has length 179 [2024-10-24 15:48:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:52,062 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 473 transitions. [2024-10-24 15:48:52,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:48:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 473 transitions. [2024-10-24 15:48:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 15:48:52,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:52,064 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:52,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 15:48:52,265 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-10-24 15:48:52,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:52,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash -894676489, now seen corresponding path program 1 times [2024-10-24 15:48:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:52,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305806924] [2024-10-24 15:48:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:48:52,266 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-10-24 15:48:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:52,267 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-10-24 15:48:52,268 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-10-24 15:48:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:48:52,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:48:52,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 15:48:52,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:48:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 15:48:53,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:53,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305806924] [2024-10-24 15:48:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305806924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:48:53,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:48:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:48:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557539321] [2024-10-24 15:48:53,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:48:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:48:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:48:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:48:53,414 INFO L87 Difference]: Start difference. First operand 378 states and 473 transitions. Second operand has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:48:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:48:54,905 INFO L93 Difference]: Finished difference Result 399 states and 511 transitions. [2024-10-24 15:48:54,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:48:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 179 [2024-10-24 15:48:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:48:54,907 INFO L225 Difference]: With dead ends: 399 [2024-10-24 15:48:54,907 INFO L226 Difference]: Without dead ends: 397 [2024-10-24 15:48:54,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:48:54,908 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 14 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 15:48:54,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4543 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 15:48:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-24 15:48:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 396. [2024-10-24 15:48:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 377 states have (on average 1.2493368700265253) internal successors, (471), 385 states have internal predecessors, (471), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:48:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 497 transitions. [2024-10-24 15:48:54,918 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 497 transitions. Word has length 179 [2024-10-24 15:48:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:48:54,919 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 497 transitions. [2024-10-24 15:48:54,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:48:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 497 transitions. [2024-10-24 15:48:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 15:48:54,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:48:54,920 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:48:54,935 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-10-24 15:48:55,120 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-10-24 15:48:55,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:48:55,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:48:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash 43693847, now seen corresponding path program 2 times [2024-10-24 15:48:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:48:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571885845] [2024-10-24 15:48:55,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:48:55,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:48:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:48:55,123 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-10-24 15:48:55,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 15:48:55,802 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:48:55,802 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:48:55,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 15:48:55,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:48:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 15:48:56,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:48:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 15:48:57,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:48:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571885845] [2024-10-24 15:48:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571885845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:48:57,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:48:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:48:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743508492] [2024-10-24 15:48:57,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:48:57,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:48:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:48:57,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:48:57,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:48:57,535 INFO L87 Difference]: Start difference. First operand 396 states and 497 transitions. Second operand has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:49:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:02,510 INFO L93 Difference]: Finished difference Result 433 states and 567 transitions. [2024-10-24 15:49:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:49:02,510 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 197 [2024-10-24 15:49:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:02,512 INFO L225 Difference]: With dead ends: 433 [2024-10-24 15:49:02,512 INFO L226 Difference]: Without dead ends: 431 [2024-10-24 15:49:02,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:49:02,514 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 25 mSDsluCounter, 9072 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9454 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:02,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9454 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 15:49:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-24 15:49:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 430. [2024-10-24 15:49:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 411 states have (on average 1.2579075425790753) internal successors, (517), 419 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:49:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 543 transitions. [2024-10-24 15:49:02,522 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 543 transitions. Word has length 197 [2024-10-24 15:49:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:02,523 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 543 transitions. [2024-10-24 15:49:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:49:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 543 transitions. [2024-10-24 15:49:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-24 15:49:02,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:02,525 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:49:02,544 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-10-24 15:49:02,725 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-10-24 15:49:02,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:02,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash -760000585, now seen corresponding path program 3 times [2024-10-24 15:49:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450881518] [2024-10-24 15:49:02,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:49:02,728 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-10-24 15:49:02,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:02,729 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-10-24 15:49:02,730 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-10-24 15:49:03,343 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:49:03,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:49:03,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:49:03,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-24 15:49:03,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:49:03,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450881518] [2024-10-24 15:49:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450881518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:49:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:49:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:49:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037030694] [2024-10-24 15:49:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:49:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:49:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:03,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:49:03,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:49:03,393 INFO L87 Difference]: Start difference. First operand 430 states and 543 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:49:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:03,470 INFO L93 Difference]: Finished difference Result 433 states and 538 transitions. [2024-10-24 15:49:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:49:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-10-24 15:49:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:03,472 INFO L225 Difference]: With dead ends: 433 [2024-10-24 15:49:03,472 INFO L226 Difference]: Without dead ends: 433 [2024-10-24 15:49:03,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 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-10-24 15:49:03,473 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 30 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:03,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1051 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:49:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-24 15:49:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2024-10-24 15:49:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 414 states have (on average 1.2367149758454106) internal successors, (512), 422 states have internal predecessors, (512), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:49:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 538 transitions. [2024-10-24 15:49:03,482 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 538 transitions. Word has length 231 [2024-10-24 15:49:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:03,482 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 538 transitions. [2024-10-24 15:49:03,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:49:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 538 transitions. [2024-10-24 15:49:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-24 15:49:03,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:03,484 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:49:03,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 15:49:03,689 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-10-24 15:49:03,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:03,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash 744632771, now seen corresponding path program 1 times [2024-10-24 15:49:03,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:03,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596343845] [2024-10-24 15:49:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:03,691 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-10-24 15:49:03,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:03,693 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-10-24 15:49:03,694 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-10-24 15:49:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:04,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 15:49:04,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:49:05,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:49:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:49:06,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596343845] [2024-10-24 15:49:06,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596343845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:49:06,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:49:06,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:49:06,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679029601] [2024-10-24 15:49:06,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:49:06,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:49:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:06,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:49:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:49:06,569 INFO L87 Difference]: Start difference. First operand 433 states and 538 transitions. Second operand has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:49:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:11,831 INFO L93 Difference]: Finished difference Result 460 states and 592 transitions. [2024-10-24 15:49:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 15:49:11,832 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2024-10-24 15:49:11,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:11,833 INFO L225 Difference]: With dead ends: 460 [2024-10-24 15:49:11,833 INFO L226 Difference]: Without dead ends: 460 [2024-10-24 15:49:11,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 15:49:11,838 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 26 mSDsluCounter, 9863 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10233 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:11,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10233 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 15:49:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-24 15:49:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2024-10-24 15:49:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 439 states have (on average 1.2801822323462415) internal successors, (562), 447 states have internal predecessors, (562), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:49:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 588 transitions. [2024-10-24 15:49:11,852 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 588 transitions. Word has length 231 [2024-10-24 15:49:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:11,852 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 588 transitions. [2024-10-24 15:49:11,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:49:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 588 transitions. [2024-10-24 15:49:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-24 15:49:11,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:11,854 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:49:11,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 15:49:12,054 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-10-24 15:49:12,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:12,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1516613260, now seen corresponding path program 2 times [2024-10-24 15:49:12,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:12,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181750940] [2024-10-24 15:49:12,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:49:12,056 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-10-24 15:49:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:12,058 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-10-24 15:49:12,059 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-10-24 15:49:13,826 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:49:13,826 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:49:13,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 15:49:13,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:49:15,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:49:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:49:20,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:20,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181750940] [2024-10-24 15:49:20,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181750940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:49:20,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:49:20,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-24 15:49:20,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47449896] [2024-10-24 15:49:20,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:49:20,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-24 15:49:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-24 15:49:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-24 15:49:20,235 INFO L87 Difference]: Start difference. First operand 458 states and 588 transitions. Second operand has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:49:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:46,942 INFO L93 Difference]: Finished difference Result 514 states and 699 transitions. [2024-10-24 15:49:46,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-24 15:49:46,943 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 256 [2024-10-24 15:49:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:46,945 INFO L225 Difference]: With dead ends: 514 [2024-10-24 15:49:46,945 INFO L226 Difference]: Without dead ends: 514 [2024-10-24 15:49:46,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-10-24 15:49:46,951 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 57 mSDsluCounter, 18621 mSDsCounter, 0 mSdLazyCounter, 5657 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 18991 SdHoareTripleChecker+Invalid, 5805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 5657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:46,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 18991 Invalid, 5805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 5657 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-24 15:49:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-24 15:49:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2024-10-24 15:49:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 493 states have (on average 1.356997971602434) internal successors, (669), 501 states have internal predecessors, (669), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 15:49:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 695 transitions. [2024-10-24 15:49:46,965 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 695 transitions. Word has length 256 [2024-10-24 15:49:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:46,965 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 695 transitions. [2024-10-24 15:49:46,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:49:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 695 transitions. [2024-10-24 15:49:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-10-24 15:49:46,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:46,967 INFO L215 NwaCegarLoop]: trace histogram [142, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 15:49:46,991 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-10-24 15:49:47,168 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-10-24 15:49:47,168 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 261017196, now seen corresponding path program 3 times [2024-10-24 15:49:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465474282] [2024-10-24 15:49:47,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:49:47,170 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-10-24 15:49:47,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:47,171 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-10-24 15:49:47,171 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-10-24 15:49:47,864 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:49:47,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:49:47,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:49:47,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10298 trivial. 0 not checked. [2024-10-24 15:49:48,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:49:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10298 trivial. 0 not checked. [2024-10-24 15:49:48,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:48,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465474282] [2024-10-24 15:49:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465474282] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:49:48,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:49:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-24 15:49:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320827807] [2024-10-24 15:49:48,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:49:48,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:49:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:49:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:49:48,257 INFO L87 Difference]: Start difference. First operand 512 states and 695 transitions. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:49:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:48,765 INFO L93 Difference]: Finished difference Result 1145 states and 1473 transitions. [2024-10-24 15:49:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:49:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 306 [2024-10-24 15:49:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:48,769 INFO L225 Difference]: With dead ends: 1145 [2024-10-24 15:49:48,769 INFO L226 Difference]: Without dead ends: 1145 [2024-10-24 15:49:48,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:49:48,771 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 1031 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:48,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1806 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 15:49:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-10-24 15:49:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1076. [2024-10-24 15:49:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1034 states have (on average 1.264990328820116) internal successors, (1308), 1047 states have internal predecessors, (1308), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (42), 26 states have call predecessors, (42), 34 states have call successors, (42) [2024-10-24 15:49:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1386 transitions. [2024-10-24 15:49:48,789 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1386 transitions. Word has length 306 [2024-10-24 15:49:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:48,789 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1386 transitions. [2024-10-24 15:49:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:49:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1386 transitions. [2024-10-24 15:49:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-10-24 15:49:48,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:48,794 INFO L215 NwaCegarLoop]: trace histogram [142, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-10-24 15:49:48,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-24 15:49:48,995 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-10-24 15:49:48,995 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1752095684, now seen corresponding path program 1 times [2024-10-24 15:49:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884116526] [2024-10-24 15:49:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:48,997 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-10-24 15:49:48,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:48,998 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-10-24 15:49:48,999 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-10-24 15:49:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:52,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 3716 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-24 15:49:52,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10932 backedges. 4568 proven. 4851 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-10-24 15:49:57,431 INFO L311 TraceCheckSpWp]: Computing backward predicates...