./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_BER_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:24:48,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:24:48,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:24:48,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:24:48,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:24:48,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:24:48,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:24:48,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:24:48,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:24:48,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:24:48,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:24:48,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:24:48,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:24:48,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:24:48,684 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:24:48,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:24:48,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:24:48,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:24:48,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:24:48,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:24:48,689 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:24:48,690 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:24:48,690 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:24:48,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:24:48,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:24:48,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:24:48,691 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:24:48,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:24:48,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:24:48,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:24:48,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:24:48,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:24:48,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:24:48,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:48,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:24:48,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:24:48,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:24:48,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:24:48,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:24:48,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:24:48,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:24:48,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:24:48,697 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-10 17:24:48,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:24:48,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:24:48,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:24:48,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:24:48,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:24:48,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 17:24:50,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:24:50,589 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:24:50,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 17:24:50,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11750b013/f398561bfe4744c1bb5f08a795f192a6/FLAG5e6edb7d5 [2024-11-10 17:24:50,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11750b013/f398561bfe4744c1bb5f08a795f192a6 [2024-11-10 17:24:50,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:24:50,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:24:50,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:50,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:24:50,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:24:50,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d58725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50, skipping insertion in model container [2024-11-10 17:24:50,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:24:51,396 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 17:24:51,437 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 17:24:51,441 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 17:24:51,446 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 17:24:51,458 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 17:24:51,501 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 17:24:51,502 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 17:24:51,507 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 17:24:51,514 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 17:24:51,528 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 17:24:51,529 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 17:24:51,531 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 17:24:51,532 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 17:24:51,536 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 17:24:51,536 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 17:24:51,543 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 17:24:51,544 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 17:24:51,548 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 17:24:51,548 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 17:24:51,551 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 17:24:51,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:51,576 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 17:24:51,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2e8f1185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51, skipping insertion in model container [2024-11-10 17:24:51,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:51,578 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:24:51,580 INFO L158 Benchmark]: Toolchain (without parser) took 674.20ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 58.0MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 17:24:51,580 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:24:51,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.59ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 58.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 17:24:51,582 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.19ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.59ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 58.3MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 769]: 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_BER_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:24:53,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:24:53,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:24:53,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:24:53,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:24:53,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:24:53,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:24:53,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:24:53,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:24:53,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:24:53,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:24:53,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:24:53,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:24:53,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:24:53,689 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:24:53,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:24:53,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:24:53,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:24:53,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:24:53,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:24:53,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:24:53,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:24:53,694 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:24:53,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:24:53,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:24:53,695 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:24:53,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:24:53,695 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:24:53,696 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:24:53,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:24:53,696 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:24:53,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:24:53,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:24:53,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:24:53,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:24:53,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:53,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:24:53,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:24:53,698 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:24:53,698 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:24:53,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:24:53,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:24:53,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:24:53,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:24:53,699 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-10 17:24:54,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:24:54,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:24:54,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:24:54,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:24:54,026 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:24:54,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 17:24:55,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:24:55,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:24:55,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-10 17:24:55,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990269316/7d8d31a847fc446b846bcac6e5fba383/FLAG1bffc61a4 [2024-11-10 17:24:56,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990269316/7d8d31a847fc446b846bcac6e5fba383 [2024-11-10 17:24:56,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:24:56,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:24:56,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:56,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:24:56,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:24:56,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:56" (1/1) ... [2024-11-10 17:24:56,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d3894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:56, skipping insertion in model container [2024-11-10 17:24:56,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:56" (1/1) ... [2024-11-10 17:24:56,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:24:56,548 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 17:24:56,586 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 17:24:56,597 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 17:24:56,601 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 17:24:56,611 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 17:24:56,662 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 17:24:56,664 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 17:24:56,668 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 17:24:56,675 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 17:24:56,690 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 17:24:56,695 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 17:24:56,697 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 17:24:56,698 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 17:24:56,701 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 17:24:56,702 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 17:24:56,708 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 17:24:56,708 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 17:24:56,711 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 17:24:56,711 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 17:24:56,714 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 17:24:56,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:56,742 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:24:56,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:24:56,785 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 17:24:56,794 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 17:24:56,796 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 17:24:56,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 17:24:56,801 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 17:24:56,815 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 17:24:56,817 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 17:24:56,819 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 17:24:56,822 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 17:24:56,829 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 17:24:56,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 17:24:56,845 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 17:24:56,848 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 17:24:56,849 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 17:24:56,850 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 17:24:56,856 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 17:24:56,858 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 17:24:56,859 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 17:24:56,859 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 17:24:56,862 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 17:24:56,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:56,875 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:24:56,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:57,015 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:24:57,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57 WrapperNode [2024-11-10 17:24:57,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:57,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:24:57,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:24:57,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:24:57,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,153 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1455 [2024-11-10 17:24:57,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:24:57,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:24:57,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:24:57,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:24:57,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,303 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-10 17:24:57,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:24:57,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:24:57,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:24:57,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:24:57,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (1/1) ... [2024-11-10 17:24:57,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:57,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:24:57,454 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 17:24:57,457 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 17:24:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:24:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:24:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:24:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:24:57,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:24:57,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:24:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:24:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:24:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:24:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:24:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:24:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:24:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:24:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:24:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:24:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:24:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:24:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:24:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:24:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:24:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:24:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:24:57,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:24:57,768 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:24:57,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:25:02,561 INFO L? ?]: Removed 1748 outVars from TransFormulas that were not future-live. [2024-11-10 17:25:02,562 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:25:02,605 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:25:02,609 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:25:02,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:25:02 BoogieIcfgContainer [2024-11-10 17:25:02,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:25:02,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:25:02,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:25:02,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:25:02,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:24:56" (1/3) ... [2024-11-10 17:25:02,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f28767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:02, skipping insertion in model container [2024-11-10 17:25:02,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:57" (2/3) ... [2024-11-10 17:25:02,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f28767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:02, skipping insertion in model container [2024-11-10 17:25:02,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:25:02" (3/3) ... [2024-11-10 17:25:02,620 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2024-11-10 17:25:02,636 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:25:02,637 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 831 error locations. [2024-11-10 17:25:02,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:25:02,709 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;@73caf120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:25:02,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 831 error locations. [2024-11-10 17:25:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 1666 states, 822 states have (on average 2.2031630170316303) internal successors, (1811), 1657 states have internal predecessors, (1811), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:25:02,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:02,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:25:02,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr828REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:02,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash -100360771, now seen corresponding path program 1 times [2024-11-10 17:25:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991946522] [2024-11-10 17:25:02,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:02,736 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 17:25:02,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:02,737 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 17:25:02,758 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 17:25:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:02,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 17:25:02,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:02,971 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 17:25:02,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:02,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:02,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991946522] [2024-11-10 17:25:02,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991946522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:02,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:02,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:25:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882447587] [2024-11-10 17:25:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:02,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:25:02,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:25:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:25:03,017 INFO L87 Difference]: Start difference. First operand has 1666 states, 822 states have (on average 2.2031630170316303) internal successors, (1811), 1657 states have internal predecessors, (1811), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:03,135 INFO L93 Difference]: Finished difference Result 1645 states and 1736 transitions. [2024-11-10 17:25:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:25:03,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:25:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:03,184 INFO L225 Difference]: With dead ends: 1645 [2024-11-10 17:25:03,189 INFO L226 Difference]: Without dead ends: 1642 [2024-11-10 17:25:03,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:25:03,199 INFO L432 NwaCegarLoop]: 1736 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, 1736 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 17:25:03,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2024-11-10 17:25:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2024-11-10 17:25:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 809 states have (on average 2.1025957972805935) internal successors, (1701), 1633 states have internal predecessors, (1701), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 1733 transitions. [2024-11-10 17:25:03,367 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 1733 transitions. Word has length 6 [2024-11-10 17:25:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:03,367 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 1733 transitions. [2024-11-10 17:25:03,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 1733 transitions. [2024-11-10 17:25:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:25:03,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:03,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:25:03,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:03,568 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 17:25:03,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr828REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -100360740, now seen corresponding path program 1 times [2024-11-10 17:25:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895113501] [2024-11-10 17:25:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:03,571 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 17:25:03,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:03,572 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 17:25:03,574 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 17:25:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:03,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:03,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:03,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:03,764 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 17:25:03,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:03,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895113501] [2024-11-10 17:25:03,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895113501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:03,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:25:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758039666] [2024-11-10 17:25:03,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:03,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:03,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:03,769 INFO L87 Difference]: Start difference. First operand 1642 states and 1733 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:05,991 INFO L93 Difference]: Finished difference Result 1551 states and 1643 transitions. [2024-11-10 17:25:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:25:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:05,998 INFO L225 Difference]: With dead ends: 1551 [2024-11-10 17:25:05,999 INFO L226 Difference]: Without dead ends: 1551 [2024-11-10 17:25:05,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:06,000 INFO L432 NwaCegarLoop]: 1027 mSDtfsCounter, 1061 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:06,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1244 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:25:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-10 17:25:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1548. [2024-11-10 17:25:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 809 states have (on average 1.9864029666254635) internal successors, (1607), 1539 states have internal predecessors, (1607), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1639 transitions. [2024-11-10 17:25:06,035 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1639 transitions. Word has length 6 [2024-11-10 17:25:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:06,036 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 1639 transitions. [2024-11-10 17:25:06,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1639 transitions. [2024-11-10 17:25:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:25:06,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:06,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:25:06,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:06,239 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 17:25:06,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr829REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:06,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash -100360739, now seen corresponding path program 1 times [2024-11-10 17:25:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:06,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991279302] [2024-11-10 17:25:06,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:06,241 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 17:25:06,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:06,244 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 17:25:06,245 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 17:25:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:06,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:25:06,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:06,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:06,386 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 17:25:06,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:06,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991279302] [2024-11-10 17:25:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991279302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:06,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:06,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:25:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506345000] [2024-11-10 17:25:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:06,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:06,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:06,388 INFO L87 Difference]: Start difference. First operand 1548 states and 1639 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:08,865 INFO L93 Difference]: Finished difference Result 1876 states and 1987 transitions. [2024-11-10 17:25:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:08,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:25:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:08,871 INFO L225 Difference]: With dead ends: 1876 [2024-11-10 17:25:08,871 INFO L226 Difference]: Without dead ends: 1876 [2024-11-10 17:25:08,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:08,873 INFO L432 NwaCegarLoop]: 1395 mSDtfsCounter, 533 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:08,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2106 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:25:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2024-11-10 17:25:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1722. [2024-11-10 17:25:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 993 states have (on average 1.947633434038268) internal successors, (1934), 1713 states have internal predecessors, (1934), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 1966 transitions. [2024-11-10 17:25:08,904 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 1966 transitions. Word has length 6 [2024-11-10 17:25:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:08,905 INFO L471 AbstractCegarLoop]: Abstraction has 1722 states and 1966 transitions. [2024-11-10 17:25:08,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 1966 transitions. [2024-11-10 17:25:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:25:08,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:08,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:08,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 17:25:09,105 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 17:25:09,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:09,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1999966536, now seen corresponding path program 1 times [2024-11-10 17:25:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570080516] [2024-11-10 17:25:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:09,108 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 17:25:09,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:09,111 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 17:25:09,112 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 17:25:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:09,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:25:09,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:09,238 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 17:25:09,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:09,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:09,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570080516] [2024-11-10 17:25:09,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570080516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954531782] [2024-11-10 17:25:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:09,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:09,240 INFO L87 Difference]: Start difference. First operand 1722 states and 1966 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:09,336 INFO L93 Difference]: Finished difference Result 3000 states and 3449 transitions. [2024-11-10 17:25:09,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:09,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 17:25:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:09,355 INFO L225 Difference]: With dead ends: 3000 [2024-11-10 17:25:09,356 INFO L226 Difference]: Without dead ends: 3000 [2024-11-10 17:25:09,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 17:25:09,359 INFO L432 NwaCegarLoop]: 2063 mSDtfsCounter, 1132 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:09,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 3686 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:25:09,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2024-11-10 17:25:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1724. [2024-11-10 17:25:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 995 states have (on average 1.9457286432160803) internal successors, (1936), 1715 states have internal predecessors, (1936), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 1968 transitions. [2024-11-10 17:25:09,410 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 1968 transitions. Word has length 8 [2024-11-10 17:25:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:09,410 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 1968 transitions. [2024-11-10 17:25:09,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 1968 transitions. [2024-11-10 17:25:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:25:09,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:09,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:09,416 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 17:25:09,611 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 17:25:09,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr824REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:09,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash 412855981, now seen corresponding path program 1 times [2024-11-10 17:25:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:09,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091099430] [2024-11-10 17:25:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:09,613 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 17:25:09,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:09,616 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 17:25:09,617 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 17:25:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:09,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:25:09,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:09,773 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 17:25:09,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:09,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:09,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091099430] [2024-11-10 17:25:09,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091099430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:09,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:09,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:09,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079068377] [2024-11-10 17:25:09,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:09,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:09,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:09,776 INFO L87 Difference]: Start difference. First operand 1724 states and 1968 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:09,816 INFO L93 Difference]: Finished difference Result 1682 states and 1925 transitions. [2024-11-10 17:25:09,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:09,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 17:25:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:09,825 INFO L225 Difference]: With dead ends: 1682 [2024-11-10 17:25:09,825 INFO L226 Difference]: Without dead ends: 1682 [2024-11-10 17:25:09,826 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 17:25:09,826 INFO L432 NwaCegarLoop]: 1574 mSDtfsCounter, 71 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:09,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 3084 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2024-11-10 17:25:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2024-11-10 17:25:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 977 states have (on average 1.9375639713408392) internal successors, (1893), 1673 states have internal predecessors, (1893), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 1925 transitions. [2024-11-10 17:25:09,854 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 1925 transitions. Word has length 13 [2024-11-10 17:25:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:09,854 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 1925 transitions. [2024-11-10 17:25:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1925 transitions. [2024-11-10 17:25:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:25:09,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:09,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:09,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 17:25:10,056 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 17:25:10,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr800REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:10,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:10,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1617592417, now seen corresponding path program 1 times [2024-11-10 17:25:10,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:10,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696703914] [2024-11-10 17:25:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:10,058 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 17:25:10,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:10,059 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 17:25:10,059 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 17:25:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:10,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:10,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:10,230 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 17:25:10,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:10,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:10,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696703914] [2024-11-10 17:25:10,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696703914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:10,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969964334] [2024-11-10 17:25:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:10,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:10,233 INFO L87 Difference]: Start difference. First operand 1682 states and 1925 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:10,313 INFO L93 Difference]: Finished difference Result 1660 states and 1896 transitions. [2024-11-10 17:25:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:25:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 17:25:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:10,320 INFO L225 Difference]: With dead ends: 1660 [2024-11-10 17:25:10,320 INFO L226 Difference]: Without dead ends: 1660 [2024-11-10 17:25:10,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 17:25:10,322 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 48 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4560 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:10,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4560 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-10 17:25:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2024-11-10 17:25:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 969 states have (on average 1.9236326109391124) internal successors, (1864), 1651 states have internal predecessors, (1864), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 1896 transitions. [2024-11-10 17:25:10,363 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 1896 transitions. Word has length 15 [2024-11-10 17:25:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:10,364 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 1896 transitions. [2024-11-10 17:25:10,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1896 transitions. [2024-11-10 17:25:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:25:10,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:10,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:10,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:10,566 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 17:25:10,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr786REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash -2000809833, now seen corresponding path program 1 times [2024-11-10 17:25:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:10,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703462372] [2024-11-10 17:25:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:10,569 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 17:25:10,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:10,574 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 17:25:10,576 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 17:25:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:10,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:25:10,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:10,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:10,818 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 17:25:10,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:10,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:10,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703462372] [2024-11-10 17:25:10,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703462372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:10,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:10,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557758121] [2024-11-10 17:25:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:10,821 INFO L87 Difference]: Start difference. First operand 1660 states and 1896 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:13,194 INFO L93 Difference]: Finished difference Result 1660 states and 1896 transitions. [2024-11-10 17:25:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:13,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 17:25:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:13,199 INFO L225 Difference]: With dead ends: 1660 [2024-11-10 17:25:13,199 INFO L226 Difference]: Without dead ends: 1660 [2024-11-10 17:25:13,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 17:25:13,200 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 998 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:13,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1900 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:25:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-10 17:25:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1656. [2024-11-10 17:25:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 969 states have (on average 1.9195046439628483) internal successors, (1860), 1647 states have internal predecessors, (1860), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1892 transitions. [2024-11-10 17:25:13,223 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1892 transitions. Word has length 29 [2024-11-10 17:25:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:13,224 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 1892 transitions. [2024-11-10 17:25:13,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1892 transitions. [2024-11-10 17:25:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:25:13,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:13,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:13,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 17:25:13,426 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 17:25:13,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr787REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:13,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2000809832, now seen corresponding path program 1 times [2024-11-10 17:25:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922138992] [2024-11-10 17:25:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:13,427 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 17:25:13,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:13,428 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 17:25:13,430 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 17:25:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:13,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:25:13,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:13,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:13,778 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 17:25:13,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:13,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:13,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922138992] [2024-11-10 17:25:13,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922138992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:13,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719131615] [2024-11-10 17:25:13,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:13,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:13,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:13,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:13,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:13,781 INFO L87 Difference]: Start difference. First operand 1656 states and 1892 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:16,469 INFO L93 Difference]: Finished difference Result 1810 states and 1913 transitions. [2024-11-10 17:25:16,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-10 17:25:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:16,474 INFO L225 Difference]: With dead ends: 1810 [2024-11-10 17:25:16,474 INFO L226 Difference]: Without dead ends: 1810 [2024-11-10 17:25:16,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 17:25:16,475 INFO L432 NwaCegarLoop]: 1349 mSDtfsCounter, 466 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:16,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2819 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 17:25:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-10 17:25:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1652. [2024-11-10 17:25:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 969 states have (on average 1.915376676986584) internal successors, (1856), 1643 states have internal predecessors, (1856), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1888 transitions. [2024-11-10 17:25:16,502 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1888 transitions. Word has length 29 [2024-11-10 17:25:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:16,502 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 1888 transitions. [2024-11-10 17:25:16,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1888 transitions. [2024-11-10 17:25:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 17:25:16,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:16,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:16,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 17:25:16,707 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 17:25:16,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr772REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:16,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1885754116, now seen corresponding path program 1 times [2024-11-10 17:25:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067663812] [2024-11-10 17:25:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:16,709 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 17:25:16,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:16,712 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 17:25:16,713 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 17:25:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:16,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:16,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:16,982 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 17:25:16,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:16,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:16,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067663812] [2024-11-10 17:25:16,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067663812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:16,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:16,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590613582] [2024-11-10 17:25:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:16,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:16,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:16,985 INFO L87 Difference]: Start difference. First operand 1652 states and 1888 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:17,041 INFO L93 Difference]: Finished difference Result 1646 states and 1878 transitions. [2024-11-10 17:25:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:25:17,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 17:25:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:17,058 INFO L225 Difference]: With dead ends: 1646 [2024-11-10 17:25:17,058 INFO L226 Difference]: Without dead ends: 1646 [2024-11-10 17:25:17,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 17:25:17,059 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 21 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4537 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:17,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4537 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2024-11-10 17:25:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2024-11-10 17:25:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 963 states have (on average 1.916926272066459) internal successors, (1846), 1637 states have internal predecessors, (1846), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1878 transitions. [2024-11-10 17:25:17,082 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1878 transitions. Word has length 46 [2024-11-10 17:25:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:17,082 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 1878 transitions. [2024-11-10 17:25:17,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1878 transitions. [2024-11-10 17:25:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 17:25:17,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:17,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:17,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 17:25:17,284 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 17:25:17,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr772REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:17,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1168975820, now seen corresponding path program 1 times [2024-11-10 17:25:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:17,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003533113] [2024-11-10 17:25:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:17,286 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 17:25:17,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:17,287 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 17:25:17,288 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 17:25:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:17,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:17,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:17,718 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 17:25:17,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:17,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003533113] [2024-11-10 17:25:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003533113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:17,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:17,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444658734] [2024-11-10 17:25:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:17,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:17,720 INFO L87 Difference]: Start difference. First operand 1646 states and 1878 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:17,857 INFO L93 Difference]: Finished difference Result 2057 states and 2326 transitions. [2024-11-10 17:25:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-10 17:25:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:17,862 INFO L225 Difference]: With dead ends: 2057 [2024-11-10 17:25:17,862 INFO L226 Difference]: Without dead ends: 2057 [2024-11-10 17:25:17,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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 17:25:17,863 INFO L432 NwaCegarLoop]: 1611 mSDtfsCounter, 377 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:17,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 3083 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:25:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2024-11-10 17:25:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1695. [2024-11-10 17:25:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1012 states have (on average 1.8725296442687747) internal successors, (1895), 1686 states have internal predecessors, (1895), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 1927 transitions. [2024-11-10 17:25:17,888 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 1927 transitions. Word has length 54 [2024-11-10 17:25:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:17,889 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 1927 transitions. [2024-11-10 17:25:17,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 1927 transitions. [2024-11-10 17:25:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 17:25:17,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:17,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:17,897 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 17:25:18,094 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 17:25:18,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr743REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:18,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:18,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1364550630, now seen corresponding path program 1 times [2024-11-10 17:25:18,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:18,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150016866] [2024-11-10 17:25:18,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:18,096 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 17:25:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:18,099 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 17:25:18,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 17:25:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:18,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:25:18,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:18,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:18,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:18,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:25:18,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 17:25:18,942 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:25:18,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 17:25:18,967 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 17:25:18,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:18,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:18,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150016866] [2024-11-10 17:25:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150016866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:18,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711502195] [2024-11-10 17:25:18,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:18,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:18,970 INFO L87 Difference]: Start difference. First operand 1695 states and 1927 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:21,023 INFO L93 Difference]: Finished difference Result 1611 states and 1843 transitions. [2024-11-10 17:25:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-10 17:25:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:21,028 INFO L225 Difference]: With dead ends: 1611 [2024-11-10 17:25:21,028 INFO L226 Difference]: Without dead ends: 1611 [2024-11-10 17:25:21,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:21,028 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 899 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:21,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1223 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:25:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-11-10 17:25:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1427. [2024-11-10 17:25:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 828 states have (on average 1.7801932367149758) internal successors, (1474), 1418 states have internal predecessors, (1474), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1506 transitions. [2024-11-10 17:25:21,048 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1506 transitions. Word has length 57 [2024-11-10 17:25:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:21,048 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1506 transitions. [2024-11-10 17:25:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1506 transitions. [2024-11-10 17:25:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 17:25:21,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:21,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:21,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:21,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:21,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr736REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1526278721, now seen corresponding path program 1 times [2024-11-10 17:25:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144642082] [2024-11-10 17:25:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:21,252 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 17:25:21,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:21,255 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:21,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 17:25:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:21,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:25:21,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:21,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:25:21,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:21,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 17:25:21,593 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 17:25:21,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:21,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144642082] [2024-11-10 17:25:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144642082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:21,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:21,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735028843] [2024-11-10 17:25:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:21,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:25:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:21,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:25:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:21,595 INFO L87 Difference]: Start difference. First operand 1427 states and 1506 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:23,890 INFO L93 Difference]: Finished difference Result 1426 states and 1505 transitions. [2024-11-10 17:25:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:25:23,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 17:25:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:23,894 INFO L225 Difference]: With dead ends: 1426 [2024-11-10 17:25:23,894 INFO L226 Difference]: Without dead ends: 1426 [2024-11-10 17:25:23,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:25:23,895 INFO L432 NwaCegarLoop]: 1450 mSDtfsCounter, 2 mSDsluCounter, 2267 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3717 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:23,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3717 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:25:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2024-11-10 17:25:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-11-10 17:25:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 828 states have (on average 1.7789855072463767) internal successors, (1473), 1417 states have internal predecessors, (1473), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1505 transitions. [2024-11-10 17:25:23,911 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1505 transitions. Word has length 62 [2024-11-10 17:25:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:23,911 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1505 transitions. [2024-11-10 17:25:23,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1505 transitions. [2024-11-10 17:25:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 17:25:23,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:23,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:23,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-10 17:25:24,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:24,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr737REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:24,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1526278720, now seen corresponding path program 1 times [2024-11-10 17:25:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:24,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815419905] [2024-11-10 17:25:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:24,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:24,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:24,118 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:24,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 17:25:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:24,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:25:24,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:24,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:24,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:24,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:25:24,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-10 17:25:24,501 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 17:25:24,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:24,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815419905] [2024-11-10 17:25:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815419905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427169366] [2024-11-10 17:25:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:24,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:25:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:25:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:24,503 INFO L87 Difference]: Start difference. First operand 1426 states and 1505 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:27,313 INFO L93 Difference]: Finished difference Result 1425 states and 1504 transitions. [2024-11-10 17:25:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:25:27,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 17:25:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:27,317 INFO L225 Difference]: With dead ends: 1425 [2024-11-10 17:25:27,317 INFO L226 Difference]: Without dead ends: 1425 [2024-11-10 17:25:27,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:25:27,318 INFO L432 NwaCegarLoop]: 1450 mSDtfsCounter, 1 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3780 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:27,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3780 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-10 17:25:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-11-10 17:25:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2024-11-10 17:25:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 827 states have (on average 1.7799274486094316) internal successors, (1472), 1416 states have internal predecessors, (1472), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:25:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1504 transitions. [2024-11-10 17:25:27,344 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1504 transitions. Word has length 62 [2024-11-10 17:25:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:27,345 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1504 transitions. [2024-11-10 17:25:27,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1504 transitions. [2024-11-10 17:25:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:25:27,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:27,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:27,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 17:25:27,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:27,551 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr732REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:27,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2006236476, now seen corresponding path program 1 times [2024-11-10 17:25:27,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976097634] [2024-11-10 17:25:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:27,553 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 17:25:27,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:27,556 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:27,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 17:25:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:27,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:25:27,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:27,863 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 17:25:27,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:25:27,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976097634] [2024-11-10 17:25:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976097634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:27,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:27,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303057394] [2024-11-10 17:25:27,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:27,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:27,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:27,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:27,866 INFO L87 Difference]: Start difference. First operand 1425 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:27,920 INFO L93 Difference]: Finished difference Result 1428 states and 1509 transitions. [2024-11-10 17:25:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-10 17:25:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:27,928 INFO L225 Difference]: With dead ends: 1428 [2024-11-10 17:25:27,932 INFO L226 Difference]: Without dead ends: 1428 [2024-11-10 17:25:27,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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 17:25:27,933 INFO L432 NwaCegarLoop]: 1449 mSDtfsCounter, 0 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4339 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:27,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4339 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:25:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-10 17:25:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2024-11-10 17:25:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 829 states have (on average 1.779252110977081) internal successors, (1475), 1419 states have internal predecessors, (1475), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-10 17:25:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1509 transitions. [2024-11-10 17:25:27,959 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1509 transitions. Word has length 70 [2024-11-10 17:25:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:27,959 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1509 transitions. [2024-11-10 17:25:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1509 transitions. [2024-11-10 17:25:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 17:25:27,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:27,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:27,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:28,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:28,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr732REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash -648528428, now seen corresponding path program 1 times [2024-11-10 17:25:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042275774] [2024-11-10 17:25:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:28,162 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 17:25:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:28,164 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:28,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 17:25:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:28,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:25:28,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:28,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:28,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042275774] [2024-11-10 17:25:28,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042275774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:28,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:25:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375199412] [2024-11-10 17:25:28,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:28,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:25:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:25:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:25:28,519 INFO L87 Difference]: Start difference. First operand 1428 states and 1509 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:28,654 INFO L93 Difference]: Finished difference Result 1440 states and 1527 transitions. [2024-11-10 17:25:28,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:25:28,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-10 17:25:28,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:28,659 INFO L225 Difference]: With dead ends: 1440 [2024-11-10 17:25:28,659 INFO L226 Difference]: Without dead ends: 1440 [2024-11-10 17:25:28,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 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 17:25:28,660 INFO L432 NwaCegarLoop]: 1448 mSDtfsCounter, 7 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4339 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:28,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4339 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:25:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2024-11-10 17:25:28,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1438. [2024-11-10 17:25:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 838 states have (on average 1.7780429594272076) internal successors, (1490), 1428 states have internal predecessors, (1490), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-10 17:25:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1524 transitions. [2024-11-10 17:25:28,680 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1524 transitions. Word has length 71 [2024-11-10 17:25:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:28,681 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 1524 transitions. [2024-11-10 17:25:28,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1524 transitions. [2024-11-10 17:25:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 17:25:28,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:28,684 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:28,693 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 (16)] Ended with exit code 0 [2024-11-10 17:25:28,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:25:28,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr732REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:28,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1933827268, now seen corresponding path program 2 times [2024-11-10 17:25:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629897293] [2024-11-10 17:25:28,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:25:28,885 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 17:25:28,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:28,887 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 17:25:28,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 17:25:29,243 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:25:29,243 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:29,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:25:29,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:29,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:29,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:29,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629897293] [2024-11-10 17:25:29,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629897293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:29,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:29,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:25:29,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183697132] [2024-11-10 17:25:29,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:29,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:25:29,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:29,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:25:29,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:25:29,453 INFO L87 Difference]: Start difference. First operand 1438 states and 1524 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:29,810 INFO L93 Difference]: Finished difference Result 1453 states and 1547 transitions. [2024-11-10 17:25:29,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:25:29,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-11-10 17:25:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:29,815 INFO L225 Difference]: With dead ends: 1453 [2024-11-10 17:25:29,815 INFO L226 Difference]: Without dead ends: 1449 [2024-11-10 17:25:29,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:25:29,816 INFO L432 NwaCegarLoop]: 1448 mSDtfsCounter, 14 mSDsluCounter, 7224 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8672 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:29,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8672 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:25:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-11-10 17:25:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2024-11-10 17:25:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 847 states have (on average 1.7733175914994097) internal successors, (1502), 1437 states have internal predecessors, (1502), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-10 17:25:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1536 transitions. [2024-11-10 17:25:29,839 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1536 transitions. Word has length 74 [2024-11-10 17:25:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:29,840 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1536 transitions. [2024-11-10 17:25:29,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1536 transitions. [2024-11-10 17:25:29,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:25:29,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:29,841 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:29,851 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 (17)] Ended with exit code 0 [2024-11-10 17:25:30,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 17:25:30,042 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr732REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:30,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 812489788, now seen corresponding path program 3 times [2024-11-10 17:25:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:30,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497033892] [2024-11-10 17:25:30,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:25:30,043 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 17:25:30,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:30,044 INFO L229 MonitoredProcess]: Starting monitored process 18 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 17:25:30,045 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 (18)] Waiting until timeout for monitored process [2024-11-10 17:25:30,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:25:30,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:30,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:25:30,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:30,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:31,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:31,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497033892] [2024-11-10 17:25:31,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497033892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:31,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:31,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:25:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950690270] [2024-11-10 17:25:31,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:31,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:25:31,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:31,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:25:31,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:25:31,145 INFO L87 Difference]: Start difference. First operand 1447 states and 1536 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:32,479 INFO L93 Difference]: Finished difference Result 1471 states and 1575 transitions. [2024-11-10 17:25:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:25:32,479 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-11-10 17:25:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:32,483 INFO L225 Difference]: With dead ends: 1471 [2024-11-10 17:25:32,483 INFO L226 Difference]: Without dead ends: 1465 [2024-11-10 17:25:32,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:25:32,484 INFO L432 NwaCegarLoop]: 1449 mSDtfsCounter, 17 mSDsluCounter, 15894 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 17343 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:32,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 17343 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:25:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2024-11-10 17:25:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1465. [2024-11-10 17:25:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 865 states have (on average 1.7630057803468209) internal successors, (1525), 1455 states have internal predecessors, (1525), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-10 17:25:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1559 transitions. [2024-11-10 17:25:32,503 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1559 transitions. Word has length 80 [2024-11-10 17:25:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:32,503 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 1559 transitions. [2024-11-10 17:25:32,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1559 transitions. [2024-11-10 17:25:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:25:32,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:32,505 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:32,516 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 (18)] Ended with exit code 0 [2024-11-10 17:25:32,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 17:25:32,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr732REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:32,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash -307999172, now seen corresponding path program 4 times [2024-11-10 17:25:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359424198] [2024-11-10 17:25:32,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:25:32,707 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 17:25:32,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:32,708 INFO L229 MonitoredProcess]: Starting monitored process 19 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 17:25:32,709 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 (19)] Waiting until timeout for monitored process [2024-11-10 17:25:33,089 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:25:33,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:33,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:25:33,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:33,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:34,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:34,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359424198] [2024-11-10 17:25:34,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359424198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:25:34,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:25:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178893124] [2024-11-10 17:25:34,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:34,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:25:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:25:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:25:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:25:34,579 INFO L87 Difference]: Start difference. First operand 1465 states and 1559 transitions. Second operand has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:39,096 INFO L93 Difference]: Finished difference Result 1505 states and 1632 transitions. [2024-11-10 17:25:39,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:25:39,097 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-10 17:25:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:39,100 INFO L225 Difference]: With dead ends: 1505 [2024-11-10 17:25:39,101 INFO L226 Difference]: Without dead ends: 1501 [2024-11-10 17:25:39,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:25:39,103 INFO L432 NwaCegarLoop]: 1448 mSDtfsCounter, 38 mSDsluCounter, 33216 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 34664 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:39,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 34664 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:25:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-10 17:25:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1499. [2024-11-10 17:25:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 899 states have (on average 1.7474972191323692) internal successors, (1571), 1489 states have internal predecessors, (1571), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-10 17:25:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1605 transitions. [2024-11-10 17:25:39,137 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1605 transitions. Word has length 92 [2024-11-10 17:25:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:39,137 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 1605 transitions. [2024-11-10 17:25:39,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.3) internal successors, (115), 50 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1605 transitions. [2024-11-10 17:25:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 17:25:39,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:39,138 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:39,150 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 (19)] Ended with exit code 0 [2024-11-10 17:25:39,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 17:25:39,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr732REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-10 17:25:39,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:39,340 INFO L85 PathProgramCache]: Analyzing trace with hash -163504324, now seen corresponding path program 5 times [2024-11-10 17:25:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:25:39,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850965614] [2024-11-10 17:25:39,341 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:25:39,341 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 17:25:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:25:39,344 INFO L229 MonitoredProcess]: Starting monitored process 20 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 17:25:39,345 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 (20)] Waiting until timeout for monitored process [2024-11-10 17:25:40,430 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:25:40,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:25:40,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 17:25:40,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:40,470 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-10 17:25:40,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-10 17:25:40,772 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-10 17:25:40,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-10 17:25:40,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:40,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-11-10 17:25:43,101 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:43,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-10 17:25:43,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-10 17:25:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:25:43,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:43,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:25:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850965614] [2024-11-10 17:25:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850965614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [395582928] [2024-11-10 17:25:43,693 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:25:43,693 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:25:43,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:25:43,694 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:25:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process