./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_OAT_test1-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_OAT_test1-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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:18:23,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:18:23,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:18:23,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:18:23,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:18:23,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:18:23,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:18:23,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:18:23,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:18:23,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:18:23,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:18:23,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:18:23,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:18:23,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:18:23,669 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:18:23,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:18:23,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:18:23,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:18:23,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:18:23,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:18:23,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:18:23,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:18:23,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:18:23,676 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:18:23,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:18:23,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:18:23,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:18:23,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:18:23,677 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:18:23,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:18:23,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:18:23,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:18:23,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:18:23,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:18:23,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:18:23,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:18:23,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:18:23,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:18:23,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:18:23,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:18:23,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:18:23,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:18:23,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:18:23,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:18:23,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:18:23,682 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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2024-10-13 10:18:23,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:18:24,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:18:24,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:18:24,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:18:24,013 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:18:24,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2024-10-13 10:18:25,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:18:25,800 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:18:25,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2024-10-13 10:18:25,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efeb10a6c/243ceaa39a3c4323a5b6de0b34158c41/FLAGd9adea452 [2024-10-13 10:18:25,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efeb10a6c/243ceaa39a3c4323a5b6de0b34158c41 [2024-10-13 10:18:25,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:18:25,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:18:25,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:25,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:18:25,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:18:25,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:25" (1/1) ... [2024-10-13 10:18:25,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2085a7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:25, skipping insertion in model container [2024-10-13 10:18:25,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:25" (1/1) ... [2024-10-13 10:18:25,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:18:26,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:26,403 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:18:26,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54cb6aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:26, skipping insertion in model container [2024-10-13 10:18:26,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:26,405 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:18:26,407 INFO L158 Benchmark]: Toolchain (without parser) took 564.46ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 119.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:18:26,408 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:18:26,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.21ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 119.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:18:26,409 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.20ms. Allocated memory is still 169.9MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.21ms. Allocated memory is still 169.9MB. Free memory was 137.7MB in the beginning and 119.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: 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_OAT_test1-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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:18:28,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:18:28,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:18:28,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:18:28,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:18:28,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:18:28,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:18:28,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:18:28,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:18:28,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:18:28,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:18:28,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:18:28,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:18:28,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:18:28,488 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:18:28,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:18:28,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:18:28,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:18:28,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:18:28,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:18:28,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:18:28,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:18:28,497 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:18:28,497 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:18:28,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:18:28,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:18:28,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:18:28,498 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:18:28,498 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:18:28,499 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:18:28,499 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:18:28,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:18:28,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:18:28,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:18:28,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:18:28,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:18:28,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:18:28,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:18:28,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:18:28,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:18:28,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:18:28,503 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:18:28,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:18:28,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:18:28,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:18:28,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:18:28,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:18:28,504 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:18:28,504 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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2024-10-13 10:18:28,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:18:28,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:18:28,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:18:28,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:18:28,857 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:18:28,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2024-10-13 10:18:30,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:18:30,657 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:18:30,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2024-10-13 10:18:30,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d149227/0774b1f9b2ed41be85d91e9bc61bdd37/FLAG58ec3dae8 [2024-10-13 10:18:30,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d149227/0774b1f9b2ed41be85d91e9bc61bdd37 [2024-10-13 10:18:30,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:18:30,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:18:30,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:30,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:18:30,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:18:30,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:30" (1/1) ... [2024-10-13 10:18:30,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304c6b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:30, skipping insertion in model container [2024-10-13 10:18:30,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:18:30" (1/1) ... [2024-10-13 10:18:30,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:18:31,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:31,330 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:18:31,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:18:31,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:31,422 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:18:31,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:18:31,557 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:18:31,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31 WrapperNode [2024-10-13 10:18:31,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:18:31,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:18:31,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:18:31,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:18:31,566 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:18:31" (1/1) ... [2024-10-13 10:18:31,604 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:18:31" (1/1) ... [2024-10-13 10:18:31,657 INFO L138 Inliner]: procedures = 179, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 634 [2024-10-13 10:18:31,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:18:31,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:18:31,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:18:31,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:18:31,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,740 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-10-13 10:18:31,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:18:31,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:18:31,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:18:31,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:18:31,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (1/1) ... [2024-10-13 10:18:31,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:18:31,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:18:31,851 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:18:31,855 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:18:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:18:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:18:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:18:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:18:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:18:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:18:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:18:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:18:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:18:31,912 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:18:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:18:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:18:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:18:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:18:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:18:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:18:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:18:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:18:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:18:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:18:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:18:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:18:31,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:18:32,123 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:18:32,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:18:38,905 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-13 10:18:38,905 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:18:38,941 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:18:38,942 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-13 10:18:38,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:18:38 BoogieIcfgContainer [2024-10-13 10:18:38,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:18:38,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:18:38,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:18:38,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:18:38,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:18:30" (1/3) ... [2024-10-13 10:18:38,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f754529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:18:38, skipping insertion in model container [2024-10-13 10:18:38,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:18:31" (2/3) ... [2024-10-13 10:18:38,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f754529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:18:38, skipping insertion in model container [2024-10-13 10:18:38,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:18:38" (3/3) ... [2024-10-13 10:18:38,952 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-1.i [2024-10-13 10:18:38,968 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:18:38,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:18:39,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:18:39,031 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;@7cf474ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:18:39,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:18:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 122 states have internal predecessors, (185), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:18:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:18:39,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:39,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:18:39,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:39,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1034799541, now seen corresponding path program 1 times [2024-10-13 10:18:39,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:39,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058506416] [2024-10-13 10:18:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:39,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:18:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:39,064 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:18:39,066 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:18:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:39,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:18:39,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:39,207 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:18:39,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:18:39,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:39,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058506416] [2024-10-13 10:18:39,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058506416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:18:39,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:18:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:18:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686295082] [2024-10-13 10:18:39,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:18:39,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:18:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:18:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:18:39,247 INFO L87 Difference]: Start difference. First operand has 128 states, 110 states have (on average 1.6818181818181819) internal successors, (185), 122 states have internal predecessors, (185), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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:18:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:39,288 INFO L93 Difference]: Finished difference Result 127 states and 173 transitions. [2024-10-13 10:18:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:18:39,291 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:18:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:39,301 INFO L225 Difference]: With dead ends: 127 [2024-10-13 10:18:39,301 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 10:18:39,304 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:18:39,308 INFO L432 NwaCegarLoop]: 169 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, 169 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:18:39,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:18:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 10:18:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-13 10:18:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 120 states have internal predecessors, (146), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:18:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2024-10-13 10:18:39,355 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 6 [2024-10-13 10:18:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:39,356 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2024-10-13 10:18:39,356 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:18:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2024-10-13 10:18:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:18:39,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:39,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:18:39,360 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:18:39,559 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:18:39,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1371028455, now seen corresponding path program 1 times [2024-10-13 10:18:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158512901] [2024-10-13 10:18:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:39,561 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:18:39,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:39,565 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:18:39,566 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:18:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:39,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:18:39,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:39,688 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:18:39,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:18:39,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:39,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158512901] [2024-10-13 10:18:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158512901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:18:39,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:18:39,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:18:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582200719] [2024-10-13 10:18:39,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:18:39,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:18:39,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:39,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:18:39,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:18:39,694 INFO L87 Difference]: Start difference. First operand 126 states and 172 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:18:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:39,884 INFO L93 Difference]: Finished difference Result 215 states and 287 transitions. [2024-10-13 10:18:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:18:39,885 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:18:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:39,888 INFO L225 Difference]: With dead ends: 215 [2024-10-13 10:18:39,889 INFO L226 Difference]: Without dead ends: 215 [2024-10-13 10:18:39,889 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:18:39,890 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 108 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 331 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:18:39,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 331 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:18:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-13 10:18:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 127. [2024-10-13 10:18:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 121 states have internal predecessors, (147), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:18:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2024-10-13 10:18:39,907 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 6 [2024-10-13 10:18:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:39,907 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2024-10-13 10:18:39,907 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:18:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2024-10-13 10:18:39,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 10:18:39,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:39,909 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] [2024-10-13 10:18:39,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:18:40,110 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:18:40,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:40,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2017767010, now seen corresponding path program 1 times [2024-10-13 10:18:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:40,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282779510] [2024-10-13 10:18:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:40,115 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:18:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:40,118 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:18:40,120 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:18:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:40,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:18:40,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:40,502 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:18:40,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:18:40,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:40,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282779510] [2024-10-13 10:18:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282779510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:18:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:18:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:18:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462250243] [2024-10-13 10:18:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:18:40,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:18:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:18:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:18:40,509 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:18:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:40,679 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2024-10-13 10:18:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:18:40,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-10-13 10:18:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:40,681 INFO L225 Difference]: With dead ends: 130 [2024-10-13 10:18:40,682 INFO L226 Difference]: Without dead ends: 130 [2024-10-13 10:18:40,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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:18:40,683 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 30 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 400 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:18:40,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 400 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:18:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-13 10:18:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-13 10:18:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 113 states have (on average 1.2566371681415929) internal successors, (142), 124 states have internal predecessors, (142), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:18:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2024-10-13 10:18:40,693 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 61 [2024-10-13 10:18:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:40,693 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2024-10-13 10:18:40,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:18:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2024-10-13 10:18:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 10:18:40,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:40,696 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] [2024-10-13 10:18:40,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:18:40,896 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:18:40,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:40,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1841140182, now seen corresponding path program 1 times [2024-10-13 10:18:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265145469] [2024-10-13 10:18:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:40,898 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:18:40,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:40,899 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:18:40,901 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:18:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:41,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:18:41,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:41,349 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:18:41,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:18:41,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:41,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265145469] [2024-10-13 10:18:41,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265145469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:18:41,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:18:41,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:18:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308505330] [2024-10-13 10:18:41,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:18:41,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:18:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:18:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:18:41,356 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:18:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:41,463 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2024-10-13 10:18:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:18:41,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 61 [2024-10-13 10:18:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:41,465 INFO L225 Difference]: With dead ends: 124 [2024-10-13 10:18:41,465 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 10:18:41,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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:18:41,466 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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:18:41,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:18:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 10:18:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-13 10:18:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.233644859813084) internal successors, (132), 118 states have internal predecessors, (132), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:18:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 158 transitions. [2024-10-13 10:18:41,484 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 158 transitions. Word has length 61 [2024-10-13 10:18:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:41,485 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 158 transitions. [2024-10-13 10:18:41,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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:18:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2024-10-13 10:18:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 10:18:41,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:41,490 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] [2024-10-13 10:18:41,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:18:41,691 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:18:41,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:41,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1566380568, now seen corresponding path program 1 times [2024-10-13 10:18:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:41,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566302787] [2024-10-13 10:18:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:41,693 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:18:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:41,696 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:18:41,697 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:18:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:41,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:18:41,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:42,270 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:18:42,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:18:42,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:42,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566302787] [2024-10-13 10:18:42,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566302787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:18:42,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:18:42,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:18:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950607053] [2024-10-13 10:18:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:18:42,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:18:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:18:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:18:42,274 INFO L87 Difference]: Start difference. First operand 124 states and 158 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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:18:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:42,711 INFO L93 Difference]: Finished difference Result 160 states and 194 transitions. [2024-10-13 10:18:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:18:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2024-10-13 10:18:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:42,717 INFO L225 Difference]: With dead ends: 160 [2024-10-13 10:18:42,717 INFO L226 Difference]: Without dead ends: 160 [2024-10-13 10:18:42,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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:18:42,718 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:18:42,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:18:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-13 10:18:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-13 10:18:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1748251748251748) internal successors, (168), 154 states have internal predecessors, (168), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-13 10:18:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2024-10-13 10:18:42,735 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 61 [2024-10-13 10:18:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:42,736 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2024-10-13 10:18:42,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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:18:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2024-10-13 10:18:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 10:18:42,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:42,738 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] [2024-10-13 10:18:42,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:18:42,939 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:18:42,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:42,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash -536084267, now seen corresponding path program 1 times [2024-10-13 10:18:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:42,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972511855] [2024-10-13 10:18:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:42,941 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:18:42,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:42,944 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:18:42,944 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:18:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:43,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:18:43,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:43,381 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:18:43,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:18:43,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:43,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972511855] [2024-10-13 10:18:43,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972511855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:18:43,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:18:43,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:18:43,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776130007] [2024-10-13 10:18:43,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:18:43,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:18:43,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:18:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:18:43,384 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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:18:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:43,428 INFO L93 Difference]: Finished difference Result 162 states and 197 transitions. [2024-10-13 10:18:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:18:43,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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 74 [2024-10-13 10:18:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:43,431 INFO L225 Difference]: With dead ends: 162 [2024-10-13 10:18:43,431 INFO L226 Difference]: Without dead ends: 162 [2024-10-13 10:18:43,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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:18:43,432 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:18:43,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:18:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-13 10:18:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-13 10:18:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 156 states have internal predecessors, (170), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:18:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 197 transitions. [2024-10-13 10:18:43,439 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 197 transitions. Word has length 74 [2024-10-13 10:18:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:43,440 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 197 transitions. [2024-10-13 10:18:43,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.333333333333332) internal successors, (70), 4 states have internal predecessors, (70), 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:18:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 197 transitions. [2024-10-13 10:18:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 10:18:43,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:43,442 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] [2024-10-13 10:18:43,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 10:18:43,642 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:18:43,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1154606443, now seen corresponding path program 1 times [2024-10-13 10:18:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775105600] [2024-10-13 10:18:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:43,644 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:18:43,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:43,646 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:18:43,647 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:18:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:44,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:18:44,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:44,107 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:18:44,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:18:44,260 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:18:44,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:44,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775105600] [2024-10-13 10:18:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775105600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:18:44,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:18:44,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:18:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008195888] [2024-10-13 10:18:44,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:18:44,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:18:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:44,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:18:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:18:44,267 INFO L87 Difference]: Start difference. First operand 162 states and 197 transitions. Second operand has 8 states, 6 states have (on average 13.0) internal successors, (78), 8 states have internal predecessors, (78), 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:18:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:44,523 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2024-10-13 10:18:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:18:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.0) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2024-10-13 10:18:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:44,526 INFO L225 Difference]: With dead ends: 171 [2024-10-13 10:18:44,526 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 10:18:44,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 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:18:44,527 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 5 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:18:44,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 453 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:18:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 10:18:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2024-10-13 10:18:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 151 states have (on average 1.2119205298013245) internal successors, (183), 163 states have internal predecessors, (183), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:18:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2024-10-13 10:18:44,541 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 76 [2024-10-13 10:18:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:44,541 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2024-10-13 10:18:44,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.0) internal successors, (78), 8 states have internal predecessors, (78), 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:18:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2024-10-13 10:18:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-13 10:18:44,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:44,543 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] [2024-10-13 10:18:44,554 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:18:44,745 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:18:44,745 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:44,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 840237205, now seen corresponding path program 2 times [2024-10-13 10:18:44,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941450700] [2024-10-13 10:18:44,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:18:44,747 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:18:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:44,748 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:18:44,750 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:18:45,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:18:45,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:18:45,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:18:45,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:45,303 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:18:45,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:18:45,608 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:18:45,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:45,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941450700] [2024-10-13 10:18:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941450700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:18:45,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:18:45,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:18:45,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676643358] [2024-10-13 10:18:45,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:18:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:18:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:18:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:18:45,613 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 14 states, 12 states have (on average 7.0) internal successors, (84), 14 states have internal predecessors, (84), 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:18:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:46,439 INFO L93 Difference]: Finished difference Result 182 states and 229 transitions. [2024-10-13 10:18:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:18:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.0) internal successors, (84), 14 states have internal predecessors, (84), 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 80 [2024-10-13 10:18:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:46,442 INFO L225 Difference]: With dead ends: 182 [2024-10-13 10:18:46,442 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 10:18:46,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 146 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:18:46,443 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 8 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:18:46,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1196 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:18:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 10:18:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2024-10-13 10:18:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 160 states have (on average 1.21875) internal successors, (195), 172 states have internal predecessors, (195), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:18:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 222 transitions. [2024-10-13 10:18:46,458 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 222 transitions. Word has length 80 [2024-10-13 10:18:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:46,458 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 222 transitions. [2024-10-13 10:18:46,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.0) internal successors, (84), 14 states have internal predecessors, (84), 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:18:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 222 transitions. [2024-10-13 10:18:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 10:18:46,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:46,460 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] [2024-10-13 10:18:46,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:18:46,660 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:18:46,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:46,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:46,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1197294529, now seen corresponding path program 3 times [2024-10-13 10:18:46,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:46,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655378447] [2024-10-13 10:18:46,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:18:46,662 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:18:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:46,663 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:18:46,664 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:18:47,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:18:47,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:18:47,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:18:47,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:47,218 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:18:47,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:18:47,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655378447] [2024-10-13 10:18:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655378447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:18:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:18:47,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:18:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723410490] [2024-10-13 10:18:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:18:47,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:18:47,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:18:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:18:47,220 INFO L87 Difference]: Start difference. First operand 179 states and 222 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:18:51,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:18:55,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:18:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:18:56,965 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2024-10-13 10:18:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:18:56,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 89 [2024-10-13 10:18:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:18:56,968 INFO L225 Difference]: With dead ends: 201 [2024-10-13 10:18:56,968 INFO L226 Difference]: Without dead ends: 201 [2024-10-13 10:18:56,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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:18:56,969 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 143 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:18:56,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 305 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2024-10-13 10:18:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-13 10:18:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2024-10-13 10:18:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.2111801242236024) internal successors, (195), 173 states have internal predecessors, (195), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:18:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 222 transitions. [2024-10-13 10:18:56,978 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 222 transitions. Word has length 89 [2024-10-13 10:18:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:18:56,978 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 222 transitions. [2024-10-13 10:18:56,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:18:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 222 transitions. [2024-10-13 10:18:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 10:18:56,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:18:56,982 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] [2024-10-13 10:18:56,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:18:57,182 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:18:57,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:18:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:18:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash -299833534, now seen corresponding path program 1 times [2024-10-13 10:18:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:18:57,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123181451] [2024-10-13 10:18:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:18:57,184 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:18:57,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:18:57,185 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:18:57,186 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:18:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:18:57,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:18:57,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:18:57,891 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:18:57,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:18:58,564 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:18:58,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:18:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123181451] [2024-10-13 10:18:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123181451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:18:58,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:18:58,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:18:58,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057397467] [2024-10-13 10:18:58,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:18:58,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:18:58,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:18:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:18:58,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:18:58,570 INFO L87 Difference]: Start difference. First operand 180 states and 222 transitions. Second operand has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:01,093 INFO L93 Difference]: Finished difference Result 201 states and 259 transitions. [2024-10-13 10:19:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:19:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 93 [2024-10-13 10:19:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:01,095 INFO L225 Difference]: With dead ends: 201 [2024-10-13 10:19:01,096 INFO L226 Difference]: Without dead ends: 199 [2024-10-13 10:19:01,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:19:01,097 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 14 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:01,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1794 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 10:19:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-13 10:19:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2024-10-13 10:19:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.223463687150838) internal successors, (219), 191 states have internal predecessors, (219), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2024-10-13 10:19:01,103 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 93 [2024-10-13 10:19:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:01,104 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2024-10-13 10:19:01,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.125) internal successors, (99), 26 states have internal predecessors, (99), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2024-10-13 10:19:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 10:19:01,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:01,106 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] [2024-10-13 10:19:01,119 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:19:01,309 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:19:01,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:01,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -212365310, now seen corresponding path program 2 times [2024-10-13 10:19:01,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:01,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29181225] [2024-10-13 10:19:01,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:19:01,311 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:19:01,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:01,312 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:19:01,319 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:19:01,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:19:01,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:01,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:19:01,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:02,545 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:19:02,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:04,548 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:19:04,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:04,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29181225] [2024-10-13 10:19:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29181225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:04,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:04,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:19:04,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894718666] [2024-10-13 10:19:04,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:04,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:19:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:19:04,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:19:04,551 INFO L87 Difference]: Start difference. First operand 198 states and 246 transitions. Second operand has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:11,949 INFO L93 Difference]: Finished difference Result 235 states and 315 transitions. [2024-10-13 10:19:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:19:11,950 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 111 [2024-10-13 10:19:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:11,951 INFO L225 Difference]: With dead ends: 235 [2024-10-13 10:19:11,951 INFO L226 Difference]: Without dead ends: 233 [2024-10-13 10:19:11,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:19:11,954 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 25 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3582 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:11,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3582 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 10:19:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-13 10:19:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2024-10-13 10:19:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 213 states have (on average 1.244131455399061) internal successors, (265), 225 states have internal predecessors, (265), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-13 10:19:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 292 transitions. [2024-10-13 10:19:11,960 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 292 transitions. Word has length 111 [2024-10-13 10:19:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:11,961 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 292 transitions. [2024-10-13 10:19:11,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.5625) internal successors, (123), 50 states have internal predecessors, (123), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 292 transitions. [2024-10-13 10:19:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 10:19:11,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:11,962 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] [2024-10-13 10:19:11,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:19:12,163 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:19:12,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1672982210, now seen corresponding path program 3 times [2024-10-13 10:19:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356428272] [2024-10-13 10:19:12,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:19:12,165 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:19:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:12,166 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:19:12,167 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:19:12,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:19:12,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:12,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:19:12,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-13 10:19:12,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-13 10:19:12,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:12,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356428272] [2024-10-13 10:19:12,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356428272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:12,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:12,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 10:19:12,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109381121] [2024-10-13 10:19:12,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:12,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:19:12,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:12,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:19:12,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:19:12,916 INFO L87 Difference]: Start difference. First operand 232 states and 292 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:13,213 INFO L93 Difference]: Finished difference Result 425 states and 521 transitions. [2024-10-13 10:19:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:19:13,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 145 [2024-10-13 10:19:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:13,216 INFO L225 Difference]: With dead ends: 425 [2024-10-13 10:19:13,217 INFO L226 Difference]: Without dead ends: 425 [2024-10-13 10:19:13,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:19:13,217 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 325 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:13,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 740 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:19:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-13 10:19:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-10-13 10:19:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 403 states have (on average 1.2034739454094292) internal successors, (485), 415 states have internal predecessors, (485), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (20), 7 states have call predecessors, (20), 16 states have call successors, (20) [2024-10-13 10:19:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 521 transitions. [2024-10-13 10:19:13,228 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 521 transitions. Word has length 145 [2024-10-13 10:19:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:13,228 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 521 transitions. [2024-10-13 10:19:13,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:19:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 521 transitions. [2024-10-13 10:19:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-13 10:19:13,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:13,245 INFO L215 NwaCegarLoop]: trace histogram [67, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:19:13,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 10:19:13,445 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:19:13,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:13,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash -551535979, now seen corresponding path program 1 times [2024-10-13 10:19:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13646767] [2024-10-13 10:19:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:19:13,448 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:19:13,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:13,449 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:19:13,450 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:19:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:19:15,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 1955 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:19:15,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-13 10:19:15,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 1193 proven. 276 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-13 10:19:18,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:18,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13646767] [2024-10-13 10:19:18,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13646767] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:18,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:19:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053990310] [2024-10-13 10:19:18,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:18,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:19:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:18,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:19:18,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:19:18,103 INFO L87 Difference]: Start difference. First operand 425 states and 521 transitions. Second operand has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:19:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:19:25,821 INFO L93 Difference]: Finished difference Result 452 states and 579 transitions. [2024-10-13 10:19:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:19:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 310 [2024-10-13 10:19:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:19:25,824 INFO L225 Difference]: With dead ends: 452 [2024-10-13 10:19:25,824 INFO L226 Difference]: Without dead ends: 452 [2024-10-13 10:19:25,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:19:25,829 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 26 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:19:25,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3705 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 10:19:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-13 10:19:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2024-10-13 10:19:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 428 states have (on average 1.25) internal successors, (535), 440 states have internal predecessors, (535), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (20), 7 states have call predecessors, (20), 16 states have call successors, (20) [2024-10-13 10:19:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 571 transitions. [2024-10-13 10:19:25,843 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 571 transitions. Word has length 310 [2024-10-13 10:19:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:19:25,844 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 571 transitions. [2024-10-13 10:19:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.22) internal successors, (161), 52 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:19:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 571 transitions. [2024-10-13 10:19:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-13 10:19:25,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:19:25,848 INFO L215 NwaCegarLoop]: trace histogram [92, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:19:25,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:19:26,049 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:19:26,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:19:26,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:19:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash 433626303, now seen corresponding path program 2 times [2024-10-13 10:19:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:19:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310248361] [2024-10-13 10:19:26,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:19:26,053 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:19:26,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:19:26,056 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:19:26,057 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:19:28,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:19:28,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:19:28,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 2230 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:19:28,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:19:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-13 10:19:30,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:19:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4701 backedges. 2318 proven. 1176 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2024-10-13 10:19:36,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:19:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310248361] [2024-10-13 10:19:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310248361] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:19:36,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:19:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-13 10:19:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838649283] [2024-10-13 10:19:36,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:19:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-13 10:19:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:19:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-13 10:19:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-13 10:19:36,643 INFO L87 Difference]: Start difference. First operand 450 states and 571 transitions. Second operand has 102 states, 100 states have (on average 2.11) internal successors, (211), 102 states have internal predecessors, (211), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)