./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_test9-2.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_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:20:32,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:20:33,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:20:33,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:20:33,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:20:33,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:20:33,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:20:33,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:20:33,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:20:33,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:20:33,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:20:33,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:20:33,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:20:33,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:20:33,116 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:20:33,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:20:33,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:20:33,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:20:33,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:20:33,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:20:33,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:20:33,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:20:33,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:20:33,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:20:33,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:20:33,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:20:33,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:20:33,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:20:33,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:20:33,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:20:33,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:20:33,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:20:33,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:20:33,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:20:33,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:20:33,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:20:33,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:20:33,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:20:33,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:20:33,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:20:33,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:20:33,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:20:33,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:20:33,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:20:33,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:20:33,130 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 -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2024-10-13 10:20:33,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:20:33,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:20:33,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:20:33,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:20:33,444 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:20:33,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-10-13 10:20:34,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:20:35,335 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:20:35,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-10-13 10:20:35,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c512d57/a6aff325395c4c5dba1f79743b8bee48/FLAG0a9f72eb1 [2024-10-13 10:20:35,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c512d57/a6aff325395c4c5dba1f79743b8bee48 [2024-10-13 10:20:35,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:20:35,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:20:35,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:35,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:20:35,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:20:35,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:35" (1/1) ... [2024-10-13 10:20:35,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7566daef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:35, skipping insertion in model container [2024-10-13 10:20:35,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:35" (1/1) ... [2024-10-13 10:20:35,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:20:36,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:36,468 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:20:36,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c6e350f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:36, skipping insertion in model container [2024-10-13 10:20:36,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:36,470 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:20:36,472 INFO L158 Benchmark]: Toolchain (without parser) took 916.05ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 94.4MB in the beginning and 184.9MB in the end (delta: -90.5MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2024-10-13 10:20:36,472 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:20:36,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 913.90ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 94.0MB in the beginning and 184.9MB in the end (delta: -90.9MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2024-10-13 10:20:36,478 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 913.90ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 94.0MB in the beginning and 184.9MB in the end (delta: -90.9MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: 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_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:20:38,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:20:38,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:20:38,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:20:38,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:20:38,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:20:38,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:20:38,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:20:38,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:20:38,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:20:38,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:20:38,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:20:38,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:20:38,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:20:38,596 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:20:38,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:20:38,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:20:38,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:20:38,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:20:38,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:20:38,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:20:38,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:20:38,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:20:38,605 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:20:38,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:20:38,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:20:38,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:20:38,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:20:38,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:20:38,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:20:38,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:20:38,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:20:38,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:20:38,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:20:38,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:20:38,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:20:38,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:20:38,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:20:38,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:20:38,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:20:38,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:20:38,612 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:20:38,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:20:38,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:20:38,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:20:38,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:20:38,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:20:38,613 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:20:38,613 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 -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2024-10-13 10:20:38,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:20:38,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:20:38,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:20:38,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:20:38,979 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:20:38,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-10-13 10:20:40,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:20:41,010 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:20:41,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-10-13 10:20:41,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d13ef5cc/55887ff0a98f4be3801411cadc95cad3/FLAG553c85ebe [2024-10-13 10:20:41,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d13ef5cc/55887ff0a98f4be3801411cadc95cad3 [2024-10-13 10:20:41,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:20:41,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:20:41,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:41,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:20:41,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:20:41,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:41" (1/1) ... [2024-10-13 10:20:41,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b26d336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:41, skipping insertion in model container [2024-10-13 10:20:41,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:20:41" (1/1) ... [2024-10-13 10:20:41,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:20:41,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:41,874 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:20:41,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:20:42,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:42,070 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:20:42,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:20:42,248 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:20:42,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42 WrapperNode [2024-10-13 10:20:42,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:20:42,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:20:42,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:20:42,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:20:42,258 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:20:42" (1/1) ... [2024-10-13 10:20:42,310 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:20:42" (1/1) ... [2024-10-13 10:20:42,427 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3043 [2024-10-13 10:20:42,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:20:42,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:20:42,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:20:42,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:20:42,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,564 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [220, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-10-13 10:20:42,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:20:42,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:20:42,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:20:42,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:20:42,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (1/1) ... [2024-10-13 10:20:42,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:20:42,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:20:42,775 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:20:42,776 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:20:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:20:42,816 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:20:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:20:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:20:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 10:20:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:20:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:20:42,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:20:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:20:42,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:20:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:20:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:20:42,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 10:20:42,817 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:20:42,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:20:42,818 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 10:20:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:20:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:20:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:20:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:20:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:20:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:20:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:20:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:20:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:20:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:20:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:20:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:20:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:20:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:20:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:20:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 10:20:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:20:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:20:43,090 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:20:43,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:20:53,080 INFO L? ?]: Removed 638 outVars from TransFormulas that were not future-live. [2024-10-13 10:20:53,083 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:20:53,159 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:20:53,160 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 10:20:53,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:20:53 BoogieIcfgContainer [2024-10-13 10:20:53,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:20:53,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:20:53,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:20:53,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:20:53,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:20:41" (1/3) ... [2024-10-13 10:20:53,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77347457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:20:53, skipping insertion in model container [2024-10-13 10:20:53,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:20:42" (2/3) ... [2024-10-13 10:20:53,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77347457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:20:53, skipping insertion in model container [2024-10-13 10:20:53,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:20:53" (3/3) ... [2024-10-13 10:20:53,170 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-2.i [2024-10-13 10:20:53,188 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:20:53,188 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:20:53,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:20:53,274 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;@336d99d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:20:53,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:20:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-13 10:20:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:20:53,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:53,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:20:53,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:53,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1977665458, now seen corresponding path program 1 times [2024-10-13 10:20:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219014388] [2024-10-13 10:20:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:53,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:20:53,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:53,313 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:20:53,314 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:20:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:53,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:20:53,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:53,535 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:20:53,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:53,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:53,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219014388] [2024-10-13 10:20:53,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219014388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:53,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:20:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005182566] [2024-10-13 10:20:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:53,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:20:53,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:53,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:20:53,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:20:53,585 INFO L87 Difference]: Start difference. First operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:53,773 INFO L93 Difference]: Finished difference Result 1200 states and 2257 transitions. [2024-10-13 10:20:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:20:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:20:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:53,803 INFO L225 Difference]: With dead ends: 1200 [2024-10-13 10:20:53,803 INFO L226 Difference]: Without dead ends: 1199 [2024-10-13 10:20:53,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:20:53,808 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:53,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:20:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-10-13 10:20:54,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2024-10-13 10:20:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 690 states have (on average 1.808695652173913) internal successors, (1248), 1192 states have internal predecessors, (1248), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-13 10:20:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2256 transitions. [2024-10-13 10:20:54,157 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2256 transitions. Word has length 10 [2024-10-13 10:20:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:54,157 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 2256 transitions. [2024-10-13 10:20:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:20:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2256 transitions. [2024-10-13 10:20:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:20:54,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:54,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:20:54,164 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:20:54,359 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:20:54,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash 595513586, now seen corresponding path program 1 times [2024-10-13 10:20:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342350844] [2024-10-13 10:20:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:54,362 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:20:54,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:54,363 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:20:54,365 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:20:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:54,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:20:54,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:54,638 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:20:54,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:54,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342350844] [2024-10-13 10:20:54,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342350844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:54,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:54,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:20:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492259616] [2024-10-13 10:20:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:20:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:54,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:20:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:20:54,643 INFO L87 Difference]: Start difference. First operand 1199 states and 2256 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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:20:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:55,480 INFO L93 Difference]: Finished difference Result 2319 states and 4412 transitions. [2024-10-13 10:20:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:20:55,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-10-13 10:20:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:55,498 INFO L225 Difference]: With dead ends: 2319 [2024-10-13 10:20:55,498 INFO L226 Difference]: Without dead ends: 2319 [2024-10-13 10:20:55,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:20:55,500 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 1146 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:55,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 4467 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:20:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-10-13 10:20:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2288. [2024-10-13 10:20:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 1279 states have (on average 1.8483189992181392) internal successors, (2364), 2281 states have internal predecessors, (2364), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 10:20:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 4372 transitions. [2024-10-13 10:20:55,792 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 4372 transitions. Word has length 12 [2024-10-13 10:20:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:55,793 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 4372 transitions. [2024-10-13 10:20:55,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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:20:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 4372 transitions. [2024-10-13 10:20:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:20:55,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:55,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:20:55,799 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:20:55,994 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:20:55,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:20:55,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:20:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash 597360628, now seen corresponding path program 1 times [2024-10-13 10:20:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:20:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971783185] [2024-10-13 10:20:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:20:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:20:55,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:20:56,001 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:20:56,002 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:20:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:20:56,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:20:56,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:20:56,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:20:56,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:20:56,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:20:56,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:20:56,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:20:56,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:20:56,307 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:20:56,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:20:56,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:20:56,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971783185] [2024-10-13 10:20:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971783185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:20:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:20:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:20:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092033558] [2024-10-13 10:20:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:20:56,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:20:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:20:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:20:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:20:56,311 INFO L87 Difference]: Start difference. First operand 2288 states and 4372 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:20:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:20:59,283 INFO L93 Difference]: Finished difference Result 4434 states and 8563 transitions. [2024-10-13 10:20:59,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:20:59,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-13 10:20:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:20:59,312 INFO L225 Difference]: With dead ends: 4434 [2024-10-13 10:20:59,312 INFO L226 Difference]: Without dead ends: 4434 [2024-10-13 10:20:59,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:20:59,316 INFO L432 NwaCegarLoop]: 2467 mSDtfsCounter, 1229 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:20:59,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 6661 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 10:20:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2024-10-13 10:20:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 2287. [2024-10-13 10:20:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1278 states have (on average 1.8482003129890454) internal successors, (2362), 2280 states have internal predecessors, (2362), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 10:20:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 4370 transitions. [2024-10-13 10:20:59,872 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 4370 transitions. Word has length 12 [2024-10-13 10:20:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:20:59,873 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 4370 transitions. [2024-10-13 10:20:59,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:20:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 4370 transitions. [2024-10-13 10:20:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 10:20:59,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:20:59,878 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:20:59,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:21:00,082 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:21:00,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:00,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1374754777, now seen corresponding path program 1 times [2024-10-13 10:21:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:00,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884385770] [2024-10-13 10:21:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:21:00,086 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:21:00,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:00,090 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:21:00,091 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:21:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:00,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:21:00,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:21:00,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:21:00,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:00,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884385770] [2024-10-13 10:21:00,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884385770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:21:00,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:21:00,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:21:00,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758343204] [2024-10-13 10:21:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:21:00,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:21:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:21:00,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:21:00,659 INFO L87 Difference]: Start difference. First operand 2287 states and 4370 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:21:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:00,892 INFO L93 Difference]: Finished difference Result 2293 states and 4360 transitions. [2024-10-13 10:21:00,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:21:00,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 81 [2024-10-13 10:21:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:00,905 INFO L225 Difference]: With dead ends: 2293 [2024-10-13 10:21:00,905 INFO L226 Difference]: Without dead ends: 2293 [2024-10-13 10:21:00,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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:21:00,906 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 30 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:00,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6649 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:21:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2024-10-13 10:21:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2293. [2024-10-13 10:21:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1284 states have (on average 1.8317757009345794) internal successors, (2352), 2286 states have internal predecessors, (2352), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-13 10:21:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 4360 transitions. [2024-10-13 10:21:01,145 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 4360 transitions. Word has length 81 [2024-10-13 10:21:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:01,145 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 4360 transitions. [2024-10-13 10:21:01,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:21:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 4360 transitions. [2024-10-13 10:21:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 10:21:01,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:01,151 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:01,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:21:01,351 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:21:01,352 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:01,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1298794701, now seen corresponding path program 1 times [2024-10-13 10:21:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:01,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418477715] [2024-10-13 10:21:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:21:01,354 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:21:01,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:01,360 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:21:01,364 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:21:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:01,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:21:01,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:21:01,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:21:01,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418477715] [2024-10-13 10:21:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418477715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:21:01,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:21:01,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:21:01,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795382938] [2024-10-13 10:21:01,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:21:01,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:21:01,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:01,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:21:01,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:21:01,866 INFO L87 Difference]: Start difference. First operand 2293 states and 4360 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 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:21:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:01,985 INFO L93 Difference]: Finished difference Result 2295 states and 4363 transitions. [2024-10-13 10:21:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:21:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 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 81 [2024-10-13 10:21:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:01,999 INFO L225 Difference]: With dead ends: 2295 [2024-10-13 10:21:02,000 INFO L226 Difference]: Without dead ends: 2295 [2024-10-13 10:21:02,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 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:21:02,001 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 0 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:02,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6713 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:21:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2024-10-13 10:21:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2295. [2024-10-13 10:21:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1285 states have (on average 1.8319066147859921) internal successors, (2354), 2288 states have internal predecessors, (2354), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 10:21:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4363 transitions. [2024-10-13 10:21:02,350 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4363 transitions. Word has length 81 [2024-10-13 10:21:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:02,352 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 4363 transitions. [2024-10-13 10:21:02,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 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:21:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4363 transitions. [2024-10-13 10:21:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 10:21:02,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:02,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:02,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 10:21:02,558 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:21:02,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:02,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1386407081, now seen corresponding path program 1 times [2024-10-13 10:21:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825032264] [2024-10-13 10:21:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:21:02,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:21:02,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:02,564 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:21:02,565 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:21:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:03,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:21:03,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:21:03,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:21:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:21:03,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825032264] [2024-10-13 10:21:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825032264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:21:03,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:21:03,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:21:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258072281] [2024-10-13 10:21:03,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:21:03,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:21:03,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:21:03,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:21:03,267 INFO L87 Difference]: Start difference. First operand 2295 states and 4363 transitions. Second operand has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 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:21:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:03,560 INFO L93 Difference]: Finished difference Result 2304 states and 4377 transitions. [2024-10-13 10:21:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:21:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 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 83 [2024-10-13 10:21:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:03,573 INFO L225 Difference]: With dead ends: 2304 [2024-10-13 10:21:03,573 INFO L226 Difference]: Without dead ends: 2304 [2024-10-13 10:21:03,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:21:03,574 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 4 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:03,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6713 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:21:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-10-13 10:21:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2303. [2024-10-13 10:21:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1292 states have (on average 1.8320433436532508) internal successors, (2367), 2295 states have internal predecessors, (2367), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-13 10:21:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4376 transitions. [2024-10-13 10:21:03,865 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4376 transitions. Word has length 83 [2024-10-13 10:21:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:03,866 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 4376 transitions. [2024-10-13 10:21:03,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 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:21:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4376 transitions. [2024-10-13 10:21:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 10:21:03,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:03,868 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:03,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:21:04,068 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:21:04,068 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:04,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 938234707, now seen corresponding path program 2 times [2024-10-13 10:21:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:04,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724874363] [2024-10-13 10:21:04,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:21:04,070 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:21:04,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:04,074 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:21:04,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:21:04,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:21:04,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:21:04,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:21:04,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 10:21:04,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:21:04,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724874363] [2024-10-13 10:21:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724874363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:21:04,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:21:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:21:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062380533] [2024-10-13 10:21:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:21:04,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:21:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:04,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:21:04,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:21:04,431 INFO L87 Difference]: Start difference. First operand 2303 states and 4376 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:21:08,892 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:21:12,902 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:21:14,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:21:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:19,995 INFO L93 Difference]: Finished difference Result 3435 states and 6550 transitions. [2024-10-13 10:21:19,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:21:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 87 [2024-10-13 10:21:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:20,016 INFO L225 Difference]: With dead ends: 3435 [2024-10-13 10:21:20,017 INFO L226 Difference]: Without dead ends: 3435 [2024-10-13 10:21:20,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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:21:20,018 INFO L432 NwaCegarLoop]: 2310 mSDtfsCounter, 3542 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 895 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4045 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:20,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4045 Valid, 4516 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 618 Invalid, 2 Unknown, 0 Unchecked, 15.4s Time] [2024-10-13 10:21:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2024-10-13 10:21:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3410. [2024-10-13 10:21:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 1898 states have (on average 1.8461538461538463) internal successors, (3504), 3401 states have internal predecessors, (3504), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-13 10:21:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 6516 transitions. [2024-10-13 10:21:20,441 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 6516 transitions. Word has length 87 [2024-10-13 10:21:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:20,442 INFO L471 AbstractCegarLoop]: Abstraction has 3410 states and 6516 transitions. [2024-10-13 10:21:20,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:21:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 6516 transitions. [2024-10-13 10:21:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 10:21:20,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:20,444 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:20,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:21:20,644 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:21:20,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2129186946, now seen corresponding path program 1 times [2024-10-13 10:21:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975699671] [2024-10-13 10:21:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:21:20,647 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:21:20,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:20,651 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:21:20,653 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:21:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:21,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:21:21,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:21:21,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:21:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:21:21,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:21,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975699671] [2024-10-13 10:21:21,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975699671] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:21:21,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:21:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:21:21,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175072184] [2024-10-13 10:21:21,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:21:21,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:21:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:21,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:21:21,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:21:21,516 INFO L87 Difference]: Start difference. First operand 3410 states and 6516 transitions. Second operand has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 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:21:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:22,435 INFO L93 Difference]: Finished difference Result 3422 states and 6536 transitions. [2024-10-13 10:21:22,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:21:22,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 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 96 [2024-10-13 10:21:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:22,467 INFO L225 Difference]: With dead ends: 3422 [2024-10-13 10:21:22,467 INFO L226 Difference]: Without dead ends: 3420 [2024-10-13 10:21:22,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:21:22,468 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 7 mSDsluCounter, 15651 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17890 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:22,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17890 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:21:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2024-10-13 10:21:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3419. [2024-10-13 10:21:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 1907 states have (on average 1.8437336130047195) internal successors, (3516), 3410 states have internal predecessors, (3516), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-13 10:21:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 6528 transitions. [2024-10-13 10:21:22,897 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 6528 transitions. Word has length 96 [2024-10-13 10:21:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:22,897 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 6528 transitions. [2024-10-13 10:21:22,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 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:21:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 6528 transitions. [2024-10-13 10:21:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 10:21:22,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:22,899 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:22,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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:21:23,099 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:21:23,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash -953847697, now seen corresponding path program 2 times [2024-10-13 10:21:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845331286] [2024-10-13 10:21:23,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:21:23,102 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:21:23,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:23,103 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:21:23,105 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:21:23,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:21:23,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:21:23,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:21:23,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:23,501 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:21:23,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:21:23,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:21:23,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 10:21:23,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:21:23,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 10:21:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-13 10:21:23,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:21:23,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:23,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845331286] [2024-10-13 10:21:23,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845331286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:21:23,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:21:23,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:21:23,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381373554] [2024-10-13 10:21:23,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:21:23,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:21:23,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:21:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:21:23,612 INFO L87 Difference]: Start difference. First operand 3419 states and 6528 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:21:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:25,575 INFO L93 Difference]: Finished difference Result 6597 states and 12760 transitions. [2024-10-13 10:21:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:21:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 105 [2024-10-13 10:21:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:25,608 INFO L225 Difference]: With dead ends: 6597 [2024-10-13 10:21:25,609 INFO L226 Difference]: Without dead ends: 6597 [2024-10-13 10:21:25,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:21:25,611 INFO L432 NwaCegarLoop]: 2671 mSDtfsCounter, 1176 mSDsluCounter, 4387 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 7058 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:25,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 7058 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 10:21:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2024-10-13 10:21:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 3423. [2024-10-13 10:21:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 1911 states have (on average 1.8419675562532705) internal successors, (3520), 3414 states have internal predecessors, (3520), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-13 10:21:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 6532 transitions. [2024-10-13 10:21:26,414 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 6532 transitions. Word has length 105 [2024-10-13 10:21:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:26,416 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 6532 transitions. [2024-10-13 10:21:26,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:21:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 6532 transitions. [2024-10-13 10:21:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 10:21:26,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:26,418 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:26,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:21:26,622 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:21:26,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:26,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1964475024, now seen corresponding path program 1 times [2024-10-13 10:21:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857903030] [2024-10-13 10:21:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:21:26,626 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:21:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:26,627 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:21:26,629 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:21:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:27,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:21:27,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:21:27,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:21:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:21:27,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857903030] [2024-10-13 10:21:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857903030] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:21:27,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:21:27,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:21:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56720009] [2024-10-13 10:21:27,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:21:27,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:21:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:21:27,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:21:27,995 INFO L87 Difference]: Start difference. First operand 3423 states and 6532 transitions. Second operand has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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:21:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:29,941 INFO L93 Difference]: Finished difference Result 3444 states and 6570 transitions. [2024-10-13 10:21:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:21:29,942 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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 139 [2024-10-13 10:21:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:29,954 INFO L225 Difference]: With dead ends: 3444 [2024-10-13 10:21:29,954 INFO L226 Difference]: Without dead ends: 3442 [2024-10-13 10:21:29,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:21:29,956 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 13 mSDsluCounter, 26834 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29073 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:29,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29073 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 10:21:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-10-13 10:21:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3441. [2024-10-13 10:21:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 1929 states have (on average 1.8372213582166925) internal successors, (3544), 3432 states have internal predecessors, (3544), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-13 10:21:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 6556 transitions. [2024-10-13 10:21:30,270 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 6556 transitions. Word has length 139 [2024-10-13 10:21:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:30,271 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 6556 transitions. [2024-10-13 10:21:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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:21:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 6556 transitions. [2024-10-13 10:21:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 10:21:30,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:30,273 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:30,288 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:21:30,473 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:21:30,474 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:30,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1292107312, now seen corresponding path program 2 times [2024-10-13 10:21:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:30,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46247811] [2024-10-13 10:21:30,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:21:30,476 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:21:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:30,477 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:21:30,478 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:21:30,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:21:30,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:21:30,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:21:30,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-13 10:21:30,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:21:30,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:30,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46247811] [2024-10-13 10:21:30,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46247811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:21:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:21:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:21:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139181040] [2024-10-13 10:21:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:21:30,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:21:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:30,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:21:30,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:21:30,866 INFO L87 Difference]: Start difference. First operand 3441 states and 6556 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:21:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:31,028 INFO L93 Difference]: Finished difference Result 3501 states and 6616 transitions. [2024-10-13 10:21:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:21:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-10-13 10:21:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:31,039 INFO L225 Difference]: With dead ends: 3501 [2024-10-13 10:21:31,040 INFO L226 Difference]: Without dead ends: 3501 [2024-10-13 10:21:31,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 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:21:31,041 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 7 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:31,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4428 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:21:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-10-13 10:21:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3501. [2024-10-13 10:21:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 1989 states have (on average 1.811965811965812) internal successors, (3604), 3492 states have internal predecessors, (3604), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-13 10:21:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 6616 transitions. [2024-10-13 10:21:31,354 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 6616 transitions. Word has length 157 [2024-10-13 10:21:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:31,354 INFO L471 AbstractCegarLoop]: Abstraction has 3501 states and 6616 transitions. [2024-10-13 10:21:31,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:21:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 6616 transitions. [2024-10-13 10:21:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 10:21:31,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:31,357 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:31,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 10:21:31,558 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:21:31,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:31,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash -128734508, now seen corresponding path program 1 times [2024-10-13 10:21:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:31,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556028792] [2024-10-13 10:21:31,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:21:31,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:21:31,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:31,561 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:21:31,562 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:21:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:32,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:21:32,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 10:21:32,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:21:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 10:21:34,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556028792] [2024-10-13 10:21:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556028792] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:21:34,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:21:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:21:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134470965] [2024-10-13 10:21:34,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:21:34,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:21:34,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:21:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:21:34,454 INFO L87 Difference]: Start difference. First operand 3501 states and 6616 transitions. Second operand has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 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:21:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:40,897 INFO L93 Difference]: Finished difference Result 3538 states and 6686 transitions. [2024-10-13 10:21:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:21:40,898 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 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 157 [2024-10-13 10:21:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:40,906 INFO L225 Difference]: With dead ends: 3538 [2024-10-13 10:21:40,906 INFO L226 Difference]: Without dead ends: 3536 [2024-10-13 10:21:40,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:21:40,909 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 26 mSDsluCounter, 53666 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55905 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:40,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55905 Invalid, 2067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 10:21:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2024-10-13 10:21:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3535. [2024-10-13 10:21:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 2023 states have (on average 1.8042511122095897) internal successors, (3650), 3526 states have internal predecessors, (3650), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-13 10:21:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 6662 transitions. [2024-10-13 10:21:41,276 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 6662 transitions. Word has length 157 [2024-10-13 10:21:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:41,277 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 6662 transitions. [2024-10-13 10:21:41,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 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:21:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 6662 transitions. [2024-10-13 10:21:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 10:21:41,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:41,279 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:41,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:21:41,479 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:21:41,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:41,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1375887244, now seen corresponding path program 2 times [2024-10-13 10:21:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695553044] [2024-10-13 10:21:41,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:21:41,481 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:21:41,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:41,482 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:21:41,483 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:21:41,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:21:41,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:21:41,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:21:41,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-10-13 10:21:41,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:21:41,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695553044] [2024-10-13 10:21:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695553044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:21:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:21:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:21:41,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947449041] [2024-10-13 10:21:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:21:41,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:21:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:41,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:21:41,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:21:41,998 INFO L87 Difference]: Start difference. First operand 3535 states and 6662 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:21:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:21:42,205 INFO L93 Difference]: Finished difference Result 3484 states and 6578 transitions. [2024-10-13 10:21:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:21:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 191 [2024-10-13 10:21:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:21:42,215 INFO L225 Difference]: With dead ends: 3484 [2024-10-13 10:21:42,216 INFO L226 Difference]: Without dead ends: 3484 [2024-10-13 10:21:42,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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:21:42,217 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 32 mSDsluCounter, 4404 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6612 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:21:42,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6612 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:21:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2024-10-13 10:21:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3484. [2024-10-13 10:21:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 1972 states have (on average 1.808316430020284) internal successors, (3566), 3475 states have internal predecessors, (3566), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-13 10:21:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 6578 transitions. [2024-10-13 10:21:42,602 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 6578 transitions. Word has length 191 [2024-10-13 10:21:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:21:42,603 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 6578 transitions. [2024-10-13 10:21:42,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:21:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 6578 transitions. [2024-10-13 10:21:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 10:21:42,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:21:42,605 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:21:42,613 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:21:42,805 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:21:42,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:21:42,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:21:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash 648048934, now seen corresponding path program 1 times [2024-10-13 10:21:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:21:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271192895] [2024-10-13 10:21:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:21:42,807 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:21:42,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:21:42,808 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:21:42,810 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:21:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:21:44,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:21:44,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:21:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:21:44,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:21:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:21:46,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:21:46,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271192895] [2024-10-13 10:21:46,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271192895] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:21:46,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:21:46,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:21:46,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953214217] [2024-10-13 10:21:46,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:21:46,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:21:46,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:21:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:21:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:21:46,473 INFO L87 Difference]: Start difference. First operand 3484 states and 6578 transitions. Second operand has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 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)