./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:49:19,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:49:19,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:49:19,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:49:19,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:49:19,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:49:19,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:49:19,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:49:19,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:49:19,853 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:49:19,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:49:19,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:49:19,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:49:19,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:49:19,854 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:49:19,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:49:19,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:49:19,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:49:19,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:49:19,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:49:19,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:49:19,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:49:19,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:49:19,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:49:19,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:49:19,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:49:19,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:49:19,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:49:19,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:49:19,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:49:19,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:49:19,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:49:19,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:49:19,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:49:19,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:49:19,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:49:19,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:49:19,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:49:19,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:49:19,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:49:19,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:49:19,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:49:19,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:49:19,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:49:19,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:49:19,866 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2024-10-24 15:49:20,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:49:20,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:49:20,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:49:20,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:49:20,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:49:20,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-10-24 15:49:21,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:49:21,754 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:49:21,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-10-24 15:49:21,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0574fd1e1/53e66b79164e4b88846b37c9a6670670/FLAGfe0e9f4e7 [2024-10-24 15:49:21,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0574fd1e1/53e66b79164e4b88846b37c9a6670670 [2024-10-24 15:49:21,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:49:21,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:49:21,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:49:21,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:49:21,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:49:21,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:49:21" (1/1) ... [2024-10-24 15:49:21,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0cb0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:21, skipping insertion in model container [2024-10-24 15:49:21,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:49:21" (1/1) ... [2024-10-24 15:49:21,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:49:22,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:49:22,574 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 15:49:22,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@77b45976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:22, skipping insertion in model container [2024-10-24 15:49:22,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:49:22,575 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:49:22,576 INFO L158 Benchmark]: Toolchain (without parser) took 781.67ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 85.5MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 15:49:22,577 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:49:22,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 778.96ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 85.5MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 15:49:22,578 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.10ms. Allocated memory is still 109.1MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 778.96ms. Allocated memory is still 165.7MB. Free memory was 120.6MB in the beginning and 85.5MB in the end (delta: 35.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:49:24,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:49:24,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:49:24,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:49:24,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:49:24,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:49:24,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:49:24,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:49:24,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:49:24,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:49:24,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:49:24,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:49:24,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:49:24,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:49:24,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:49:24,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:49:24,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:49:24,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:49:24,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:49:24,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:49:24,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:49:24,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:49:24,511 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:49:24,511 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:49:24,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:49:24,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:49:24,512 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:49:24,513 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:49:24,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:49:24,513 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:49:24,514 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:49:24,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:49:24,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:49:24,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:49:24,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:49:24,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:49:24,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:49:24,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:49:24,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:49:24,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:49:24,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:49:24,522 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:49:24,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:49:24,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:49:24,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:49:24,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:49:24,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:49:24,523 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:49:24,523 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2024-10-24 15:49:24,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:49:24,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:49:24,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:49:24,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:49:24,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:49:24,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-10-24 15:49:26,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:49:26,476 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:49:26,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-10-24 15:49:26,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48959b8b/fb4e24a96d1049aabf6af3101bfc8465/FLAGb57caf43f [2024-10-24 15:49:26,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48959b8b/fb4e24a96d1049aabf6af3101bfc8465 [2024-10-24 15:49:26,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:49:26,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:49:26,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:49:26,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:49:26,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:49:26,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:49:26" (1/1) ... [2024-10-24 15:49:26,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb6d443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:26, skipping insertion in model container [2024-10-24 15:49:26,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:49:26" (1/1) ... [2024-10-24 15:49:26,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:49:27,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:49:27,454 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:49:27,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:49:27,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:49:27,601 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:49:27,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:49:27,747 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:49:27,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27 WrapperNode [2024-10-24 15:49:27,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:49:27,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:49:27,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:49:27,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:49:27,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:27,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:27,887 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3043 [2024-10-24 15:49:27,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:49:27,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:49:27,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:49:27,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:49:27,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:27,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:27,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:27,977 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-24 15:49:27,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:27,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:28,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:28,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:28,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:28,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:28,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:49:28,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:49:28,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:49:28,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:49:28,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (1/1) ... [2024-10-24 15:49:28,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:49:28,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:49:28,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:49:28,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:49:28,226 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:49:28,226 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:49:28,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:49:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:49:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:49:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:49:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:49:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:49:28,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:49:28,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:49:28,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:49:28,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:49:28,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 15:49:28,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:49:28,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:49:28,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 15:49:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:49:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:49:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:49:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:49:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:49:28,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:49:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:49:28,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:49:28,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:49:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:49:28,468 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:49:28,471 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:49:38,025 INFO L? ?]: Removed 638 outVars from TransFormulas that were not future-live. [2024-10-24 15:49:38,025 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:49:38,072 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:49:38,073 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-24 15:49:38,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:49:38 BoogieIcfgContainer [2024-10-24 15:49:38,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:49:38,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:49:38,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:49:38,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:49:38,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:49:26" (1/3) ... [2024-10-24 15:49:38,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793db10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:49:38, skipping insertion in model container [2024-10-24 15:49:38,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:49:27" (2/3) ... [2024-10-24 15:49:38,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793db10e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:49:38, skipping insertion in model container [2024-10-24 15:49:38,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:49:38" (3/3) ... [2024-10-24 15:49:38,079 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-2.i [2024-10-24 15:49:38,093 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:49:38,093 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:49:38,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:49:38,158 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;@45256ca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:49:38,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:49:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-24 15:49:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 15:49:38,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:38,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:49:38,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1977665458, now seen corresponding path program 1 times [2024-10-24 15:49:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794119554] [2024-10-24 15:49:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:38,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:38,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:38,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:49:38,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 15:49:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:38,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:49:38,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:49:38,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:49:38,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794119554] [2024-10-24 15:49:38,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794119554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:49:38,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:49:38,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:49:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634023373] [2024-10-24 15:49:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:49:38,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:49:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:49:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:49:38,422 INFO L87 Difference]: Start difference. First operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:49:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:38,583 INFO L93 Difference]: Finished difference Result 1200 states and 2257 transitions. [2024-10-24 15:49:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:49:38,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 15:49:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:38,607 INFO L225 Difference]: With dead ends: 1200 [2024-10-24 15:49:38,608 INFO L226 Difference]: Without dead ends: 1199 [2024-10-24 15:49:38,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:49:38,613 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:38,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:49:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-10-24 15:49:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2024-10-24 15:49:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 690 states have (on average 1.808695652173913) internal successors, (1248), 1192 states have internal predecessors, (1248), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-24 15:49:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2256 transitions. [2024-10-24 15:49:38,919 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2256 transitions. Word has length 10 [2024-10-24 15:49:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:38,920 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 2256 transitions. [2024-10-24 15:49:38,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:49:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2256 transitions. [2024-10-24 15:49:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 15:49:38,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:38,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:49:38,930 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 15:49:39,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:39,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:39,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 595513586, now seen corresponding path program 1 times [2024-10-24 15:49:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178646032] [2024-10-24 15:49:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:39,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:39,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:39,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:49:39,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 15:49:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:39,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:49:39,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:49:39,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:49:39,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178646032] [2024-10-24 15:49:39,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178646032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:49:39,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:49:39,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:49:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062394154] [2024-10-24 15:49:39,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:49:39,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:49:39,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:49:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:49:39,361 INFO L87 Difference]: Start difference. First operand 1199 states and 2256 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:49:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:40,261 INFO L93 Difference]: Finished difference Result 2319 states and 4412 transitions. [2024-10-24 15:49:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:49:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 15:49:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:40,276 INFO L225 Difference]: With dead ends: 2319 [2024-10-24 15:49:40,277 INFO L226 Difference]: Without dead ends: 2319 [2024-10-24 15:49:40,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:49:40,278 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 1146 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:40,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 4467 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 15:49:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-10-24 15:49:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2288. [2024-10-24 15:49:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 1279 states have (on average 1.8483189992181392) internal successors, (2364), 2281 states have internal predecessors, (2364), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-24 15:49:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 4372 transitions. [2024-10-24 15:49:40,526 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 4372 transitions. Word has length 12 [2024-10-24 15:49:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 4372 transitions. [2024-10-24 15:49:40,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:49:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 4372 transitions. [2024-10-24 15:49:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 15:49:40,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:40,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:49:40,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 (3)] Ended with exit code 0 [2024-10-24 15:49:40,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:40,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 597360628, now seen corresponding path program 1 times [2024-10-24 15:49:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809871174] [2024-10-24 15:49:40,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:40,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:40,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:40,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:49:40,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 15:49:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:40,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:49:40,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:40,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:49:40,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:49:40,886 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:49:40,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 15:49:40,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:49:40,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:49:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:49:40,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:49:40,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:40,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809871174] [2024-10-24 15:49:40,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809871174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:49:40,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:49:40,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:49:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046927253] [2024-10-24 15:49:40,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:49:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:49:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:49:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:49:40,982 INFO L87 Difference]: Start difference. First operand 2288 states and 4372 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:49:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:43,556 INFO L93 Difference]: Finished difference Result 4434 states and 8563 transitions. [2024-10-24 15:49:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:49:43,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 15:49:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:43,579 INFO L225 Difference]: With dead ends: 4434 [2024-10-24 15:49:43,579 INFO L226 Difference]: Without dead ends: 4434 [2024-10-24 15:49:43,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:49:43,580 INFO L432 NwaCegarLoop]: 2467 mSDtfsCounter, 1229 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:43,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 6661 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 15:49:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2024-10-24 15:49:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 2287. [2024-10-24 15:49:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1278 states have (on average 1.8482003129890454) internal successors, (2362), 2280 states have internal predecessors, (2362), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-24 15:49:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 4370 transitions. [2024-10-24 15:49:43,947 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 4370 transitions. Word has length 12 [2024-10-24 15:49:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:43,947 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 4370 transitions. [2024-10-24 15:49:43,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:49:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 4370 transitions. [2024-10-24 15:49:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 15:49:43,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:43,950 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:49:43,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 15:49:44,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:44,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:44,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1916374631, now seen corresponding path program 1 times [2024-10-24 15:49:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:44,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027959738] [2024-10-24 15:49:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:44,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:44,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:44,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:49:44,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 15:49:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:44,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:49:44,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:49:44,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:49:44,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027959738] [2024-10-24 15:49:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027959738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:49:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:49:44,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:49:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477745604] [2024-10-24 15:49:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:49:44,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:49:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:49:44,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:49:44,599 INFO L87 Difference]: Start difference. First operand 2287 states and 4370 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:49:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:44,799 INFO L93 Difference]: Finished difference Result 2293 states and 4360 transitions. [2024-10-24 15:49:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:49:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-24 15:49:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:44,811 INFO L225 Difference]: With dead ends: 2293 [2024-10-24 15:49:44,811 INFO L226 Difference]: Without dead ends: 2293 [2024-10-24 15:49:44,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:49:44,812 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 30 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:44,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6649 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:49:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2024-10-24 15:49:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2293. [2024-10-24 15:49:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1284 states have (on average 1.8317757009345794) internal successors, (2352), 2286 states have internal predecessors, (2352), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-24 15:49:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 4360 transitions. [2024-10-24 15:49:45,053 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 4360 transitions. Word has length 81 [2024-10-24 15:49:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:45,054 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 4360 transitions. [2024-10-24 15:49:45,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:49:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 4360 transitions. [2024-10-24 15:49:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 15:49:45,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:45,060 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:49:45,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 15:49:45,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:45,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:45,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1840414555, now seen corresponding path program 1 times [2024-10-24 15:49:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:45,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45572926] [2024-10-24 15:49:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:45,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:45,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:49:45,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 15:49:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:45,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:49:45,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:49:45,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:49:45,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:45,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45572926] [2024-10-24 15:49:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45572926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:49:45,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:49:45,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:49:45,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682801223] [2024-10-24 15:49:45,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:49:45,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:49:45,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:45,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:49:45,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:49:45,665 INFO L87 Difference]: Start difference. First operand 2293 states and 4360 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:49:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:45,778 INFO L93 Difference]: Finished difference Result 2295 states and 4363 transitions. [2024-10-24 15:49:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:49:45,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2024-10-24 15:49:45,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:45,790 INFO L225 Difference]: With dead ends: 2295 [2024-10-24 15:49:45,790 INFO L226 Difference]: Without dead ends: 2295 [2024-10-24 15:49:45,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:49:45,791 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 0 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:45,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6713 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:49:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2024-10-24 15:49:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2295. [2024-10-24 15:49:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1285 states have (on average 1.8319066147859921) internal successors, (2354), 2288 states have internal predecessors, (2354), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-24 15:49:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4363 transitions. [2024-10-24 15:49:46,029 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4363 transitions. Word has length 81 [2024-10-24 15:49:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:46,029 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 4363 transitions. [2024-10-24 15:49:46,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:49:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4363 transitions. [2024-10-24 15:49:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 15:49:46,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:46,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:49:46,040 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-24 15:49:46,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:46,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:46,233 INFO L85 PathProgramCache]: Analyzing trace with hash 197447049, now seen corresponding path program 1 times [2024-10-24 15:49:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494496001] [2024-10-24 15:49:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:49:46,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:46,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:49:46,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 15:49:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:49:46,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:49:46,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:49:46,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:49:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:49:46,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:46,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494496001] [2024-10-24 15:49:46,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494496001] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:49:46,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:49:46,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:49:46,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911572069] [2024-10-24 15:49:46,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:49:46,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:49:46,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:49:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:49:46,806 INFO L87 Difference]: Start difference. First operand 2295 states and 4363 transitions. Second operand has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:49:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:49:47,150 INFO L93 Difference]: Finished difference Result 2304 states and 4377 transitions. [2024-10-24 15:49:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:49:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-10-24 15:49:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:49:47,164 INFO L225 Difference]: With dead ends: 2304 [2024-10-24 15:49:47,164 INFO L226 Difference]: Without dead ends: 2304 [2024-10-24 15:49:47,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 15:49:47,168 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 4 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:49:47,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6713 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:49:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-10-24 15:49:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2303. [2024-10-24 15:49:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1292 states have (on average 1.8320433436532508) internal successors, (2367), 2295 states have internal predecessors, (2367), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-24 15:49:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4376 transitions. [2024-10-24 15:49:47,392 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4376 transitions. Word has length 83 [2024-10-24 15:49:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:49:47,392 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 4376 transitions. [2024-10-24 15:49:47,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:49:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4376 transitions. [2024-10-24 15:49:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 15:49:47,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:49:47,394 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:49:47,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 15:49:47,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:47,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:49:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:49:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1820570235, now seen corresponding path program 2 times [2024-10-24 15:49:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:49:47,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217722319] [2024-10-24 15:49:47,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:49:47,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:49:47,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:49:47,599 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:49:47,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 15:49:47,828 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:49:47,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:49:47,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:49:47,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:49:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 15:49:47,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:49:47,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:49:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217722319] [2024-10-24 15:49:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217722319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:49:47,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:49:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:49:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19922868] [2024-10-24 15:49:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:49:47,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:49:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:49:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:49:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:49:47,884 INFO L87 Difference]: Start difference. First operand 2303 states and 4376 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:49:52,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:49:56,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:50:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:03,719 INFO L93 Difference]: Finished difference Result 3435 states and 6550 transitions. [2024-10-24 15:50:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:50:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-10-24 15:50:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:03,732 INFO L225 Difference]: With dead ends: 3435 [2024-10-24 15:50:03,733 INFO L226 Difference]: Without dead ends: 3435 [2024-10-24 15:50:03,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:50:03,734 INFO L432 NwaCegarLoop]: 2310 mSDtfsCounter, 3542 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 895 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4045 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:03,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4045 Valid, 4516 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 618 Invalid, 2 Unknown, 0 Unchecked, 15.7s Time] [2024-10-24 15:50:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2024-10-24 15:50:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3410. [2024-10-24 15:50:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 1898 states have (on average 1.8461538461538463) internal successors, (3504), 3401 states have internal predecessors, (3504), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 6516 transitions. [2024-10-24 15:50:04,025 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 6516 transitions. Word has length 87 [2024-10-24 15:50:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:04,025 INFO L471 AbstractCegarLoop]: Abstraction has 3410 states and 6516 transitions. [2024-10-24 15:50:04,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:50:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 6516 transitions. [2024-10-24 15:50:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 15:50:04,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:04,030 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:04,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 15:50:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:04,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:04,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 624463244, now seen corresponding path program 1 times [2024-10-24 15:50:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922304986] [2024-10-24 15:50:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:50:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:04,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:04,242 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:04,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 15:50:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:50:04,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:50:04,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 15:50:04,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:50:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 15:50:05,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:50:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922304986] [2024-10-24 15:50:05,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922304986] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:50:05,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:50:05,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:50:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494863100] [2024-10-24 15:50:05,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:50:05,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:50:05,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:50:05,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:50:05,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:50:05,112 INFO L87 Difference]: Start difference. First operand 3410 states and 6516 transitions. Second operand has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:50:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:05,970 INFO L93 Difference]: Finished difference Result 3422 states and 6536 transitions. [2024-10-24 15:50:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:50:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-10-24 15:50:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:05,984 INFO L225 Difference]: With dead ends: 3422 [2024-10-24 15:50:05,985 INFO L226 Difference]: Without dead ends: 3420 [2024-10-24 15:50:05,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:50:05,986 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 7 mSDsluCounter, 15651 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17890 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:05,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17890 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 15:50:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2024-10-24 15:50:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3419. [2024-10-24 15:50:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 1907 states have (on average 1.8437336130047195) internal successors, (3516), 3410 states have internal predecessors, (3516), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 6528 transitions. [2024-10-24 15:50:06,294 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 6528 transitions. Word has length 96 [2024-10-24 15:50:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:06,294 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 6528 transitions. [2024-10-24 15:50:06,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:50:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 6528 transitions. [2024-10-24 15:50:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 15:50:06,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:06,295 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:06,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 15:50:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:06,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:06,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1485268743, now seen corresponding path program 2 times [2024-10-24 15:50:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368312161] [2024-10-24 15:50:06,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:50:06,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:06,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:06,502 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:06,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 15:50:06,785 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:50:06,786 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:50:06,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:50:06,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:06,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:50:06,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:50:06,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:50:06,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 15:50:06,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:50:06,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:50:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-24 15:50:06,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:50:06,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:50:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368312161] [2024-10-24 15:50:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368312161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:50:06,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:50:06,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:50:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563155808] [2024-10-24 15:50:06,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:50:06,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:50:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:50:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:50:06,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:50:06,916 INFO L87 Difference]: Start difference. First operand 3419 states and 6528 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:50:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:09,023 INFO L93 Difference]: Finished difference Result 6597 states and 12760 transitions. [2024-10-24 15:50:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:50:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-10-24 15:50:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:09,048 INFO L225 Difference]: With dead ends: 6597 [2024-10-24 15:50:09,048 INFO L226 Difference]: Without dead ends: 6597 [2024-10-24 15:50:09,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:50:09,049 INFO L432 NwaCegarLoop]: 2671 mSDtfsCounter, 1176 mSDsluCounter, 4387 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 7058 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:09,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 7058 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 15:50:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2024-10-24 15:50:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 3423. [2024-10-24 15:50:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 1911 states have (on average 1.8419675562532705) internal successors, (3520), 3414 states have internal predecessors, (3520), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 6532 transitions. [2024-10-24 15:50:09,640 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 6532 transitions. Word has length 105 [2024-10-24 15:50:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:09,640 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 6532 transitions. [2024-10-24 15:50:09,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:50:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 6532 transitions. [2024-10-24 15:50:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 15:50:09,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:09,641 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:09,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-24 15:50:09,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:09,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:09,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -587280888, now seen corresponding path program 1 times [2024-10-24 15:50:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071948504] [2024-10-24 15:50:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:50:09,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:09,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:09,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:09,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 15:50:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:50:10,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:50:10,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 15:50:10,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:50:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 15:50:11,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:50:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071948504] [2024-10-24 15:50:11,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071948504] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:50:11,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:50:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:50:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526037108] [2024-10-24 15:50:11,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:50:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:50:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:50:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:50:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:50:11,075 INFO L87 Difference]: Start difference. First operand 3423 states and 6532 transitions. Second operand has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:50:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:13,327 INFO L93 Difference]: Finished difference Result 3444 states and 6570 transitions. [2024-10-24 15:50:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:50:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-10-24 15:50:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:13,336 INFO L225 Difference]: With dead ends: 3444 [2024-10-24 15:50:13,336 INFO L226 Difference]: Without dead ends: 3442 [2024-10-24 15:50:13,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:50:13,337 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 13 mSDsluCounter, 26834 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29073 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:13,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29073 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 15:50:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-10-24 15:50:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3441. [2024-10-24 15:50:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 1929 states have (on average 1.8372213582166925) internal successors, (3544), 3432 states have internal predecessors, (3544), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 6556 transitions. [2024-10-24 15:50:13,609 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 6556 transitions. Word has length 139 [2024-10-24 15:50:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:13,609 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 6556 transitions. [2024-10-24 15:50:13,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:50:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 6556 transitions. [2024-10-24 15:50:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 15:50:13,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:13,610 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:13,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 15:50:13,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:13,811 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:13,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:13,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1645925544, now seen corresponding path program 2 times [2024-10-24 15:50:13,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:13,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500873363] [2024-10-24 15:50:13,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:50:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:13,813 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:13,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 15:50:14,150 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:50:14,150 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:50:14,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:50:14,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-24 15:50:14,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:50:14,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:50:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500873363] [2024-10-24 15:50:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500873363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:50:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:50:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:50:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299698773] [2024-10-24 15:50:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:50:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:50:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:50:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:50:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:50:14,191 INFO L87 Difference]: Start difference. First operand 3441 states and 6556 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:50:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:14,377 INFO L93 Difference]: Finished difference Result 3501 states and 6616 transitions. [2024-10-24 15:50:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:50:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-10-24 15:50:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:14,386 INFO L225 Difference]: With dead ends: 3501 [2024-10-24 15:50:14,386 INFO L226 Difference]: Without dead ends: 3501 [2024-10-24 15:50:14,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:50:14,387 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 7 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:14,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4428 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:50:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-10-24 15:50:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3501. [2024-10-24 15:50:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 1989 states have (on average 1.811965811965812) internal successors, (3604), 3492 states have internal predecessors, (3604), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 6616 transitions. [2024-10-24 15:50:14,672 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 6616 transitions. Word has length 157 [2024-10-24 15:50:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:14,672 INFO L471 AbstractCegarLoop]: Abstraction has 3501 states and 6616 transitions. [2024-10-24 15:50:14,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:50:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 6616 transitions. [2024-10-24 15:50:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 15:50:14,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:14,675 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:14,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 15:50:14,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:14,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:14,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1485668948, now seen corresponding path program 1 times [2024-10-24 15:50:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163671161] [2024-10-24 15:50:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:50:14,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:14,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:14,880 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:14,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 15:50:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:50:15,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 15:50:15,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 15:50:16,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:50:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 15:50:18,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:50:18,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163671161] [2024-10-24 15:50:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163671161] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:50:18,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:50:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:50:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018992149] [2024-10-24 15:50:18,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:50:18,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:50:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:50:18,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:50:18,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:50:18,139 INFO L87 Difference]: Start difference. First operand 3501 states and 6616 transitions. Second operand has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:50:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:27,725 INFO L93 Difference]: Finished difference Result 3538 states and 6686 transitions. [2024-10-24 15:50:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:50:27,726 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 157 [2024-10-24 15:50:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:27,735 INFO L225 Difference]: With dead ends: 3538 [2024-10-24 15:50:27,735 INFO L226 Difference]: Without dead ends: 3536 [2024-10-24 15:50:27,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:50:27,738 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 26 mSDsluCounter, 53666 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55905 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:27,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55905 Invalid, 2067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 15:50:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2024-10-24 15:50:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3535. [2024-10-24 15:50:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 2023 states have (on average 1.8042511122095897) internal successors, (3650), 3526 states have internal predecessors, (3650), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 6662 transitions. [2024-10-24 15:50:28,029 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 6662 transitions. Word has length 157 [2024-10-24 15:50:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:28,030 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 6662 transitions. [2024-10-24 15:50:28,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:50:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 6662 transitions. [2024-10-24 15:50:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 15:50:28,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:28,031 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:28,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 15:50:28,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:28,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:28,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1825277644, now seen corresponding path program 2 times [2024-10-24 15:50:28,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:28,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847503346] [2024-10-24 15:50:28,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:50:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:28,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:28,240 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:28,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 15:50:28,605 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:50:28,605 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:50:28,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:50:28,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-10-24 15:50:28,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:50:28,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:50:28,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847503346] [2024-10-24 15:50:28,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847503346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:50:28,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:50:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:50:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502901685] [2024-10-24 15:50:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:50:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:50:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:50:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:50:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:50:28,649 INFO L87 Difference]: Start difference. First operand 3535 states and 6662 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:50:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:28,869 INFO L93 Difference]: Finished difference Result 3484 states and 6578 transitions. [2024-10-24 15:50:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:50:28,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 191 [2024-10-24 15:50:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:28,878 INFO L225 Difference]: With dead ends: 3484 [2024-10-24 15:50:28,878 INFO L226 Difference]: Without dead ends: 3484 [2024-10-24 15:50:28,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:50:28,879 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 32 mSDsluCounter, 4404 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6612 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:28,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6612 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:50:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2024-10-24 15:50:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3484. [2024-10-24 15:50:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 1972 states have (on average 1.808316430020284) internal successors, (3566), 3475 states have internal predecessors, (3566), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 6578 transitions. [2024-10-24 15:50:29,164 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 6578 transitions. Word has length 191 [2024-10-24 15:50:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:29,165 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 6578 transitions. [2024-10-24 15:50:29,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:50:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 6578 transitions. [2024-10-24 15:50:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 15:50:29,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:29,167 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:29,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 15:50:29,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:29,367 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:29,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash -445753474, now seen corresponding path program 1 times [2024-10-24 15:50:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:29,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010773474] [2024-10-24 15:50:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:50:29,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:29,370 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:29,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 15:50:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:50:30,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 15:50:30,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:50:31,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:50:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:50:34,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:50:34,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010773474] [2024-10-24 15:50:34,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010773474] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:50:34,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:50:34,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:50:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878789282] [2024-10-24 15:50:34,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:50:34,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:50:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:50:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:50:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:50:34,187 INFO L87 Difference]: Start difference. First operand 3484 states and 6578 transitions. Second operand has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:50:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:50:43,219 INFO L93 Difference]: Finished difference Result 3511 states and 6632 transitions. [2024-10-24 15:50:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 15:50:43,220 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 191 [2024-10-24 15:50:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:50:43,228 INFO L225 Difference]: With dead ends: 3511 [2024-10-24 15:50:43,229 INFO L226 Difference]: Without dead ends: 3511 [2024-10-24 15:50:43,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 15:50:43,231 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 27 mSDsluCounter, 57828 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60055 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:50:43,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60055 Invalid, 1527 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 15:50:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-24 15:50:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3509. [2024-10-24 15:50:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 1997 states have (on average 1.8107160741111668) internal successors, (3616), 3500 states have internal predecessors, (3616), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:50:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 6628 transitions. [2024-10-24 15:50:43,506 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 6628 transitions. Word has length 191 [2024-10-24 15:50:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:50:43,506 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 6628 transitions. [2024-10-24 15:50:43,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:50:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 6628 transitions. [2024-10-24 15:50:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-24 15:50:43,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:50:43,508 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:50:43,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-24 15:50:43,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:43,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:50:43,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:50:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1363813341, now seen corresponding path program 2 times [2024-10-24 15:50:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:50:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691340446] [2024-10-24 15:50:43,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:50:43,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 15:50:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:50:43,711 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 15:50:43,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 15:50:45,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:50:45,409 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:50:45,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 15:50:45,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:50:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:50:47,187 INFO L311 TraceCheckSpWp]: Computing backward predicates...