./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-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 f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:50:44,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:50:44,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:50:44,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:50:44,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:50:44,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:50:44,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:50:44,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:50:44,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:50:44,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:50:44,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:50:44,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:50:44,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:50:44,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:50:44,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:50:44,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:50:44,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:50:44,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:50:44,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:50:44,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:50:44,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:50:44,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:50:44,759 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:50:44,760 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:50:44,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:50:44,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:50:44,760 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:50:44,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:50:44,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:50:44,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:50:44,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:50:44,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:50:44,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:50:44,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:50:44,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:50:44,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:50:44,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:50:44,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:50:44,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:50:44,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:50:44,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:50:44,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:50:44,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:50:44,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:50:44,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:50:44,766 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 -> f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 [2024-11-10 14:50:45,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:50:45,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:50:45,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:50:45,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:50:45,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:50:45,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-10 14:50:46,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:50:46,780 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:50:46,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-10 14:50:46,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca7b183e/4555a94387c4410cb7d2e5995e58009e/FLAG3c89a7550 [2024-11-10 14:50:47,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca7b183e/4555a94387c4410cb7d2e5995e58009e [2024-11-10 14:50:47,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:50:47,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:50:47,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:50:47,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:50:47,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:50:47,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:50:47" (1/1) ... [2024-11-10 14:50:47,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3634ea7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:47, skipping insertion in model container [2024-11-10 14:50:47,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:50:47" (1/1) ... [2024-11-10 14:50:47,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:50:47,535 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,578 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,589 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,592 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,604 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,621 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,624 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,626 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,631 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,632 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,634 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,642 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:47,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:50:47,667 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-11-10 14:50:47,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4969c46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:47, skipping insertion in model container [2024-11-10 14:50:47,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:50:47,669 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 14:50:47,671 INFO L158 Benchmark]: Toolchain (without parser) took 585.18ms. Allocated memory is still 153.1MB. Free memory was 95.0MB in the beginning and 74.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 14:50:47,671 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 153.1MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:50:47,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.18ms. Allocated memory is still 153.1MB. Free memory was 95.0MB in the beginning and 74.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 14:50:47,673 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.23ms. Allocated memory is still 153.1MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.18ms. Allocated memory is still 153.1MB. Free memory was 95.0MB in the beginning and 74.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 764]: 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/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-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 f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:50:49,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:50:49,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-10 14:50:49,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:50:49,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:50:49,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:50:49,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:50:49,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:50:49,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:50:49,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:50:49,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:50:49,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:50:49,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:50:49,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:50:49,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:50:49,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:50:49,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:50:49,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:50:49,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:50:49,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:50:49,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:50:49,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:50:49,866 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:50:49,866 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:50:49,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:50:49,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:50:49,868 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:50:49,868 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 14:50:49,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:50:49,869 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 14:50:49,869 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:50:49,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:50:49,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:50:49,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:50:49,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:50:49,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:50:49,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:50:49,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:50:49,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:50:49,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:50:49,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:50:49,873 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 14:50:49,873 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 14:50:49,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:50:49,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:50:49,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:50:49,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:50:49,874 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 -> f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385 [2024-11-10 14:50:50,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:50:50,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:50:50,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:50:50,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:50:50,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:50:50,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-10 14:50:51,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:50:51,960 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:50:51,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i [2024-11-10 14:50:51,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b353d289a/1764d84062e940cbb95dd42d75d03931/FLAG43e36f9a9 [2024-11-10 14:50:52,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b353d289a/1764d84062e940cbb95dd42d75d03931 [2024-11-10 14:50:52,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:50:52,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:50:52,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:50:52,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:50:52,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:50:52,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:50:52" (1/1) ... [2024-11-10 14:50:52,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac243e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:52, skipping insertion in model container [2024-11-10 14:50:52,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:50:52" (1/1) ... [2024-11-10 14:50:52,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:50:52,735 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,773 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,783 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,790 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,797 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,818 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,820 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,825 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,826 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,827 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,831 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,834 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:50:52,857 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 14:50:52,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:50:52,916 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,937 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,944 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,946 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,951 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,958 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,960 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,962 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,963 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,963 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,964 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,967 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:50:52,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:50:52,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:50:53,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:50:53,097 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:50:53,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53 WrapperNode [2024-11-10 14:50:53,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:50:53,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:50:53,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:50:53,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:50:53,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,204 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 769 [2024-11-10 14:50:53,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:50:53,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:50:53,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:50:53,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:50:53,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,308 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-10 14:50:53,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,356 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:50:53,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:50:53,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:50:53,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:50:53,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (1/1) ... [2024-11-10 14:50:53,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:50:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:50:53,427 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-11-10 14:50:53,435 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-11-10 14:50:53,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 14:50:53,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 14:50:53,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 14:50:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 14:50:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 14:50:53,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 14:50:53,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 14:50:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 14:50:53,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 14:50:53,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 14:50:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:50:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:50:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:50:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:50:53,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:50:53,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:50:53,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:50:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 14:50:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 14:50:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 14:50:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 14:50:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:50:53,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:50:53,718 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:50:53,721 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:51:01,243 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-10 14:51:01,243 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:51:01,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:51:01,261 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:51:01,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:51:01 BoogieIcfgContainer [2024-11-10 14:51:01,261 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:51:01,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:51:01,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:51:01,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:51:01,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:50:52" (1/3) ... [2024-11-10 14:51:01,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a11002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:51:01, skipping insertion in model container [2024-11-10 14:51:01,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:53" (2/3) ... [2024-11-10 14:51:01,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a11002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:51:01, skipping insertion in model container [2024-11-10 14:51:01,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:51:01" (3/3) ... [2024-11-10 14:51:01,268 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-2.i [2024-11-10 14:51:01,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:51:01,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:51:01,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:51:01,346 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;@5ac0aecc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:51:01,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:51:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 151 states have (on average 1.6291390728476822) internal successors, (246), 163 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 14:51:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 14:51:01,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:01,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:51:01,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:01,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1402945885, now seen corresponding path program 1 times [2024-11-10 14:51:01,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:01,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183452984] [2024-11-10 14:51:01,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:51:01,377 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-11-10 14:51:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:01,398 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-11-10 14:51:01,399 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-11-10 14:51:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:01,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 14:51:01,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:51:01,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:51:01,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:01,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183452984] [2024-11-10 14:51:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183452984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:51:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:51:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:51:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359554610] [2024-11-10 14:51:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:51:01,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:51:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:51:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:51:01,612 INFO L87 Difference]: Start difference. First operand has 169 states, 151 states have (on average 1.6291390728476822) internal successors, (246), 163 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11-10 14:51:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:01,649 INFO L93 Difference]: Finished difference Result 168 states and 225 transitions. [2024-11-10 14:51:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:51:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 12 [2024-11-10 14:51:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:01,661 INFO L225 Difference]: With dead ends: 168 [2024-11-10 14:51:01,661 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 14:51:01,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11-10 14:51:01,666 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:01,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:51:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 14:51:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-10 14:51:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 159 states have internal predecessors, (196), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 14:51:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2024-11-10 14:51:01,786 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 12 [2024-11-10 14:51:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:01,787 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2024-11-10 14:51:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11-10 14:51:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2024-11-10 14:51:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 14:51:01,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:01,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:51:01,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 14:51:01,989 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-11-10 14:51:01,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:01,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1140123897, now seen corresponding path program 1 times [2024-11-10 14:51:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227195431] [2024-11-10 14:51:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:51:01,991 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-11-10 14:51:01,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:01,995 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-11-10 14:51:01,997 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-11-10 14:51:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:02,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:51:02,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:51:02,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:51:02,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227195431] [2024-11-10 14:51:02,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227195431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:51:02,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:51:02,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:51:02,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179540759] [2024-11-10 14:51:02,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:51:02,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:51:02,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:51:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:51:02,153 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-10 14:51:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:02,361 INFO L93 Difference]: Finished difference Result 257 states and 340 transitions. [2024-11-10 14:51:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:51:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-10 14:51:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:02,369 INFO L225 Difference]: With dead ends: 257 [2024-11-10 14:51:02,369 INFO L226 Difference]: Without dead ends: 257 [2024-11-10 14:51:02,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-11-10 14:51:02,371 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 110 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:02,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 436 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:51:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-10 14:51:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 167. [2024-11-10 14:51:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 150 states have (on average 1.32) internal successors, (198), 161 states have internal predecessors, (198), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 14:51:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 224 transitions. [2024-11-10 14:51:02,389 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 224 transitions. Word has length 13 [2024-11-10 14:51:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:02,389 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 224 transitions. [2024-11-10 14:51:02,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11-10 14:51:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2024-11-10 14:51:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 14:51:02,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:02,394 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 14:51:02,398 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-11-10 14:51:02,594 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-11-10 14:51:02,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1603320315, now seen corresponding path program 1 times [2024-11-10 14:51:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213284653] [2024-11-10 14:51:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:51:02,597 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-11-10 14:51:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:02,600 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-11-10 14:51:02,601 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-11-10 14:51:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:03,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:51:03,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:51:03,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:51:03,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:03,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213284653] [2024-11-10 14:51:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213284653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:51:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:51:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:51:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121692824] [2024-11-10 14:51:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:51:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:51:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:51:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:51:03,071 INFO L87 Difference]: Start difference. First operand 167 states and 224 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (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-11-10 14:51:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:03,216 INFO L93 Difference]: Finished difference Result 170 states and 219 transitions. [2024-11-10 14:51:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:51:03,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (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 70 [2024-11-10 14:51:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:03,219 INFO L225 Difference]: With dead ends: 170 [2024-11-10 14:51:03,219 INFO L226 Difference]: Without dead ends: 170 [2024-11-10 14:51:03,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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-11-10 14:51:03,220 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 30 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:03,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 556 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:51:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-10 14:51:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-10 14:51:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 153 states have (on average 1.261437908496732) internal successors, (193), 164 states have internal predecessors, (193), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 14:51:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2024-11-10 14:51:03,240 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 70 [2024-11-10 14:51:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:03,241 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2024-11-10 14:51:03,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (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-11-10 14:51:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2024-11-10 14:51:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 14:51:03,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:03,244 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 14:51:03,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 14:51:03,445 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-11-10 14:51:03,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 7902197, now seen corresponding path program 1 times [2024-11-10 14:51:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:03,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444693172] [2024-11-10 14:51:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:51:03,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:51:03,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:03,451 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-11-10 14:51:03,452 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-11-10 14:51:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:03,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:51:03,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:51:04,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:51:04,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:04,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444693172] [2024-11-10 14:51:04,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444693172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:51:04,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:51:04,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:51:04,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003844017] [2024-11-10 14:51:04,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:51:04,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:51:04,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:04,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:51:04,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:51:04,170 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-10 14:51:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:04,786 INFO L93 Difference]: Finished difference Result 245 states and 307 transitions. [2024-11-10 14:51:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:51:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 70 [2024-11-10 14:51:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:04,796 INFO L225 Difference]: With dead ends: 245 [2024-11-10 14:51:04,796 INFO L226 Difference]: Without dead ends: 245 [2024-11-10 14:51:04,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-11-10 14:51:04,799 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 43 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:04,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 427 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 14:51:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-10 14:51:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2024-11-10 14:51:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 196 states have (on average 1.2244897959183674) internal successors, (240), 207 states have internal predecessors, (240), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 14:51:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 266 transitions. [2024-11-10 14:51:04,810 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 266 transitions. Word has length 70 [2024-11-10 14:51:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:04,811 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 266 transitions. [2024-11-10 14:51:04,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-10 14:51:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 266 transitions. [2024-11-10 14:51:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 14:51:04,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:04,813 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, 1, 1] [2024-11-10 14:51:04,822 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-11-10 14:51:05,013 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-11-10 14:51:05,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 958572766, now seen corresponding path program 1 times [2024-11-10 14:51:05,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963511285] [2024-11-10 14:51:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:51:05,016 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-11-10 14:51:05,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:05,018 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-11-10 14:51:05,025 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-11-10 14:51:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:05,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:51:05,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:51:05,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:51:05,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:05,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963511285] [2024-11-10 14:51:05,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963511285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:51:05,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:51:05,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:51:05,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672342961] [2024-11-10 14:51:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:51:05,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:51:05,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:05,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:51:05,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:51:05,471 INFO L87 Difference]: Start difference. First operand 213 states and 266 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:51:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:05,512 INFO L93 Difference]: Finished difference Result 216 states and 270 transitions. [2024-11-10 14:51:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:51:05,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2024-11-10 14:51:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:05,514 INFO L225 Difference]: With dead ends: 216 [2024-11-10 14:51:05,514 INFO L226 Difference]: Without dead ends: 216 [2024-11-10 14:51:05,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 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-11-10 14:51:05,515 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:05,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:51:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-10 14:51:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-10 14:51:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 198 states have (on average 1.2272727272727273) internal successors, (243), 210 states have internal predecessors, (243), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 14:51:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 270 transitions. [2024-11-10 14:51:05,529 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 270 transitions. Word has length 85 [2024-11-10 14:51:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:05,529 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 270 transitions. [2024-11-10 14:51:05,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 14:51:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 270 transitions. [2024-11-10 14:51:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 14:51:05,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:05,535 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1] [2024-11-10 14:51:05,546 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-11-10 14:51:05,736 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-11-10 14:51:05,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:05,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -156424350, now seen corresponding path program 1 times [2024-11-10 14:51:05,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:05,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192284354] [2024-11-10 14:51:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:51:05,738 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-11-10 14:51:05,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:05,741 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-11-10 14:51:05,742 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-11-10 14:51:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:06,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:51:06,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 14:51:06,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:51:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:51:06,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192284354] [2024-11-10 14:51:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192284354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:51:06,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:51:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 14:51:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592345433] [2024-11-10 14:51:06,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:51:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:51:06,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:51:06,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:51:06,309 INFO L87 Difference]: Start difference. First operand 216 states and 270 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-11-10 14:51:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:06,459 INFO L93 Difference]: Finished difference Result 227 states and 286 transitions. [2024-11-10 14:51:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:51:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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 87 [2024-11-10 14:51:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:06,461 INFO L225 Difference]: With dead ends: 227 [2024-11-10 14:51:06,461 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 14:51:06,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 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-11-10 14:51:06,462 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 5 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:06,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 623 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:51:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 14:51:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2024-11-10 14:51:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 218 states have internal predecessors, (257), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 14:51:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 284 transitions. [2024-11-10 14:51:06,474 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 284 transitions. Word has length 87 [2024-11-10 14:51:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:06,474 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 284 transitions. [2024-11-10 14:51:06,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-11-10 14:51:06,475 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2024-11-10 14:51:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 14:51:06,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:06,480 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1] [2024-11-10 14:51:06,493 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-11-10 14:51:06,681 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-11-10 14:51:06,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:06,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash -574514978, now seen corresponding path program 2 times [2024-11-10 14:51:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:06,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606066219] [2024-11-10 14:51:06,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:51:06,683 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-11-10 14:51:06,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:06,684 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-11-10 14:51:06,685 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-11-10 14:51:07,078 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:51:07,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:51:07,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 14:51:07,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:51:07,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:51:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:51:07,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606066219] [2024-11-10 14:51:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606066219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:51:07,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:51:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 14:51:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745035360] [2024-11-10 14:51:07,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:51:07,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 14:51:07,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 14:51:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 14:51:07,393 INFO L87 Difference]: Start difference. First operand 225 states and 284 transitions. Second operand has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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-11-10 14:51:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:07,943 INFO L93 Difference]: Finished difference Result 240 states and 306 transitions. [2024-11-10 14:51:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 14:51:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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 91 [2024-11-10 14:51:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:07,946 INFO L225 Difference]: With dead ends: 240 [2024-11-10 14:51:07,946 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 14:51:07,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:51:07,948 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:07,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1241 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 14:51:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 14:51:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-11-10 14:51:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 227 states have internal predecessors, (269), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-10 14:51:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 296 transitions. [2024-11-10 14:51:07,959 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 296 transitions. Word has length 91 [2024-11-10 14:51:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:07,961 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 296 transitions. [2024-11-10 14:51:07,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.857142857142857) internal successors, (96), 14 states have internal predecessors, (96), 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-11-10 14:51:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 296 transitions. [2024-11-10 14:51:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 14:51:07,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:07,962 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 1, 1] [2024-11-10 14:51:07,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-10 14:51:08,163 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-11-10 14:51:08,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:08,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash -125443274, now seen corresponding path program 3 times [2024-11-10 14:51:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:08,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539825209] [2024-11-10 14:51:08,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:51:08,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:51:08,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:08,166 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-11-10 14:51:08,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 14:51:08,565 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:51:08,566 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:51:08,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:51:08,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-10 14:51:08,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:51:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-10 14:51:08,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539825209] [2024-11-10 14:51:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539825209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:51:08,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:51:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 14:51:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305957679] [2024-11-10 14:51:08,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:51:08,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:51:08,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:51:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:51:08,964 INFO L87 Difference]: Start difference. First operand 234 states and 296 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:51:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:09,361 INFO L93 Difference]: Finished difference Result 474 states and 588 transitions. [2024-11-10 14:51:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:51:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 100 [2024-11-10 14:51:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:09,364 INFO L225 Difference]: With dead ends: 474 [2024-11-10 14:51:09,366 INFO L226 Difference]: Without dead ends: 474 [2024-11-10 14:51:09,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:51:09,367 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 448 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:09,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 852 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 14:51:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-10 14:51:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2024-11-10 14:51:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 446 states have (on average 1.210762331838565) internal successors, (540), 458 states have internal predecessors, (540), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-10 14:51:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 588 transitions. [2024-11-10 14:51:09,385 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 588 transitions. Word has length 100 [2024-11-10 14:51:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:09,387 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 588 transitions. [2024-11-10 14:51:09,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:51:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 588 transitions. [2024-11-10 14:51:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-10 14:51:09,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:09,391 INFO L215 NwaCegarLoop]: trace histogram [15, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 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] [2024-11-10 14:51:09,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-10 14:51:09,592 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-11-10 14:51:09,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:09,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1795110746, now seen corresponding path program 1 times [2024-11-10 14:51:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141523953] [2024-11-10 14:51:09,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:51:09,594 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-11-10 14:51:09,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:09,597 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-11-10 14:51:09,598 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-11-10 14:51:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:51:10,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 14:51:10,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 188 proven. 55 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-10 14:51:10,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:51:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 119 proven. 123 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-10 14:51:11,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141523953] [2024-11-10 14:51:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141523953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:51:11,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:51:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 14:51:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007428046] [2024-11-10 14:51:11,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:51:11,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 14:51:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 14:51:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 14:51:11,397 INFO L87 Difference]: Start difference. First operand 474 states and 588 transitions. Second operand has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 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-11-10 14:51:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:12,885 INFO L93 Difference]: Finished difference Result 498 states and 631 transitions. [2024-11-10 14:51:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 14:51:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 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 271 [2024-11-10 14:51:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:12,890 INFO L225 Difference]: With dead ends: 498 [2024-11-10 14:51:12,890 INFO L226 Difference]: Without dead ends: 494 [2024-11-10 14:51:12,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 14:51:12,892 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 13 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:12,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2477 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 14:51:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-10 14:51:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2024-11-10 14:51:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 464 states have (on average 1.2155172413793103) internal successors, (564), 476 states have internal predecessors, (564), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-10 14:51:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 612 transitions. [2024-11-10 14:51:12,910 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 612 transitions. Word has length 271 [2024-11-10 14:51:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:12,911 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 612 transitions. [2024-11-10 14:51:12,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.6923076923076925) internal successors, (148), 26 states have internal predecessors, (148), 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-11-10 14:51:12,911 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 612 transitions. [2024-11-10 14:51:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-10 14:51:12,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:12,917 INFO L215 NwaCegarLoop]: trace histogram [33, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 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] [2024-11-10 14:51:12,940 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-11-10 14:51:13,118 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-11-10 14:51:13,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:13,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash 590756006, now seen corresponding path program 2 times [2024-11-10 14:51:13,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:13,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810636355] [2024-11-10 14:51:13,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:51:13,120 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-11-10 14:51:13,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:13,121 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-11-10 14:51:13,122 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-11-10 14:51:14,196 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:51:14,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:51:14,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 14:51:14,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:51:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 398 proven. 253 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-10 14:51:14,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:51:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 119 proven. 531 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-10 14:51:16,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:51:16,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810636355] [2024-11-10 14:51:16,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810636355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:51:16,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:51:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 14:51:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601013902] [2024-11-10 14:51:16,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:51:16,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 14:51:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:51:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 14:51:16,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 14:51:16,184 INFO L87 Difference]: Start difference. First operand 492 states and 612 transitions. Second operand has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 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-11-10 14:51:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:51:21,745 INFO L93 Difference]: Finished difference Result 532 states and 687 transitions. [2024-11-10 14:51:21,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 14:51:21,746 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 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 289 [2024-11-10 14:51:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:51:21,749 INFO L225 Difference]: With dead ends: 532 [2024-11-10 14:51:21,749 INFO L226 Difference]: Without dead ends: 528 [2024-11-10 14:51:21,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 14:51:21,752 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 26 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5356 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:51:21,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5356 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 14:51:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-10 14:51:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 526. [2024-11-10 14:51:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 498 states have (on average 1.2248995983935742) internal successors, (610), 510 states have internal predecessors, (610), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2024-11-10 14:51:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 658 transitions. [2024-11-10 14:51:21,765 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 658 transitions. Word has length 289 [2024-11-10 14:51:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:51:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 658 transitions. [2024-11-10 14:51:21,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.44) internal successors, (172), 50 states have internal predecessors, (172), 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-11-10 14:51:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 658 transitions. [2024-11-10 14:51:21,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-10 14:51:21,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:51:21,769 INFO L215 NwaCegarLoop]: trace histogram [67, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 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] [2024-11-10 14:51:21,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 14:51:21,970 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-11-10 14:51:21,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:51:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:51:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1645616678, now seen corresponding path program 3 times [2024-11-10 14:51:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:51:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57569571] [2024-11-10 14:51:21,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:51:21,972 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-11-10 14:51:21,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:51:21,973 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-11-10 14:51:21,974 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