./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_SFH_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d 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_SFH_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:25:19,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:25:19,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:25:19,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:25:19,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:25:19,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:25:19,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:25:19,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:25:19,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:25:19,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:25:19,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:25:19,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:25:19,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:25:19,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:25:19,945 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:25:19,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:25:19,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:25:19,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:25:19,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:25:19,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:25:19,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:25:19,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:25:19,951 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:25:19,951 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:25:19,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:25:19,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:25:19,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:25:19,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:25:19,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:25:19,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:25:19,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:25:19,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:25:19,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:25:19,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:25:19,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:25:19,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:25:19,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:25:19,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:25:19,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:25:19,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:25:19,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:25:19,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:25:19,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:25:19,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:25:19,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:25:19,957 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2024-10-13 10:25:20,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:25:20,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:25:20,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:25:20,264 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:25:20,265 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:25:20,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-10-13 10:25:21,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:25:22,181 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:25:22,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-10-13 10:25:22,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4108c9c8/369ba34ac648412ca71d3a3bcf2b3d95/FLAG506d671b6 [2024-10-13 10:25:22,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4108c9c8/369ba34ac648412ca71d3a3bcf2b3d95 [2024-10-13 10:25:22,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:25:22,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:25:22,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:25:22,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:25:22,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:25:22,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:25:22" (1/1) ... [2024-10-13 10:25:22,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157abd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:22, skipping insertion in model container [2024-10-13 10:25:22,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:25:22" (1/1) ... [2024-10-13 10:25:22,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:25:22,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:25:23,010 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-13 10:25:23,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3b0f9448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:23, skipping insertion in model container [2024-10-13 10:25:23,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:25:23,012 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:25:23,014 INFO L158 Benchmark]: Toolchain (without parser) took 787.62ms. Allocated memory is still 180.4MB. Free memory was 111.5MB in the beginning and 145.1MB in the end (delta: -33.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:25:23,015 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:25:23,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 784.99ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 145.6MB in the end (delta: -34.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 10:25:23,017 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.31ms. Allocated memory is still 109.1MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 784.99ms. Allocated memory is still 180.4MB. Free memory was 111.3MB in the beginning and 145.6MB in the end (delta: -34.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_SFH_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:25:25,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:25:25,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:25:25,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:25:25,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:25:25,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:25:25,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:25:25,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:25:25,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:25:25,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:25:25,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:25:25,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:25:25,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:25:25,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:25:25,260 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:25:25,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:25:25,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:25:25,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:25:25,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:25:25,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:25:25,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:25:25,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:25:25,263 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:25:25,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:25:25,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:25:25,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:25:25,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:25:25,266 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:25:25,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:25:25,267 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:25:25,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:25:25,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:25:25,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:25:25,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:25:25,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:25:25,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:25:25,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:25:25,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:25:25,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:25:25,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:25:25,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:25:25,270 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:25:25,270 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:25:25,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:25:25,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:25:25,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:25:25,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:25:25,271 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:25:25,271 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2024-10-13 10:25:25,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:25:25,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:25:25,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:25:25,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:25:25,652 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:25:25,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-10-13 10:25:27,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:25:27,603 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:25:27,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-10-13 10:25:27,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47633a950/4a385d5c4e4c4c5c81e6f0b5d6aa24b0/FLAG546ceed1c [2024-10-13 10:25:27,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47633a950/4a385d5c4e4c4c5c81e6f0b5d6aa24b0 [2024-10-13 10:25:27,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:25:27,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:25:27,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:25:27,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:25:27,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:25:27,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:25:27" (1/1) ... [2024-10-13 10:25:27,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57aafbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:27, skipping insertion in model container [2024-10-13 10:25:27,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:25:27" (1/1) ... [2024-10-13 10:25:27,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:25:28,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:25:28,615 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:25:28,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:25:28,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:25:28,736 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:25:28,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:25:28,900 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:25:28,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28 WrapperNode [2024-10-13 10:25:28,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:25:28,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:25:28,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:25:28,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:25:28,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:28,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,019 INFO L138 Inliner]: procedures = 179, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1172 [2024-10-13 10:25:29,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:25:29,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:25:29,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:25:29,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:25:29,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,144 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-13 10:25:29,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:25:29,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:25:29,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:25:29,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:25:29,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (1/1) ... [2024-10-13 10:25:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:25:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:25:29,283 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-13 10:25:29,290 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-13 10:25:29,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:25:29,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:25:29,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:25:29,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:25:29,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:25:29,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:25:29,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:25:29,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:25:29,337 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:25:29,338 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:25:29,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:25:29,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:25:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:25:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:25:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:25:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:25:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:25:29,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:25:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:25:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:25:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:25:29,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:25:29,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:25:29,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:25:29,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:25:43,276 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2024-10-13 10:25:43,276 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:25:43,321 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:25:43,323 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-13 10:25:43,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:25:43 BoogieIcfgContainer [2024-10-13 10:25:43,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:25:43,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:25:43,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:25:43,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:25:43,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:25:27" (1/3) ... [2024-10-13 10:25:43,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bee6f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:25:43, skipping insertion in model container [2024-10-13 10:25:43,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:25:28" (2/3) ... [2024-10-13 10:25:43,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bee6f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:25:43, skipping insertion in model container [2024-10-13 10:25:43,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:25:43" (3/3) ... [2024-10-13 10:25:43,334 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2024-10-13 10:25:43,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:25:43,352 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:25:43,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:25:43,420 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;@4dfc20b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:25:43,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:25:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 192 states have (on average 1.6770833333333333) internal successors, (322), 204 states have internal predecessors, (322), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:25:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:25:43,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:43,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:25:43,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:43,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash 930833829, now seen corresponding path program 1 times [2024-10-13 10:25:43,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:43,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176874466] [2024-10-13 10:25:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:43,460 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-13 10:25:43,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:43,463 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-13 10:25:43,465 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-13 10:25:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:43,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:25:43,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:43,644 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-13 10:25:43,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:25:43,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176874466] [2024-10-13 10:25:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176874466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:25:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:25:43,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:25:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352113583] [2024-10-13 10:25:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:25:43,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:25:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:25:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:25:43,681 INFO L87 Difference]: Start difference. First operand has 213 states, 192 states have (on average 1.6770833333333333) internal successors, (322), 204 states have internal predecessors, (322), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 10:25:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:43,733 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2024-10-13 10:25:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:25:43,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-13 10:25:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:43,754 INFO L225 Difference]: With dead ends: 212 [2024-10-13 10:25:43,754 INFO L226 Difference]: Without dead ends: 211 [2024-10-13 10:25:43,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-13 10:25:43,762 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:43,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:25:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-13 10:25:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-13 10:25:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 202 states have internal predecessors, (251), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:25:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 283 transitions. [2024-10-13 10:25:43,837 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 283 transitions. Word has length 6 [2024-10-13 10:25:43,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:43,837 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 283 transitions. [2024-10-13 10:25:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 10:25:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 283 transitions. [2024-10-13 10:25:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:25:43,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:43,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:25:43,845 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-13 10:25:44,039 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-13 10:25:44,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:44,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 270449044, now seen corresponding path program 1 times [2024-10-13 10:25:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286801121] [2024-10-13 10:25:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:44,042 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-13 10:25:44,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:44,045 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-13 10:25:44,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:25:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:44,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:25:44,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:44,208 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-13 10:25:44,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:25:44,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:44,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286801121] [2024-10-13 10:25:44,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286801121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:25:44,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:25:44,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:25:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330774416] [2024-10-13 10:25:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:25:44,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:25:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:44,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:25:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:25:44,215 INFO L87 Difference]: Start difference. First operand 211 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 10:25:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:44,501 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2024-10-13 10:25:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:25:44,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-10-13 10:25:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:44,505 INFO L225 Difference]: With dead ends: 385 [2024-10-13 10:25:44,506 INFO L226 Difference]: Without dead ends: 385 [2024-10-13 10:25:44,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 10:25:44,508 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 213 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:44,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 580 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:25:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-13 10:25:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 212. [2024-10-13 10:25:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 192 states have (on average 1.3125) internal successors, (252), 203 states have internal predecessors, (252), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:25:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2024-10-13 10:25:44,531 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 6 [2024-10-13 10:25:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:44,532 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2024-10-13 10:25:44,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 10:25:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2024-10-13 10:25:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 10:25:44,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:44,536 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] [2024-10-13 10:25:44,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:25:44,737 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-13 10:25:44,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:44,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1848851602, now seen corresponding path program 1 times [2024-10-13 10:25:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971486380] [2024-10-13 10:25:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:44,743 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-13 10:25:44,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:44,745 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-13 10:25:44,746 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-13 10:25:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:45,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:25:45,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:45,480 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-13 10:25:45,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:25:45,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:45,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971486380] [2024-10-13 10:25:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971486380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:25:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:25:45,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:25:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897412326] [2024-10-13 10:25:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:25:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:25:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:25:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:25:45,484 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-13 10:25:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:45,694 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2024-10-13 10:25:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:25:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 112 [2024-10-13 10:25:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:45,697 INFO L225 Difference]: With dead ends: 215 [2024-10-13 10:25:45,697 INFO L226 Difference]: Without dead ends: 215 [2024-10-13 10:25:45,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-13 10:25:45,698 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:45,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 733 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:25:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-13 10:25:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-10-13 10:25:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 195 states have (on average 1.2666666666666666) internal successors, (247), 206 states have internal predecessors, (247), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:25:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2024-10-13 10:25:45,735 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 112 [2024-10-13 10:25:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:45,736 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2024-10-13 10:25:45,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-13 10:25:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2024-10-13 10:25:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 10:25:45,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:45,740 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] [2024-10-13 10:25:45,755 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-13 10:25:45,940 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-13 10:25:45,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:45,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:45,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1336085638, now seen corresponding path program 1 times [2024-10-13 10:25:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:45,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72603123] [2024-10-13 10:25:45,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:45,943 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-13 10:25:45,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:45,947 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-13 10:25:45,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:25:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:46,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:25:46,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:46,637 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-13 10:25:46,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:25:46,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72603123] [2024-10-13 10:25:46,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72603123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:25:46,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:25:46,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:25:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186656482] [2024-10-13 10:25:46,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:25:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:25:46,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:25:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:25:46,640 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-13 10:25:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:46,790 INFO L93 Difference]: Finished difference Result 209 states and 269 transitions. [2024-10-13 10:25:46,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:25:46,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 112 [2024-10-13 10:25:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:46,793 INFO L225 Difference]: With dead ends: 209 [2024-10-13 10:25:46,795 INFO L226 Difference]: Without dead ends: 209 [2024-10-13 10:25:46,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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-13 10:25:46,797 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:46,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:25:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-13 10:25:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-13 10:25:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 189 states have (on average 1.253968253968254) internal successors, (237), 200 states have internal predecessors, (237), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:25:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 269 transitions. [2024-10-13 10:25:46,812 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 269 transitions. Word has length 112 [2024-10-13 10:25:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:46,813 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 269 transitions. [2024-10-13 10:25:46,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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-13 10:25:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 269 transitions. [2024-10-13 10:25:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 10:25:46,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:46,817 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] [2024-10-13 10:25:46,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:25:47,018 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-13 10:25:47,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:47,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1634025464, now seen corresponding path program 1 times [2024-10-13 10:25:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:47,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091032360] [2024-10-13 10:25:47,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:47,022 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-13 10:25:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:47,025 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-13 10:25:47,027 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-13 10:25:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:47,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:25:47,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:47,907 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-13 10:25:47,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:25:47,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091032360] [2024-10-13 10:25:47,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091032360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:25:47,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:25:47,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:25:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653678808] [2024-10-13 10:25:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:25:47,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:25:47,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:47,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:25:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:25:47,911 INFO L87 Difference]: Start difference. First operand 209 states and 269 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-13 10:25:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:48,277 INFO L93 Difference]: Finished difference Result 245 states and 305 transitions. [2024-10-13 10:25:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:25:48,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 112 [2024-10-13 10:25:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:48,285 INFO L225 Difference]: With dead ends: 245 [2024-10-13 10:25:48,285 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 10:25:48,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 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-13 10:25:48,287 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:48,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:25:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 10:25:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-13 10:25:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 225 states have (on average 1.2133333333333334) internal successors, (273), 236 states have internal predecessors, (273), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:25:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2024-10-13 10:25:48,299 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 112 [2024-10-13 10:25:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:48,299 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 305 transitions. [2024-10-13 10:25:48,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-13 10:25:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 305 transitions. [2024-10-13 10:25:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 10:25:48,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:48,304 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] [2024-10-13 10:25:48,319 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-13 10:25:48,504 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-13 10:25:48,505 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:48,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1600948529, now seen corresponding path program 1 times [2024-10-13 10:25:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:48,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13259347] [2024-10-13 10:25:48,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:48,507 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-13 10:25:48,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:48,508 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-13 10:25:48,509 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-13 10:25:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:49,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:25:49,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:49,091 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-13 10:25:49,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:25:49,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:49,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13259347] [2024-10-13 10:25:49,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13259347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:25:49,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:25:49,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:25:49,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253507650] [2024-10-13 10:25:49,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:25:49,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:25:49,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:49,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:25:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:25:49,094 INFO L87 Difference]: Start difference. First operand 245 states and 305 transitions. Second operand has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:25:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:49,171 INFO L93 Difference]: Finished difference Result 247 states and 309 transitions. [2024-10-13 10:25:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:25:49,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2024-10-13 10:25:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:49,174 INFO L225 Difference]: With dead ends: 247 [2024-10-13 10:25:49,174 INFO L226 Difference]: Without dead ends: 247 [2024-10-13 10:25:49,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 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-13 10:25:49,175 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:49,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:25:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-13 10:25:49,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-13 10:25:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 238 states have internal predecessors, (275), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:25:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2024-10-13 10:25:49,185 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 125 [2024-10-13 10:25:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:49,186 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2024-10-13 10:25:49,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:25:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2024-10-13 10:25:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 10:25:49,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:49,190 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] [2024-10-13 10:25:49,203 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-13 10:25:49,390 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-13 10:25:49,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:49,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1857742555, now seen corresponding path program 1 times [2024-10-13 10:25:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:49,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834729675] [2024-10-13 10:25:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:49,392 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-13 10:25:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:49,393 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-13 10:25:49,394 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-13 10:25:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:49,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:25:49,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:50,031 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-13 10:25:50,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:25:50,177 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-13 10:25:50,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:50,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834729675] [2024-10-13 10:25:50,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834729675] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:25:50,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:25:50,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:25:50,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339444469] [2024-10-13 10:25:50,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:25:50,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:25:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:50,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:25:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:25:50,181 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:25:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:50,463 INFO L93 Difference]: Finished difference Result 256 states and 324 transitions. [2024-10-13 10:25:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:25:50,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 127 [2024-10-13 10:25:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:50,466 INFO L225 Difference]: With dead ends: 256 [2024-10-13 10:25:50,466 INFO L226 Difference]: Without dead ends: 256 [2024-10-13 10:25:50,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:25:50,467 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 5 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:50,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1032 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:25:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-13 10:25:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2024-10-13 10:25:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 233 states have (on average 1.2360515021459229) internal successors, (288), 245 states have internal predecessors, (288), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:25:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 322 transitions. [2024-10-13 10:25:50,477 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 322 transitions. Word has length 127 [2024-10-13 10:25:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:50,478 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 322 transitions. [2024-10-13 10:25:50,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:25:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2024-10-13 10:25:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 10:25:50,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:50,484 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] [2024-10-13 10:25:50,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 10:25:50,685 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-13 10:25:50,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:50,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1505795791, now seen corresponding path program 2 times [2024-10-13 10:25:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:50,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160122424] [2024-10-13 10:25:50,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:25:50,687 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-13 10:25:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:50,689 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-13 10:25:50,690 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-13 10:25:51,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:25:51,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:25:51,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:25:51,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:51,557 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-13 10:25:51,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:25:51,927 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-13 10:25:51,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160122424] [2024-10-13 10:25:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160122424] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:25:51,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:25:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:25:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519156052] [2024-10-13 10:25:51,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:25:51,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:25:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:25:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:25:51,931 INFO L87 Difference]: Start difference. First operand 255 states and 322 transitions. Second operand has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:25:52,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:52,717 INFO L93 Difference]: Finished difference Result 267 states and 342 transitions. [2024-10-13 10:25:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:25:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-10-13 10:25:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:52,720 INFO L225 Difference]: With dead ends: 267 [2024-10-13 10:25:52,720 INFO L226 Difference]: Without dead ends: 265 [2024-10-13 10:25:52,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:25:52,721 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 7 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:52,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1804 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:25:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-13 10:25:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2024-10-13 10:25:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 242 states have (on average 1.2396694214876034) internal successors, (300), 254 states have internal predecessors, (300), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:25:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 334 transitions. [2024-10-13 10:25:52,736 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 334 transitions. Word has length 131 [2024-10-13 10:25:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:52,737 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 334 transitions. [2024-10-13 10:25:52,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:25:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 334 transitions. [2024-10-13 10:25:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 10:25:52,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:52,741 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] [2024-10-13 10:25:52,758 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-13 10:25:52,945 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-13 10:25:52,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1068976461, now seen corresponding path program 3 times [2024-10-13 10:25:52,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:52,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429696380] [2024-10-13 10:25:52,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:25:52,947 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-13 10:25:52,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:52,949 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-13 10:25:52,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:25:53,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:25:53,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:25:53,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:25:53,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-13 10:25:53,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:25:53,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429696380] [2024-10-13 10:25:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429696380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:25:53,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:25:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:25:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37007404] [2024-10-13 10:25:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:25:53,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:25:53,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:53,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:25:53,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:25:53,644 INFO L87 Difference]: Start difference. First operand 264 states and 334 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:25:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:53,775 INFO L93 Difference]: Finished difference Result 267 states and 329 transitions. [2024-10-13 10:25:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:25:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 140 [2024-10-13 10:25:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:53,779 INFO L225 Difference]: With dead ends: 267 [2024-10-13 10:25:53,779 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 10:25:53,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 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-13 10:25:53,780 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 30 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:53,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 688 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:25:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 10:25:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-13 10:25:53,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 245 states have (on average 1.2040816326530612) internal successors, (295), 257 states have internal predecessors, (295), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:25:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 329 transitions. [2024-10-13 10:25:53,791 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 329 transitions. Word has length 140 [2024-10-13 10:25:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 329 transitions. [2024-10-13 10:25:53,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:25:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 329 transitions. [2024-10-13 10:25:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 10:25:53,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:53,794 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] [2024-10-13 10:25:53,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:25:53,997 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-13 10:25:53,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:53,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1163749671, now seen corresponding path program 1 times [2024-10-13 10:25:53,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:53,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942979861] [2024-10-13 10:25:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:25:53,999 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-13 10:25:53,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:54,002 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-13 10:25:54,004 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-13 10:25:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:25:54,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:25:54,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:54,869 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-13 10:25:54,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:25:55,660 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-13 10:25:55,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:25:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942979861] [2024-10-13 10:25:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942979861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:25:55,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:25:55,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:25:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439869925] [2024-10-13 10:25:55,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:25:55,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:25:55,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:25:55,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:25:55,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:25:55,664 INFO L87 Difference]: Start difference. First operand 267 states and 329 transitions. Second operand has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:25:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:25:57,907 INFO L93 Difference]: Finished difference Result 288 states and 367 transitions. [2024-10-13 10:25:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:25:57,908 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 140 [2024-10-13 10:25:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:25:57,910 INFO L225 Difference]: With dead ends: 288 [2024-10-13 10:25:57,910 INFO L226 Difference]: Without dead ends: 286 [2024-10-13 10:25:57,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:25:57,911 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 14 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:25:57,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3203 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 10:25:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-13 10:25:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2024-10-13 10:25:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 263 states have (on average 1.2129277566539924) internal successors, (319), 275 states have internal predecessors, (319), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:25:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 353 transitions. [2024-10-13 10:25:57,920 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 353 transitions. Word has length 140 [2024-10-13 10:25:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:25:57,920 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 353 transitions. [2024-10-13 10:25:57,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:25:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 353 transitions. [2024-10-13 10:25:57,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 10:25:57,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:25:57,922 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] [2024-10-13 10:25:57,941 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-13 10:25:58,123 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-13 10:25:58,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:25:58,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:25:58,124 INFO L85 PathProgramCache]: Analyzing trace with hash -580157145, now seen corresponding path program 2 times [2024-10-13 10:25:58,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:25:58,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825574068] [2024-10-13 10:25:58,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:25:58,125 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-13 10:25:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:25:58,126 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-13 10:25:58,127 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-13 10:25:58,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:25:58,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:25:58,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:25:58,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:25:59,537 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-13 10:25:59,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:26:01,166 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-13 10:26:01,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:01,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825574068] [2024-10-13 10:26:01,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825574068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:26:01,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:26:01,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:26:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869741678] [2024-10-13 10:26:01,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:26:01,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:26:01,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:26:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:26:01,171 INFO L87 Difference]: Start difference. First operand 285 states and 353 transitions. Second operand has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:26:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:10,755 INFO L93 Difference]: Finished difference Result 322 states and 423 transitions. [2024-10-13 10:26:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:26:10,756 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 158 [2024-10-13 10:26:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:10,757 INFO L225 Difference]: With dead ends: 322 [2024-10-13 10:26:10,757 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 10:26:10,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:26:10,760 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 25 mSDsluCounter, 6146 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6396 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:10,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6396 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 10:26:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 10:26:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-10-13 10:26:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 297 states have (on average 1.228956228956229) internal successors, (365), 309 states have internal predecessors, (365), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:26:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 399 transitions. [2024-10-13 10:26:10,769 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 399 transitions. Word has length 158 [2024-10-13 10:26:10,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:10,769 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 399 transitions. [2024-10-13 10:26:10,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:26:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 399 transitions. [2024-10-13 10:26:10,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 10:26:10,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:10,772 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] [2024-10-13 10:26:10,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 10:26:10,972 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-13 10:26:10,973 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:10,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1005849319, now seen corresponding path program 3 times [2024-10-13 10:26:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643966387] [2024-10-13 10:26:10,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:26:10,975 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-13 10:26:10,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:10,976 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-13 10:26:10,977 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-13 10:26:11,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:26:11,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:26:11,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:26:11,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:11,766 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-13 10:26:11,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:26:11,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:11,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643966387] [2024-10-13 10:26:11,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643966387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:26:11,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:26:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:26:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610554862] [2024-10-13 10:26:11,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:26:11,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:26:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:26:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:26:11,769 INFO L87 Difference]: Start difference. First operand 319 states and 399 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:26:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:11,894 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2024-10-13 10:26:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:26:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 192 [2024-10-13 10:26:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:11,898 INFO L225 Difference]: With dead ends: 313 [2024-10-13 10:26:11,898 INFO L226 Difference]: Without dead ends: 313 [2024-10-13 10:26:11,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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-13 10:26:11,899 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:11,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:26:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-13 10:26:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-10-13 10:26:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 291 states have (on average 1.2199312714776633) internal successors, (355), 303 states have internal predecessors, (355), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:26:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 389 transitions. [2024-10-13 10:26:11,912 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 389 transitions. Word has length 192 [2024-10-13 10:26:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:11,913 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 389 transitions. [2024-10-13 10:26:11,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:26:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 389 transitions. [2024-10-13 10:26:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 10:26:11,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:11,914 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] [2024-10-13 10:26:11,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:26:12,115 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-13 10:26:12,116 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 731089705, now seen corresponding path program 1 times [2024-10-13 10:26:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91766719] [2024-10-13 10:26:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:26:12,119 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-13 10:26:12,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:12,122 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-13 10:26:12,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 (14)] Waiting until timeout for monitored process [2024-10-13 10:26:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:26:13,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:26:13,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:14,353 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-13 10:26:14,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:26:16,782 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-13 10:26:16,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:16,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91766719] [2024-10-13 10:26:16,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91766719] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:26:16,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:26:16,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:26:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792506763] [2024-10-13 10:26:16,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:26:16,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:26:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:16,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:26:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:26:16,786 INFO L87 Difference]: Start difference. First operand 313 states and 389 transitions. Second operand has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:26:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:26:25,385 INFO L93 Difference]: Finished difference Result 340 states and 443 transitions. [2024-10-13 10:26:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:26:25,386 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 192 [2024-10-13 10:26:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:26:25,388 INFO L225 Difference]: With dead ends: 340 [2024-10-13 10:26:25,388 INFO L226 Difference]: Without dead ends: 340 [2024-10-13 10:26:25,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:26:25,391 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 27 mSDsluCounter, 6004 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6249 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:26:25,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6249 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 10:26:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-13 10:26:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2024-10-13 10:26:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 316 states have (on average 1.2816455696202531) internal successors, (405), 328 states have internal predecessors, (405), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:26:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2024-10-13 10:26:25,401 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 192 [2024-10-13 10:26:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:26:25,401 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2024-10-13 10:26:25,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:26:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2024-10-13 10:26:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-13 10:26:25,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:26:25,404 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] [2024-10-13 10:26:25,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 10:26:25,604 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-13 10:26:25,604 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:26:25,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:26:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 635431941, now seen corresponding path program 2 times [2024-10-13 10:26:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:26:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946515821] [2024-10-13 10:26:25,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:26:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:26:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:26:25,607 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-13 10:26:25,609 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-13 10:26:27,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:26:27,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:26:27,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:26:27,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:26:29,573 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-13 10:26:29,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:26:37,454 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-13 10:26:37,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:26:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946515821] [2024-10-13 10:26:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946515821] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:26:37,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:26:37,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-13 10:26:37,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212306355] [2024-10-13 10:26:37,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:26:37,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-13 10:26:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:26:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-13 10:26:37,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-13 10:26:37,460 INFO L87 Difference]: Start difference. First operand 338 states and 439 transitions. Second operand has 102 states, 100 states have (on average 2.2) internal successors, (220), 102 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)