./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_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 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_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:33:32,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:33:32,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:33:32,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:33:32,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:33:32,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:33:32,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:33:32,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:33:32,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:33:32,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:33:32,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:33:32,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:33:32,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:33:32,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:33:32,882 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:33:32,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:33:32,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:33:32,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:33:32,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:33:32,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:33:32,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:33:32,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:33:32,886 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:33:32,886 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:33:32,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:33:32,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:33:32,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:33:32,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:33:32,887 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:33:32,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:33:32,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:33:32,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:33:32,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:33:32,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:33:32,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:33:32,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:33:32,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:33:32,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:33:32,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:33:32,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:33:32,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:33:32,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:33:32,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:33:32,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:33:32,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:33:32,891 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2024-10-14 17:33:33,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:33:33,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:33:33,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:33:33,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:33:33,103 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:33:33,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-14 17:33:34,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:33:34,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:33:34,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-14 17:33:34,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55da36150/0f3efeb08a6247f885ac0a0962e7c516/FLAG3d265132f [2024-10-14 17:33:34,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55da36150/0f3efeb08a6247f885ac0a0962e7c516 [2024-10-14 17:33:34,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:33:34,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:33:34,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:33:34,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:33:34,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:33:34,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:33:34" (1/1) ... [2024-10-14 17:33:34,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bc134c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:34, skipping insertion in model container [2024-10-14 17:33:34,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:33:34" (1/1) ... [2024-10-14 17:33:34,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:33:34,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:33:35,012 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-14 17:33:35,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60d1068a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:35, skipping insertion in model container [2024-10-14 17:33:35,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:33:35,013 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:33:35,014 INFO L158 Benchmark]: Toolchain (without parser) took 454.96ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 125.0MB in the end (delta: 18.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-10-14 17:33:35,015 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:33:35,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.04ms. Allocated memory is still 176.2MB. Free memory was 143.5MB in the beginning and 125.0MB in the end (delta: 18.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-10-14 17:33:35,017 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.04ms. Allocated memory is still 176.2MB. Free memory was 143.5MB in the beginning and 125.0MB in the end (delta: 18.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:33:36,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:33:36,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:33:36,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:33:36,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:33:36,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:33:36,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:33:36,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:33:36,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:33:36,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:33:36,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:33:36,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:33:36,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:33:36,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:33:36,664 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:33:36,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:33:36,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:33:36,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:33:36,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:33:36,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:33:36,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:33:36,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:33:36,669 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:33:36,669 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:33:36,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:33:36,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:33:36,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:33:36,670 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:33:36,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:33:36,670 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:33:36,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:33:36,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:33:36,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:33:36,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:33:36,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:33:36,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:33:36,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:33:36,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:33:36,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:33:36,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:33:36,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:33:36,673 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:33:36,673 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:33:36,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:33:36,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:33:36,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:33:36,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:33:36,674 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:33:36,674 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 -> 765142a1ef820c0c2cf2fa98a3978a1412f5a1196c629c20848264001100dcc9 [2024-10-14 17:33:36,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:33:36,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:33:36,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:33:36,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:33:36,904 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:33:36,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-14 17:33:38,100 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:33:38,343 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:33:38,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-1.i [2024-10-14 17:33:38,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb4f6e2f/4d92141291b34721873f662468c52e41/FLAG80e7299f5 [2024-10-14 17:33:38,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb4f6e2f/4d92141291b34721873f662468c52e41 [2024-10-14 17:33:38,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:33:38,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:33:38,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:33:38,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:33:38,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:33:38,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:33:38" (1/1) ... [2024-10-14 17:33:38,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8dc434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:38, skipping insertion in model container [2024-10-14 17:33:38,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:33:38" (1/1) ... [2024-10-14 17:33:38,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:33:38,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:33:38,833 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:33:38,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:33:38,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:33:38,945 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:33:39,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:33:39,061 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:33:39,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39 WrapperNode [2024-10-14 17:33:39,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:33:39,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:33:39,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:33:39,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:33:39,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,152 INFO L138 Inliner]: procedures = 179, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1172 [2024-10-14 17:33:39,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:33:39,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:33:39,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:33:39,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:33:39,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,249 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-14 17:33:39,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:33:39,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:33:39,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:33:39,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:33:39,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (1/1) ... [2024-10-14 17:33:39,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:33:39,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:33:39,343 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-14 17:33:39,344 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-14 17:33:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:33:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:33:39,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:33:39,375 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:33:39,375 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:33:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:33:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:33:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:33:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:33:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:33:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:33:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:33:39,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:33:39,554 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:33:39,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:33:51,824 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2024-10-14 17:33:51,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:33:51,857 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:33:51,859 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-14 17:33:51,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:33:51 BoogieIcfgContainer [2024-10-14 17:33:51,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:33:51,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:33:51,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:33:51,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:33:51,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:33:38" (1/3) ... [2024-10-14 17:33:51,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20661787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:33:51, skipping insertion in model container [2024-10-14 17:33:51,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:33:39" (2/3) ... [2024-10-14 17:33:51,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20661787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:33:51, skipping insertion in model container [2024-10-14 17:33:51,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:33:51" (3/3) ... [2024-10-14 17:33:51,867 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-1.i [2024-10-14 17:33:51,879 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:33:51,879 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:33:51,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:33:51,925 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;@3aedc819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:33:51,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:33:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 192 states have (on average 1.6770833333333333) internal successors, (322), 204 states have internal predecessors, (322), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:33:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:33:51,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:51,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:33:51,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:51,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash 930833829, now seen corresponding path program 1 times [2024-10-14 17:33:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:51,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773799116] [2024-10-14 17:33:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:51,960 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-14 17:33:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:51,963 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-14 17:33:51,964 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-14 17:33:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:52,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:33:52,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:52,097 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-14 17:33:52,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:52,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:52,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773799116] [2024-10-14 17:33:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773799116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:52,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:33:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70250268] [2024-10-14 17:33:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:52,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:33:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:33:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:33:52,126 INFO L87 Difference]: Start difference. First operand has 213 states, 192 states have (on average 1.6770833333333333) internal successors, (322), 204 states have internal predecessors, (322), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:52,157 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2024-10-14 17:33:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:33:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:33:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:52,173 INFO L225 Difference]: With dead ends: 212 [2024-10-14 17:33:52,174 INFO L226 Difference]: Without dead ends: 211 [2024-10-14 17:33:52,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:33:52,178 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:52,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:33:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-14 17:33:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-14 17:33:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 202 states have internal predecessors, (251), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:33:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 283 transitions. [2024-10-14 17:33:52,271 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 283 transitions. Word has length 6 [2024-10-14 17:33:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:52,272 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 283 transitions. [2024-10-14 17:33:52,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 283 transitions. [2024-10-14 17:33:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:33:52,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:52,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:33:52,282 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-14 17:33:52,473 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-14 17:33:52,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:52,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 270449044, now seen corresponding path program 1 times [2024-10-14 17:33:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587152600] [2024-10-14 17:33:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:52,475 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-14 17:33:52,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:52,478 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-14 17:33:52,479 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-14 17:33:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:52,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:33:52,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:52,581 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-14 17:33:52,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:52,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587152600] [2024-10-14 17:33:52,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587152600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:52,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:52,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:33:52,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231512081] [2024-10-14 17:33:52,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:52,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:33:52,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:33:52,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:33:52,584 INFO L87 Difference]: Start difference. First operand 211 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:52,755 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2024-10-14 17:33:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:33:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:33:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:52,759 INFO L225 Difference]: With dead ends: 385 [2024-10-14 17:33:52,759 INFO L226 Difference]: Without dead ends: 385 [2024-10-14 17:33:52,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:33:52,760 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 213 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:52,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 580 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:33:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-14 17:33:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 212. [2024-10-14 17:33:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 192 states have (on average 1.3125) internal successors, (252), 203 states have internal predecessors, (252), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:33:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2024-10-14 17:33:52,780 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 6 [2024-10-14 17:33:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:52,781 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2024-10-14 17:33:52,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2024-10-14 17:33:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 17:33:52,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:52,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:52,790 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-14 17:33:52,988 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-14 17:33:52,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:52,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1848851602, now seen corresponding path program 1 times [2024-10-14 17:33:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:52,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132679178] [2024-10-14 17:33:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:52,992 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-14 17:33:52,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:52,995 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-14 17:33:52,996 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-14 17:33:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:53,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:33:53,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:33:53,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:53,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132679178] [2024-10-14 17:33:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132679178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:53,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:33:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744483448] [2024-10-14 17:33:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:53,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:33:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:33:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:33:53,407 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:53,510 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2024-10-14 17:33:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:33:53,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-14 17:33:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:53,512 INFO L225 Difference]: With dead ends: 215 [2024-10-14 17:33:53,512 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 17:33:53,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:33:53,513 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:53,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 733 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:33:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 17:33:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-10-14 17:33:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 195 states have (on average 1.2666666666666666) internal successors, (247), 206 states have internal predecessors, (247), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:33:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2024-10-14 17:33:53,521 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 112 [2024-10-14 17:33:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:53,521 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2024-10-14 17:33:53,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2024-10-14 17:33:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 17:33:53,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:53,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:53,536 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-14 17:33:53,727 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-14 17:33:53,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:53,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1336085638, now seen corresponding path program 1 times [2024-10-14 17:33:53,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:53,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457292571] [2024-10-14 17:33:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:53,730 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-14 17:33:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:53,731 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-14 17:33:53,732 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-14 17:33:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:54,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:33:54,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:33:54,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:54,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:54,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457292571] [2024-10-14 17:33:54,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457292571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:54,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:54,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:33:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380242274] [2024-10-14 17:33:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:54,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:33:54,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:54,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:33:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:33:54,191 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:54,261 INFO L93 Difference]: Finished difference Result 209 states and 269 transitions. [2024-10-14 17:33:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:33:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-14 17:33:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:54,263 INFO L225 Difference]: With dead ends: 209 [2024-10-14 17:33:54,263 INFO L226 Difference]: Without dead ends: 209 [2024-10-14 17:33:54,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:33:54,264 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:54,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:33:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-14 17:33:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-14 17:33:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 189 states have (on average 1.253968253968254) internal successors, (237), 200 states have internal predecessors, (237), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:33:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 269 transitions. [2024-10-14 17:33:54,282 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 269 transitions. Word has length 112 [2024-10-14 17:33:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:54,282 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 269 transitions. [2024-10-14 17:33:54,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 269 transitions. [2024-10-14 17:33:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 17:33:54,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:54,284 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:54,297 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-14 17:33:54,484 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-14 17:33:54,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1634025464, now seen corresponding path program 1 times [2024-10-14 17:33:54,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:54,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522764081] [2024-10-14 17:33:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:54,486 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-14 17:33:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:54,488 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-14 17:33:54,489 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-14 17:33:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:54,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:33:54,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:33:55,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:55,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:55,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522764081] [2024-10-14 17:33:55,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522764081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:55,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:55,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:33:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105196727] [2024-10-14 17:33:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:55,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:33:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:55,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:33:55,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:33:55,061 INFO L87 Difference]: Start difference. First operand 209 states and 269 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:55,362 INFO L93 Difference]: Finished difference Result 245 states and 305 transitions. [2024-10-14 17:33:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:33:55,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-14 17:33:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:55,367 INFO L225 Difference]: With dead ends: 245 [2024-10-14 17:33:55,367 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 17:33:55,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:33:55,368 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:55,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:33:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 17:33:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-14 17:33:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 225 states have (on average 1.2133333333333334) internal successors, (273), 236 states have internal predecessors, (273), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 17:33:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2024-10-14 17:33:55,374 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 112 [2024-10-14 17:33:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:55,374 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 305 transitions. [2024-10-14 17:33:55,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:33:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 305 transitions. [2024-10-14 17:33:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 17:33:55,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:55,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:55,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 17:33:55,576 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-14 17:33:55,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:55,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1600948529, now seen corresponding path program 1 times [2024-10-14 17:33:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:55,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146980413] [2024-10-14 17:33:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:55,578 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-14 17:33:55,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:55,579 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-14 17:33:55,579 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-14 17:33:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:56,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:33:56,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:33:56,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:56,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146980413] [2024-10-14 17:33:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146980413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:33:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211763173] [2024-10-14 17:33:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:33:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:33:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:33:56,051 INFO L87 Difference]: Start difference. First operand 245 states and 305 transitions. Second operand has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:33:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:56,106 INFO L93 Difference]: Finished difference Result 247 states and 309 transitions. [2024-10-14 17:33:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:33:56,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2024-10-14 17:33:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:56,108 INFO L225 Difference]: With dead ends: 247 [2024-10-14 17:33:56,108 INFO L226 Difference]: Without dead ends: 247 [2024-10-14 17:33:56,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:33:56,109 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:56,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:33:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-14 17:33:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-14 17:33:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 238 states have internal predecessors, (275), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:33:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2024-10-14 17:33:56,114 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 125 [2024-10-14 17:33:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:56,115 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2024-10-14 17:33:56,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:33:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2024-10-14 17:33:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 17:33:56,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:56,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:56,130 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-14 17:33:56,317 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-14 17:33:56,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:56,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1857742555, now seen corresponding path program 1 times [2024-10-14 17:33:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:56,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146288847] [2024-10-14 17:33:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:56,319 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-14 17:33:56,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:56,320 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-14 17:33:56,320 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-14 17:33:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:56,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:33:56,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:33:56,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:33:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:33:56,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:56,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146288847] [2024-10-14 17:33:56,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146288847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:33:56,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:33:56,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:33:56,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443038001] [2024-10-14 17:33:56,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:33:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:33:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:56,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:33:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:33:56,847 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:57,007 INFO L93 Difference]: Finished difference Result 256 states and 324 transitions. [2024-10-14 17:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:33:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 127 [2024-10-14 17:33:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:57,009 INFO L225 Difference]: With dead ends: 256 [2024-10-14 17:33:57,009 INFO L226 Difference]: Without dead ends: 256 [2024-10-14 17:33:57,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 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-14 17:33:57,009 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 5 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:57,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1032 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:33:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-14 17:33:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2024-10-14 17:33:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 233 states have (on average 1.2360515021459229) internal successors, (288), 245 states have internal predecessors, (288), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:33:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 322 transitions. [2024-10-14 17:33:57,017 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 322 transitions. Word has length 127 [2024-10-14 17:33:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:57,020 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 322 transitions. [2024-10-14 17:33:57,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2024-10-14 17:33:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 17:33:57,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:57,021 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:57,033 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-14 17:33:57,221 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-14 17:33:57,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:57,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1505795791, now seen corresponding path program 2 times [2024-10-14 17:33:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:57,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499425545] [2024-10-14 17:33:57,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:33:57,223 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-14 17:33:57,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:57,224 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-14 17:33:57,225 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-14 17:33:57,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:33:57,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:33:57,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:33:57,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:33:57,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:33:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:33:57,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499425545] [2024-10-14 17:33:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499425545] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:33:57,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:33:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:33:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98722741] [2024-10-14 17:33:57,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:33:57,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:33:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:33:57,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:33:57,871 INFO L87 Difference]: Start difference. First operand 255 states and 322 transitions. Second operand has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:58,347 INFO L93 Difference]: Finished difference Result 267 states and 342 transitions. [2024-10-14 17:33:58,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:33:58,348 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-10-14 17:33:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:58,349 INFO L225 Difference]: With dead ends: 267 [2024-10-14 17:33:58,349 INFO L226 Difference]: Without dead ends: 265 [2024-10-14 17:33:58,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:33:58,350 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 7 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:58,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1804 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:33:58,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-14 17:33:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2024-10-14 17:33:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 242 states have (on average 1.2396694214876034) internal successors, (300), 254 states have internal predecessors, (300), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:33:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 334 transitions. [2024-10-14 17:33:58,361 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 334 transitions. Word has length 131 [2024-10-14 17:33:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:58,361 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 334 transitions. [2024-10-14 17:33:58,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:33:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 334 transitions. [2024-10-14 17:33:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 17:33:58,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:58,363 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:58,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:33:58,563 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-14 17:33:58,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:58,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1068976461, now seen corresponding path program 3 times [2024-10-14 17:33:58,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:58,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268386706] [2024-10-14 17:33:58,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:33:58,565 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-14 17:33:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:58,567 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-14 17:33:58,567 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-14 17:33:58,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:33:58,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:33:58,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:33:58,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-14 17:33:59,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:33:59,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:33:59,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268386706] [2024-10-14 17:33:59,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268386706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:33:59,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:33:59,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:33:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452516928] [2024-10-14 17:33:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:33:59,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:33:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:33:59,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:33:59,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:33:59,011 INFO L87 Difference]: Start difference. First operand 264 states and 334 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:33:59,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:33:59,096 INFO L93 Difference]: Finished difference Result 267 states and 329 transitions. [2024-10-14 17:33:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:33:59,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 140 [2024-10-14 17:33:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:33:59,100 INFO L225 Difference]: With dead ends: 267 [2024-10-14 17:33:59,100 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 17:33:59,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:33:59,100 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 30 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:33:59,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 688 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:33:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 17:33:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-14 17:33:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 245 states have (on average 1.2040816326530612) internal successors, (295), 257 states have internal predecessors, (295), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:33:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 329 transitions. [2024-10-14 17:33:59,105 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 329 transitions. Word has length 140 [2024-10-14 17:33:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:33:59,105 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 329 transitions. [2024-10-14 17:33:59,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:33:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 329 transitions. [2024-10-14 17:33:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 17:33:59,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:33:59,112 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:33:59,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:33:59,312 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-14 17:33:59,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:33:59,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:33:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1163749671, now seen corresponding path program 1 times [2024-10-14 17:33:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:33:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541418002] [2024-10-14 17:33:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:33:59,314 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-14 17:33:59,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:33:59,316 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-14 17:33:59,316 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-14 17:33:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:33:59,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:33:59,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:33:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:33:59,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:34:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 17:34:00,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:34:00,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541418002] [2024-10-14 17:34:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541418002] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:34:00,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:34:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:34:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994494686] [2024-10-14 17:34:00,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:34:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:34:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:34:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:34:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:34:00,384 INFO L87 Difference]: Start difference. First operand 267 states and 329 transitions. Second operand has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:34:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:34:01,692 INFO L93 Difference]: Finished difference Result 288 states and 367 transitions. [2024-10-14 17:34:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:34:01,693 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 140 [2024-10-14 17:34:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:34:01,694 INFO L225 Difference]: With dead ends: 288 [2024-10-14 17:34:01,694 INFO L226 Difference]: Without dead ends: 286 [2024-10-14 17:34:01,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:34:01,695 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 14 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:34:01,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3203 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 17:34:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-14 17:34:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2024-10-14 17:34:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 263 states have (on average 1.2129277566539924) internal successors, (319), 275 states have internal predecessors, (319), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:34:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 353 transitions. [2024-10-14 17:34:01,700 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 353 transitions. Word has length 140 [2024-10-14 17:34:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:34:01,701 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 353 transitions. [2024-10-14 17:34:01,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:34:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 353 transitions. [2024-10-14 17:34:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 17:34:01,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:34:01,702 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:34:01,717 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 (11)] Forceful destruction successful, exit code 0 [2024-10-14 17:34:01,903 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-14 17:34:01,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:34:01,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:34:01,903 INFO L85 PathProgramCache]: Analyzing trace with hash -580157145, now seen corresponding path program 2 times [2024-10-14 17:34:01,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:34:01,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998804419] [2024-10-14 17:34:01,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:34:01,904 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-14 17:34:01,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:34:01,905 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-14 17:34:01,906 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-14 17:34:02,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:34:02,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:34:02,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:34:02,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:34:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-14 17:34:02,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:34:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-14 17:34:04,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:34:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998804419] [2024-10-14 17:34:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998804419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:34:04,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:34:04,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:34:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804328106] [2024-10-14 17:34:04,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:34:04,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:34:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:34:04,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:34:04,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:34:04,079 INFO L87 Difference]: Start difference. First operand 285 states and 353 transitions. Second operand has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:34:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:34:08,733 INFO L93 Difference]: Finished difference Result 322 states and 423 transitions. [2024-10-14 17:34:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:34:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 158 [2024-10-14 17:34:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:34:08,734 INFO L225 Difference]: With dead ends: 322 [2024-10-14 17:34:08,734 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 17:34:08,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:34:08,737 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 25 mSDsluCounter, 6146 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6396 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:34:08,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6396 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 17:34:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 17:34:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-10-14 17:34:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 297 states have (on average 1.228956228956229) internal successors, (365), 309 states have internal predecessors, (365), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:34:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 399 transitions. [2024-10-14 17:34:08,742 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 399 transitions. Word has length 158 [2024-10-14 17:34:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:34:08,742 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 399 transitions. [2024-10-14 17:34:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:34:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 399 transitions. [2024-10-14 17:34:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-14 17:34:08,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:34:08,744 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:34:08,759 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-14 17:34:08,944 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-14 17:34:08,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:34:08,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:34:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1005849319, now seen corresponding path program 3 times [2024-10-14 17:34:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:34:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323638962] [2024-10-14 17:34:08,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:34:08,946 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-14 17:34:08,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:34:08,947 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-14 17:34:08,947 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-14 17:34:09,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:34:09,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:34:09,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:34:09,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:34:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-14 17:34:09,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:34:09,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:34:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323638962] [2024-10-14 17:34:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323638962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:34:09,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:34:09,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:34:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756942989] [2024-10-14 17:34:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:34:09,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:34:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:34:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:34:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:34:09,533 INFO L87 Difference]: Start difference. First operand 319 states and 399 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:34:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:34:09,586 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2024-10-14 17:34:09,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:34:09,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 192 [2024-10-14 17:34:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:34:09,590 INFO L225 Difference]: With dead ends: 313 [2024-10-14 17:34:09,590 INFO L226 Difference]: Without dead ends: 313 [2024-10-14 17:34:09,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:34:09,591 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:34:09,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:34:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-14 17:34:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-10-14 17:34:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 291 states have (on average 1.2199312714776633) internal successors, (355), 303 states have internal predecessors, (355), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:34:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 389 transitions. [2024-10-14 17:34:09,599 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 389 transitions. Word has length 192 [2024-10-14 17:34:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:34:09,599 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 389 transitions. [2024-10-14 17:34:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:34:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 389 transitions. [2024-10-14 17:34:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-14 17:34:09,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:34:09,600 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:34:09,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-14 17:34:09,801 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-14 17:34:09,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:34:09,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:34:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 731089705, now seen corresponding path program 1 times [2024-10-14 17:34:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:34:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795120222] [2024-10-14 17:34:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:34:09,802 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-14 17:34:09,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:34:09,803 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-14 17:34:09,804 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-14 17:34:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:34:10,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 17:34:10,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:34:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:34:11,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:34:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:34:12,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:34:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795120222] [2024-10-14 17:34:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795120222] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:34:12,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:34:12,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:34:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224618399] [2024-10-14 17:34:12,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:34:12,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:34:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:34:12,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:34:12,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:34:12,531 INFO L87 Difference]: Start difference. First operand 313 states and 389 transitions. Second operand has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:34:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:34:17,536 INFO L93 Difference]: Finished difference Result 340 states and 443 transitions. [2024-10-14 17:34:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:34:17,536 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 192 [2024-10-14 17:34:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:34:17,538 INFO L225 Difference]: With dead ends: 340 [2024-10-14 17:34:17,538 INFO L226 Difference]: Without dead ends: 340 [2024-10-14 17:34:17,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:34:17,540 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 27 mSDsluCounter, 6004 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6249 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:34:17,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6249 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 17:34:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-14 17:34:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2024-10-14 17:34:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 316 states have (on average 1.2816455696202531) internal successors, (405), 328 states have internal predecessors, (405), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:34:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2024-10-14 17:34:17,549 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 192 [2024-10-14 17:34:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:34:17,549 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2024-10-14 17:34:17,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:34:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2024-10-14 17:34:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-14 17:34:17,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:34:17,550 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:34:17,570 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-14 17:34:17,751 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-14 17:34:17,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:34:17,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:34:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash 635431941, now seen corresponding path program 2 times [2024-10-14 17:34:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:34:17,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507438176] [2024-10-14 17:34:17,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:34:17,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:34:17,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:34:17,754 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-14 17:34:17,755 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-14 17:34:19,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:34:19,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:34:19,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 17:34:19,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:34:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:34:20,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:34:25,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-14 17:34:25,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:34:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507438176] [2024-10-14 17:34:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507438176] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:34:25,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:34:25,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-14 17:34:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546809518] [2024-10-14 17:34:25,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:34:25,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 17:34:25,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:34:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 17:34:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 17:34:25,431 INFO L87 Difference]: Start difference. First operand 338 states and 439 transitions. Second operand has 102 states, 100 states have (on average 2.2) internal successors, (220), 102 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:34:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:34:51,065 INFO L93 Difference]: Finished difference Result 394 states and 550 transitions. [2024-10-14 17:34:51,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-14 17:34:51,068 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 100 states have (on average 2.2) internal successors, (220), 102 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 217 [2024-10-14 17:34:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:34:51,070 INFO L225 Difference]: With dead ends: 394 [2024-10-14 17:34:51,070 INFO L226 Difference]: Without dead ends: 394 [2024-10-14 17:34:51,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-10-14 17:34:51,077 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 106 mSDsluCounter, 11999 mSDsCounter, 0 mSdLazyCounter, 5555 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 5611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 5555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:34:51,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 12244 Invalid, 5611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 5555 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 17:34:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-14 17:34:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2024-10-14 17:34:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 370 states have (on average 1.3837837837837839) internal successors, (512), 382 states have internal predecessors, (512), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-14 17:34:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 546 transitions. [2024-10-14 17:34:51,087 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 546 transitions. Word has length 217 [2024-10-14 17:34:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:34:51,087 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 546 transitions. [2024-10-14 17:34:51,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 100 states have (on average 2.2) internal successors, (220), 102 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:34:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 546 transitions. [2024-10-14 17:34:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-14 17:34:51,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:34:51,088 INFO L215 NwaCegarLoop]: trace histogram [142, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:34:51,111 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 (15)] Forceful destruction successful, exit code 0 [2024-10-14 17:34:51,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:34:51,289 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:34:51,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:34:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1257968507, now seen corresponding path program 3 times [2024-10-14 17:34:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:34:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982844266] [2024-10-14 17:34:51,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:34:51,291 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-14 17:34:51,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:34:51,292 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:34:51,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 17:34:51,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:34:51,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:34:51,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:34:51,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:34:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10298 trivial. 0 not checked. [2024-10-14 17:34:52,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:34:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10298 trivial. 0 not checked. [2024-10-14 17:34:52,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:34:52,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982844266] [2024-10-14 17:34:52,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982844266] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:34:52,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:34:52,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-14 17:34:52,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094625679] [2024-10-14 17:34:52,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:34:52,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:34:52,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:34:52,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:34:52,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:34:52,228 INFO L87 Difference]: Start difference. First operand 392 states and 546 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:34:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:34:52,627 INFO L93 Difference]: Finished difference Result 858 states and 1101 transitions. [2024-10-14 17:34:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:34:52,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 267 [2024-10-14 17:34:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:34:52,630 INFO L225 Difference]: With dead ends: 858 [2024-10-14 17:34:52,630 INFO L226 Difference]: Without dead ends: 858 [2024-10-14 17:34:52,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:34:52,631 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 635 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:34:52,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1371 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:34:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2024-10-14 17:34:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2024-10-14 17:34:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 818 states have (on average 1.2530562347188263) internal successors, (1025), 830 states have internal predecessors, (1025), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-10-14 17:34:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1101 transitions. [2024-10-14 17:34:52,647 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1101 transitions. Word has length 267 [2024-10-14 17:34:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:34:52,647 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1101 transitions. [2024-10-14 17:34:52,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:34:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1101 transitions. [2024-10-14 17:34:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2024-10-14 17:34:52,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:34:52,652 INFO L215 NwaCegarLoop]: trace histogram [142, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:34:52,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 17:34:52,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:34:52,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:34:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:34:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1723999891, now seen corresponding path program 1 times [2024-10-14 17:34:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:34:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236560563] [2024-10-14 17:34:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:34:52,855 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-14 17:34:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:34:52,857 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:34:52,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 17:34:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:34:56,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 3640 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-10-14 17:34:56,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:35:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10932 backedges. 4568 proven. 4851 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-10-14 17:35:01,102 INFO L311 TraceCheckSpWp]: Computing backward predicates...