./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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_SFH_test2-2.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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:01:12,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:01:12,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:01:12,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:01:12,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:01:12,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:01:12,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:01:12,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:01:12,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:01:12,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:01:12,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:01:12,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:01:12,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:01:12,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:01:12,746 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:01:12,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:01:12,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:01:12,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:01:12,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:01:12,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:01:12,747 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:01:12,749 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:01:12,749 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:01:12,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:01:12,750 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:01:12,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:01:12,750 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:01:12,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:01:12,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:01:12,751 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:01:12,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:01:12,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:01:12,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:01:12,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:01:12,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:01:12,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:01:12,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:01:12,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:01:12,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:01:12,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:01:12,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:01:12,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:01:12,766 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2024-11-17 03:01:13,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:01:13,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:01:13,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:01:13,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:01:13,066 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:01:13,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-17 03:01:14,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:01:14,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:01:14,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-17 03:01:14,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6748456c/c3144768501040ddb5ee093e45167968/FLAGf0b16470b [2024-11-17 03:01:14,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6748456c/c3144768501040ddb5ee093e45167968 [2024-11-17 03:01:14,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:01:14,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:01:14,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:01:14,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:01:14,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:01:14,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:01:14" (1/1) ... [2024-11-17 03:01:14,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612cbb71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:14, skipping insertion in model container [2024-11-17 03:01:14,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:01:14" (1/1) ... [2024-11-17 03:01:14,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:01:15,497 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-17 03:01:15,546 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-17 03:01:15,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-17 03:01:15,555 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-17 03:01:15,561 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-17 03:01:15,592 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:01:15,593 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-17 03:01:15,596 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-17 03:01:15,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-17 03:01:15,599 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-17 03:01:15,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-17 03:01:15,603 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-17 03:01:15,605 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-17 03:01:15,606 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-17 03:01:15,614 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-17 03:01:15,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:01:15,643 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-17 03:01:15,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@49cc9d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:15, skipping insertion in model container [2024-11-17 03:01:15,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:01:15,645 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 03:01:15,647 INFO L158 Benchmark]: Toolchain (without parser) took 764.91ms. Allocated memory is still 184.5MB. Free memory was 125.1MB in the beginning and 101.2MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 03:01:15,648 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:01:15,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 760.23ms. Allocated memory is still 184.5MB. Free memory was 125.1MB in the beginning and 101.2MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 03:01:15,651 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 184.5MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 760.23ms. Allocated memory is still 184.5MB. Free memory was 125.1MB in the beginning and 101.2MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: 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_SFH_test2-2.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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:01:17,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:01:17,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:01:17,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:01:17,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:01:17,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:01:17,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:01:17,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:01:17,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:01:17,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:01:17,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:01:17,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:01:17,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:01:17,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:01:17,960 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:01:17,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:01:17,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:01:17,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:01:17,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:01:17,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:01:17,962 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:01:17,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:01:17,968 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:01:17,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:01:17,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:01:17,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:01:17,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:01:17,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:01:17,969 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:01:17,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:01:17,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:01:17,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:01:17,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:01:17,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:01:17,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:01:17,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:01:17,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:01:17,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:01:17,973 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:01:17,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:01:17,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:01:17,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:01:17,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:01:17,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:01:17,974 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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2024-11-17 03:01:18,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:01:18,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:01:18,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:01:18,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:01:18,358 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:01:18,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-17 03:01:19,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:01:20,322 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:01:20,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-17 03:01:20,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51618f982/739af48df2b3474fa25ed97ccd78d557/FLAG11fc563ab [2024-11-17 03:01:20,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51618f982/739af48df2b3474fa25ed97ccd78d557 [2024-11-17 03:01:20,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:01:20,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:01:20,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:01:20,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:01:20,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:01:20,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:01:20" (1/1) ... [2024-11-17 03:01:20,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62022fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:20, skipping insertion in model container [2024-11-17 03:01:20,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:01:20" (1/1) ... [2024-11-17 03:01:20,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:01:20,906 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-17 03:01:20,950 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-17 03:01:20,957 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-17 03:01:20,964 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:01:20,976 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-17 03:01:21,031 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-17 03:01:21,031 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-17 03:01:21,035 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-17 03:01:21,036 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-17 03:01:21,039 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-17 03:01:21,055 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-17 03:01:21,057 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-17 03:01:21,058 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-17 03:01:21,059 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-17 03:01:21,063 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-17 03:01:21,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:01:21,090 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 03:01:21,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:01:21,159 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-17 03:01:21,181 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-17 03:01:21,183 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-17 03:01:21,185 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-17 03:01:21,189 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-17 03:01:21,204 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-17 03:01:21,205 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-17 03:01:21,207 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-17 03:01:21,207 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-17 03:01:21,208 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-17 03:01:21,210 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-17 03:01:21,210 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-17 03:01:21,211 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-17 03:01:21,211 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-17 03:01:21,214 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-17 03:01:21,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:01:21,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:01:21,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:01:21,350 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:01:21,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21 WrapperNode [2024-11-17 03:01:21,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:01:21,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:01:21,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:01:21,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:01:21,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,504 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1047 [2024-11-17 03:01:21,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:01:21,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:01:21,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:01:21,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:01:21,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,639 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-17 03:01:21,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:01:21,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:01:21,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:01:21,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:01:21,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (1/1) ... [2024-11-17 03:01:21,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:01:21,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:01:21,757 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-17 03:01:21,761 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-17 03:01:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 03:01:21,799 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 03:01:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 03:01:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 03:01:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 03:01:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 03:01:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 03:01:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 03:01:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 03:01:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 03:01:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 03:01:21,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 03:01:21,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 03:01:21,801 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 03:01:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 03:01:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 03:01:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 03:01:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 03:01:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 03:01:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 03:01:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 03:01:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 03:01:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:01:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 03:01:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 03:01:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 03:01:21,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 03:01:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 03:01:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:01:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 03:01:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 03:01:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 03:01:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:01:21,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:01:22,053 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:01:22,056 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:01:26,010 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 03:01:26,147 INFO L? ?]: Removed 1100 outVars from TransFormulas that were not future-live. [2024-11-17 03:01:26,147 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:01:26,186 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:01:26,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:01:26,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:01:26 BoogieIcfgContainer [2024-11-17 03:01:26,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:01:26,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:01:26,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:01:26,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:01:26,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:01:20" (1/3) ... [2024-11-17 03:01:26,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae880d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:01:26, skipping insertion in model container [2024-11-17 03:01:26,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:01:21" (2/3) ... [2024-11-17 03:01:26,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae880d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:01:26, skipping insertion in model container [2024-11-17 03:01:26,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:01:26" (3/3) ... [2024-11-17 03:01:26,197 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-2.i [2024-11-17 03:01:26,212 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:01:26,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-17 03:01:26,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:01:26,303 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;@68105677, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:01:26,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-17 03:01:26,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 1109 states, 569 states have (on average 2.154657293497364) internal successors, (1226), 1102 states have internal predecessors, (1226), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-17 03:01:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 03:01:26,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:26,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 03:01:26,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:26,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1276965, now seen corresponding path program 1 times [2024-11-17 03:01:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949617015] [2024-11-17 03:01:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:26,342 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-17 03:01:26,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:26,346 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-17 03:01:26,348 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-17 03:01:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:26,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:01:26,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:26,569 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-17 03:01:26,594 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-17 03:01:26,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:26,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:26,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949617015] [2024-11-17 03:01:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949617015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:26,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:01:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988196977] [2024-11-17 03:01:26,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:26,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:01:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:01:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:01:26,646 INFO L87 Difference]: Start difference. First operand has 1109 states, 569 states have (on average 2.154657293497364) internal successors, (1226), 1102 states have internal predecessors, (1226), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 03:01:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:28,555 INFO L93 Difference]: Finished difference Result 1279 states and 1356 transitions. [2024-11-17 03:01:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:01:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 03:01:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:28,576 INFO L225 Difference]: With dead ends: 1279 [2024-11-17 03:01:28,576 INFO L226 Difference]: Without dead ends: 1276 [2024-11-17 03:01:28,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 03:01:28,581 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 1006 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:28,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 843 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 03:01:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-17 03:01:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1091. [2024-11-17 03:01:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 569 states have (on average 2.0052724077328645) internal successors, (1141), 1084 states have internal predecessors, (1141), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 03:01:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1159 transitions. [2024-11-17 03:01:28,669 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1159 transitions. Word has length 3 [2024-11-17 03:01:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1159 transitions. [2024-11-17 03:01:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 03:01:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1159 transitions. [2024-11-17 03:01:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 03:01:28,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:28,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 03:01:28,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 03:01:28,871 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-17 03:01:28,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:28,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1276966, now seen corresponding path program 1 times [2024-11-17 03:01:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100012358] [2024-11-17 03:01:28,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:28,873 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-17 03:01:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:28,875 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-17 03:01:28,899 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-17 03:01:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:28,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:01:29,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:29,010 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-17 03:01:29,021 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-17 03:01:29,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:29,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100012358] [2024-11-17 03:01:29,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100012358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:29,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:01:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707139862] [2024-11-17 03:01:29,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:29,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:01:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:01:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:01:29,025 INFO L87 Difference]: Start difference. First operand 1091 states and 1159 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 03:01:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:31,136 INFO L93 Difference]: Finished difference Result 1532 states and 1643 transitions. [2024-11-17 03:01:31,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:01:31,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 03:01:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:31,142 INFO L225 Difference]: With dead ends: 1532 [2024-11-17 03:01:31,143 INFO L226 Difference]: Without dead ends: 1532 [2024-11-17 03:01:31,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 03:01:31,144 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 473 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:31,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1584 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 03:01:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-17 03:01:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1237. [2024-11-17 03:01:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 711 states have (on average 1.9620253164556962) internal successors, (1395), 1230 states have internal predecessors, (1395), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1423 transitions. [2024-11-17 03:01:31,176 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1423 transitions. Word has length 3 [2024-11-17 03:01:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:31,177 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1423 transitions. [2024-11-17 03:01:31,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 03:01:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1423 transitions. [2024-11-17 03:01:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 03:01:31,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:31,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:31,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 03:01:31,378 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-17 03:01:31,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 826341787, now seen corresponding path program 1 times [2024-11-17 03:01:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:31,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589522936] [2024-11-17 03:01:31,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:31,380 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-17 03:01:31,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:31,384 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-17 03:01:31,385 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-17 03:01:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:31,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 03:01:31,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:31,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 5 [2024-11-17 03:01:31,542 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-17 03:01:31,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:01:31,621 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-17 03:01:31,643 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 03:01:31,644 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-17 03:01:31,673 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-17 03:01:31,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:31,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:31,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589522936] [2024-11-17 03:01:31,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589522936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:01:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697627722] [2024-11-17 03:01:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:31,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:31,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:31,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:31,675 INFO L87 Difference]: Start difference. First operand 1237 states and 1423 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 03:01:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:34,346 INFO L93 Difference]: Finished difference Result 1411 states and 1605 transitions. [2024-11-17 03:01:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:01:34,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 03:01:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:34,351 INFO L225 Difference]: With dead ends: 1411 [2024-11-17 03:01:34,351 INFO L226 Difference]: Without dead ends: 1411 [2024-11-17 03:01:34,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-17 03:01:34,353 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 2290 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:34,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 506 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-17 03:01:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-17 03:01:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1079. [2024-11-17 03:01:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 569 states have (on average 1.9824253075571177) internal successors, (1128), 1072 states have internal predecessors, (1128), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 03:01:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1146 transitions. [2024-11-17 03:01:34,383 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1146 transitions. Word has length 8 [2024-11-17 03:01:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:34,384 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1146 transitions. [2024-11-17 03:01:34,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-17 03:01:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1146 transitions. [2024-11-17 03:01:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 03:01:34,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:34,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:34,391 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-17 03:01:34,587 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-17 03:01:34,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr520REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:34,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -153207205, now seen corresponding path program 1 times [2024-11-17 03:01:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154500761] [2024-11-17 03:01:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:34,592 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-17 03:01:34,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:34,595 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-17 03:01:34,596 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-17 03:01:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:34,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:01:34,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:34,728 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-17 03:01:34,739 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-17 03:01:34,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:34,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154500761] [2024-11-17 03:01:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154500761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:34,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:01:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870236302] [2024-11-17 03:01:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:34,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:01:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:01:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:01:34,742 INFO L87 Difference]: Start difference. First operand 1079 states and 1146 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-17 03:01:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:36,083 INFO L93 Difference]: Finished difference Result 1267 states and 1366 transitions. [2024-11-17 03:01:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:01:36,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-17 03:01:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:36,092 INFO L225 Difference]: With dead ends: 1267 [2024-11-17 03:01:36,092 INFO L226 Difference]: Without dead ends: 1267 [2024-11-17 03:01:36,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-17 03:01:36,093 INFO L432 NwaCegarLoop]: 948 mSDtfsCounter, 781 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:36,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1240 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 03:01:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2024-11-17 03:01:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1032. [2024-11-17 03:01:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 569 states have (on average 1.8998242530755711) internal successors, (1081), 1025 states have internal predecessors, (1081), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 03:01:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1099 transitions. [2024-11-17 03:01:36,125 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1099 transitions. Word has length 9 [2024-11-17 03:01:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:36,125 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1099 transitions. [2024-11-17 03:01:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-17 03:01:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1099 transitions. [2024-11-17 03:01:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 03:01:36,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:36,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:36,130 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-17 03:01:36,327 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-17 03:01:36,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:36,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash -153207204, now seen corresponding path program 1 times [2024-11-17 03:01:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:36,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928972972] [2024-11-17 03:01:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:36,328 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-17 03:01:36,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:36,332 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-17 03:01:36,333 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-17 03:01:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:36,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:01:36,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:36,480 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-17 03:01:36,511 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-17 03:01:36,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:36,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928972972] [2024-11-17 03:01:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928972972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:36,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:36,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:01:36,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608283338] [2024-11-17 03:01:36,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:36,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:01:36,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:36,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:01:36,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:01:36,513 INFO L87 Difference]: Start difference. First operand 1032 states and 1099 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-17 03:01:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:38,436 INFO L93 Difference]: Finished difference Result 1345 states and 1447 transitions. [2024-11-17 03:01:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:01:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-17 03:01:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:38,441 INFO L225 Difference]: With dead ends: 1345 [2024-11-17 03:01:38,441 INFO L226 Difference]: Without dead ends: 1345 [2024-11-17 03:01:38,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-17 03:01:38,442 INFO L432 NwaCegarLoop]: 1127 mSDtfsCounter, 528 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:38,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1596 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 03:01:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-17 03:01:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1061. [2024-11-17 03:01:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 608 states have (on average 1.886513157894737) internal successors, (1147), 1054 states have internal predecessors, (1147), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-17 03:01:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1165 transitions. [2024-11-17 03:01:38,467 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1165 transitions. Word has length 9 [2024-11-17 03:01:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:38,468 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1165 transitions. [2024-11-17 03:01:38,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-17 03:01:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1165 transitions. [2024-11-17 03:01:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 03:01:38,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:38,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:38,473 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-17 03:01:38,669 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-17 03:01:38,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:38,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1263046435, now seen corresponding path program 1 times [2024-11-17 03:01:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:38,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834658418] [2024-11-17 03:01:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:38,671 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-17 03:01:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:38,672 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-17 03:01:38,673 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-17 03:01:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:38,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:01:38,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:38,886 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-17 03:01:38,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:38,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834658418] [2024-11-17 03:01:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834658418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:38,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:38,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:01:38,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640243593] [2024-11-17 03:01:38,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:38,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:01:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:01:38,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:01:38,889 INFO L87 Difference]: Start difference. First operand 1061 states and 1165 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-17 03:01:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:39,112 INFO L93 Difference]: Finished difference Result 1527 states and 1697 transitions. [2024-11-17 03:01:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:01:39,113 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-17 03:01:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:39,118 INFO L225 Difference]: With dead ends: 1527 [2024-11-17 03:01:39,118 INFO L226 Difference]: Without dead ends: 1527 [2024-11-17 03:01:39,119 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-17 03:01:39,121 INFO L432 NwaCegarLoop]: 1151 mSDtfsCounter, 490 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:39,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2148 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:01:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-11-17 03:01:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1253. [2024-11-17 03:01:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 795 states have (on average 1.838993710691824) internal successors, (1462), 1246 states have internal predecessors, (1462), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1490 transitions. [2024-11-17 03:01:39,154 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1490 transitions. Word has length 13 [2024-11-17 03:01:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:39,154 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1490 transitions. [2024-11-17 03:01:39,154 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-17 03:01:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1490 transitions. [2024-11-17 03:01:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 03:01:39,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:39,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:39,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 03:01:39,355 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-17 03:01:39,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr196REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:39,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash 172708241, now seen corresponding path program 1 times [2024-11-17 03:01:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:39,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19580332] [2024-11-17 03:01:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:39,358 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-17 03:01:39,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:39,361 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-17 03:01:39,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 03:01:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:39,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:01:39,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:39,497 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-17 03:01:39,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:39,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19580332] [2024-11-17 03:01:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19580332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:39,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:01:39,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060214102] [2024-11-17 03:01:39,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:39,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:01:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:39,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:01:39,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:01:39,500 INFO L87 Difference]: Start difference. First operand 1253 states and 1490 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-17 03:01:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:39,533 INFO L93 Difference]: Finished difference Result 1193 states and 1404 transitions. [2024-11-17 03:01:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:01:39,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-17 03:01:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:39,539 INFO L225 Difference]: With dead ends: 1193 [2024-11-17 03:01:39,539 INFO L226 Difference]: Without dead ends: 1193 [2024-11-17 03:01:39,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-17 03:01:39,541 INFO L432 NwaCegarLoop]: 1026 mSDtfsCounter, 71 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1988 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-17 03:01:39,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1988 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:01:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-17 03:01:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2024-11-17 03:01:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 759 states have (on average 1.8129117259552041) internal successors, (1376), 1186 states have internal predecessors, (1376), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1404 transitions. [2024-11-17 03:01:39,568 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1404 transitions. Word has length 16 [2024-11-17 03:01:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:39,568 INFO L471 AbstractCegarLoop]: Abstraction has 1193 states and 1404 transitions. [2024-11-17 03:01:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-17 03:01:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1404 transitions. [2024-11-17 03:01:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 03:01:39,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:39,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:39,574 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-17 03:01:39,770 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-17 03:01:39,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:39,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1189723966, now seen corresponding path program 1 times [2024-11-17 03:01:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29465137] [2024-11-17 03:01:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:39,771 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-17 03:01:39,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:39,773 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-17 03:01:39,774 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-17 03:01:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:39,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:01:39,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:40,003 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-17 03:01:40,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:40,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29465137] [2024-11-17 03:01:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29465137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:01:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321130583] [2024-11-17 03:01:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:40,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:40,005 INFO L87 Difference]: Start difference. First operand 1193 states and 1404 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-17 03:01:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:40,532 INFO L93 Difference]: Finished difference Result 1446 states and 1614 transitions. [2024-11-17 03:01:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:01:40,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-17 03:01:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:40,537 INFO L225 Difference]: With dead ends: 1446 [2024-11-17 03:01:40,538 INFO L226 Difference]: Without dead ends: 1446 [2024-11-17 03:01:40,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-17 03:01:40,539 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 451 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:40,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3062 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 03:01:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-11-17 03:01:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1196. [2024-11-17 03:01:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 762 states have (on average 1.8097112860892388) internal successors, (1379), 1189 states have internal predecessors, (1379), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1407 transitions. [2024-11-17 03:01:40,557 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1407 transitions. Word has length 17 [2024-11-17 03:01:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1407 transitions. [2024-11-17 03:01:40,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-17 03:01:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1407 transitions. [2024-11-17 03:01:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 03:01:40,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:40,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:40,563 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-17 03:01:40,761 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-17 03:01:40,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:40,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1773504806, now seen corresponding path program 1 times [2024-11-17 03:01:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229502512] [2024-11-17 03:01:40,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:40,763 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-17 03:01:40,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:40,764 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-17 03:01:40,765 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-17 03:01:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:40,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:01:40,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:40,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:01:40,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:01:40,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:01:40,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 03:01:40,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 03:01:40,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 03:01:40,999 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-17 03:01:40,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:40,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:40,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229502512] [2024-11-17 03:01:40,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229502512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:40,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:01:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467400275] [2024-11-17 03:01:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:41,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:41,001 INFO L87 Difference]: Start difference. First operand 1196 states and 1407 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-17 03:01:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:41,284 INFO L93 Difference]: Finished difference Result 2045 states and 2279 transitions. [2024-11-17 03:01:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:01:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-17 03:01:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:41,291 INFO L225 Difference]: With dead ends: 2045 [2024-11-17 03:01:41,292 INFO L226 Difference]: Without dead ends: 2045 [2024-11-17 03:01:41,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-17 03:01:41,293 INFO L432 NwaCegarLoop]: 1236 mSDtfsCounter, 955 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:41,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 3471 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:01:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2024-11-17 03:01:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1195. [2024-11-17 03:01:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 761 states have (on average 1.80946123521682) internal successors, (1377), 1188 states have internal predecessors, (1377), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1405 transitions. [2024-11-17 03:01:41,318 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1405 transitions. Word has length 18 [2024-11-17 03:01:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:41,318 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1405 transitions. [2024-11-17 03:01:41,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-17 03:01:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1405 transitions. [2024-11-17 03:01:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 03:01:41,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:41,319 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] [2024-11-17 03:01:41,326 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-17 03:01:41,520 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-17 03:01:41,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr512REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:41,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1956995277, now seen corresponding path program 1 times [2024-11-17 03:01:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170785845] [2024-11-17 03:01:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:41,521 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-17 03:01:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:41,524 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-17 03:01:41,529 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-17 03:01:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:41,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:01:41,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:41,696 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-17 03:01:41,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:41,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:41,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170785845] [2024-11-17 03:01:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170785845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:41,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:41,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:01:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913391115] [2024-11-17 03:01:41,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:01:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:41,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:01:41,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:01:41,698 INFO L87 Difference]: Start difference. First operand 1195 states and 1405 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-17 03:01:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:41,720 INFO L93 Difference]: Finished difference Result 1135 states and 1319 transitions. [2024-11-17 03:01:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:01:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-17 03:01:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:41,723 INFO L225 Difference]: With dead ends: 1135 [2024-11-17 03:01:41,723 INFO L226 Difference]: Without dead ends: 1135 [2024-11-17 03:01:41,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-17 03:01:41,723 INFO L432 NwaCegarLoop]: 983 mSDtfsCounter, 71 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1902 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-17 03:01:41,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1902 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:01:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-17 03:01:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2024-11-17 03:01:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 725 states have (on average 1.7806896551724138) internal successors, (1291), 1128 states have internal predecessors, (1291), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1319 transitions. [2024-11-17 03:01:41,744 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1319 transitions. Word has length 20 [2024-11-17 03:01:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:41,744 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1319 transitions. [2024-11-17 03:01:41,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-17 03:01:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1319 transitions. [2024-11-17 03:01:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 03:01:41,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:41,745 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] [2024-11-17 03:01:41,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 03:01:41,945 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-17 03:01:41,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr488REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:41,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash -523248223, now seen corresponding path program 1 times [2024-11-17 03:01:41,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:41,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936631068] [2024-11-17 03:01:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:41,947 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-17 03:01:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:41,948 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-17 03:01:41,949 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-17 03:01:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:42,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:01:42,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:42,137 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-17 03:01:42,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:42,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:42,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936631068] [2024-11-17 03:01:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936631068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:42,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:42,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:01:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853597803] [2024-11-17 03:01:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:42,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:42,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:42,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:42,140 INFO L87 Difference]: Start difference. First operand 1135 states and 1319 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-17 03:01:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:42,212 INFO L93 Difference]: Finished difference Result 1105 states and 1261 transitions. [2024-11-17 03:01:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:01:42,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-17 03:01:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:42,216 INFO L225 Difference]: With dead ends: 1105 [2024-11-17 03:01:42,216 INFO L226 Difference]: Without dead ends: 1105 [2024-11-17 03:01:42,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-17 03:01:42,217 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 48 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2787 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:42,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2787 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:01:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-17 03:01:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2024-11-17 03:01:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 709 states have (on average 1.7390691114245416) internal successors, (1233), 1098 states have internal predecessors, (1233), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1261 transitions. [2024-11-17 03:01:42,233 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1261 transitions. Word has length 22 [2024-11-17 03:01:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:42,233 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1261 transitions. [2024-11-17 03:01:42,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-17 03:01:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1261 transitions. [2024-11-17 03:01:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 03:01:42,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:42,234 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] [2024-11-17 03:01:42,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 03:01:42,438 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-17 03:01:42,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1858419639, now seen corresponding path program 1 times [2024-11-17 03:01:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891128699] [2024-11-17 03:01:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:42,444 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-17 03:01:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:42,446 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-17 03:01:42,447 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-17 03:01:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:42,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:01:42,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:42,617 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-17 03:01:42,699 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-17 03:01:42,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:42,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891128699] [2024-11-17 03:01:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891128699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:01:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643704318] [2024-11-17 03:01:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:42,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:42,702 INFO L87 Difference]: Start difference. First operand 1105 states and 1261 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-17 03:01:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:44,290 INFO L93 Difference]: Finished difference Result 1109 states and 1261 transitions. [2024-11-17 03:01:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:01:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-17 03:01:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:44,293 INFO L225 Difference]: With dead ends: 1109 [2024-11-17 03:01:44,293 INFO L226 Difference]: Without dead ends: 1109 [2024-11-17 03:01:44,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-17 03:01:44,294 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 671 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:44,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1204 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 03:01:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-17 03:01:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1101. [2024-11-17 03:01:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 709 states have (on average 1.7277856135401974) internal successors, (1225), 1094 states have internal predecessors, (1225), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1253 transitions. [2024-11-17 03:01:44,310 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1253 transitions. Word has length 36 [2024-11-17 03:01:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1253 transitions. [2024-11-17 03:01:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-17 03:01:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1253 transitions. [2024-11-17 03:01:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-17 03:01:44,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:44,312 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] [2024-11-17 03:01:44,318 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-17 03:01:44,512 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-17 03:01:44,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:44,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1858419640, now seen corresponding path program 1 times [2024-11-17 03:01:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347966497] [2024-11-17 03:01:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:44,514 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-17 03:01:44,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:44,517 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-17 03:01:44,519 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-17 03:01:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:44,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:01:44,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:44,697 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-17 03:01:44,887 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-17 03:01:44,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:44,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347966497] [2024-11-17 03:01:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347966497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:44,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:44,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:01:44,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161560491] [2024-11-17 03:01:44,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:44,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:44,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:44,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:44,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:44,890 INFO L87 Difference]: Start difference. First operand 1101 states and 1253 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-17 03:01:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:46,952 INFO L93 Difference]: Finished difference Result 1430 states and 1624 transitions. [2024-11-17 03:01:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:01:46,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-17 03:01:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:46,956 INFO L225 Difference]: With dead ends: 1430 [2024-11-17 03:01:46,956 INFO L226 Difference]: Without dead ends: 1430 [2024-11-17 03:01:46,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-17 03:01:46,957 INFO L432 NwaCegarLoop]: 1113 mSDtfsCounter, 414 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:46,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2245 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 03:01:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2024-11-17 03:01:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1097. [2024-11-17 03:01:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 709 states have (on average 1.7165021156558533) internal successors, (1217), 1090 states have internal predecessors, (1217), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1245 transitions. [2024-11-17 03:01:46,976 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1245 transitions. Word has length 36 [2024-11-17 03:01:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:46,978 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1245 transitions. [2024-11-17 03:01:46,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-17 03:01:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1245 transitions. [2024-11-17 03:01:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-17 03:01:46,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:46,981 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] [2024-11-17 03:01:46,988 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 (14)] Forceful destruction successful, exit code 0 [2024-11-17 03:01:47,182 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-17 03:01:47,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr431REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -889133902, now seen corresponding path program 1 times [2024-11-17 03:01:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055702235] [2024-11-17 03:01:47,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:47,185 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-17 03:01:47,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:47,189 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-17 03:01:47,191 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-17 03:01:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:47,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:01:47,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:47,452 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-17 03:01:47,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:47,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055702235] [2024-11-17 03:01:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055702235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:01:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046246455] [2024-11-17 03:01:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:47,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:47,455 INFO L87 Difference]: Start difference. First operand 1097 states and 1245 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-17 03:01:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:47,498 INFO L93 Difference]: Finished difference Result 1085 states and 1225 transitions. [2024-11-17 03:01:47,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:01:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-11-17 03:01:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:47,501 INFO L225 Difference]: With dead ends: 1085 [2024-11-17 03:01:47,501 INFO L226 Difference]: Without dead ends: 1085 [2024-11-17 03:01:47,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-17 03:01:47,502 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 21 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2764 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-17 03:01:47,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2764 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:01:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2024-11-17 03:01:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2024-11-17 03:01:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 697 states have (on average 1.7173601147776183) internal successors, (1197), 1078 states have internal predecessors, (1197), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1225 transitions. [2024-11-17 03:01:47,518 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1225 transitions. Word has length 56 [2024-11-17 03:01:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:47,518 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1225 transitions. [2024-11-17 03:01:47,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-17 03:01:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1225 transitions. [2024-11-17 03:01:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-17 03:01:47,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:47,520 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] [2024-11-17 03:01:47,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 03:01:47,720 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-17 03:01:47,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr431REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:47,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 447351546, now seen corresponding path program 1 times [2024-11-17 03:01:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037053824] [2024-11-17 03:01:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:47,722 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-17 03:01:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:47,725 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-17 03:01:47,726 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-17 03:01:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:48,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 03:01:48,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:48,096 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-17 03:01:48,101 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-17 03:01:48,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:01:48,649 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-17 03:01:48,664 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 03:01:48,665 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-17 03:01:48,675 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-17 03:01:48,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:48,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037053824] [2024-11-17 03:01:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037053824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:01:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989896479] [2024-11-17 03:01:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:48,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:48,677 INFO L87 Difference]: Start difference. First operand 1085 states and 1225 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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-17 03:01:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:49,881 INFO L93 Difference]: Finished difference Result 1047 states and 1187 transitions. [2024-11-17 03:01:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:01:49,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-17 03:01:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:49,884 INFO L225 Difference]: With dead ends: 1047 [2024-11-17 03:01:49,884 INFO L226 Difference]: Without dead ends: 1047 [2024-11-17 03:01:49,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-17 03:01:49,885 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 1190 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:49,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 629 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 03:01:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-17 03:01:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1008. [2024-11-17 03:01:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 658 states have (on average 1.6458966565349544) internal successors, (1083), 1001 states have internal predecessors, (1083), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1111 transitions. [2024-11-17 03:01:49,898 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1111 transitions. Word has length 64 [2024-11-17 03:01:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:49,898 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1111 transitions. [2024-11-17 03:01:49,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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-17 03:01:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1111 transitions. [2024-11-17 03:01:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 03:01:49,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:49,899 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] [2024-11-17 03:01:49,909 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-17 03:01:50,100 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-17 03:01:50,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:50,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash -255960520, now seen corresponding path program 1 times [2024-11-17 03:01:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300030791] [2024-11-17 03:01:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:50,101 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-17 03:01:50,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:50,103 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-17 03:01:50,103 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-17 03:01:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:50,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:01:50,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:50,357 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-17 03:01:50,375 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-17 03:01:50,404 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-17 03:01:50,415 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-17 03:01:50,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:50,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300030791] [2024-11-17 03:01:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300030791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:01:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190650468] [2024-11-17 03:01:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:01:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:01:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:01:50,417 INFO L87 Difference]: Start difference. First operand 1008 states and 1111 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-17 03:01:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:52,132 INFO L93 Difference]: Finished difference Result 1007 states and 1110 transitions. [2024-11-17 03:01:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:01:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-17 03:01:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:52,135 INFO L225 Difference]: With dead ends: 1007 [2024-11-17 03:01:52,135 INFO L226 Difference]: Without dead ends: 1007 [2024-11-17 03:01:52,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-17 03:01:52,135 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 2 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:52,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2398 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 03:01:52,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-11-17 03:01:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2024-11-17 03:01:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 658 states have (on average 1.6443768996960486) internal successors, (1082), 1000 states have internal predecessors, (1082), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1110 transitions. [2024-11-17 03:01:52,148 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1110 transitions. Word has length 69 [2024-11-17 03:01:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:52,148 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1110 transitions. [2024-11-17 03:01:52,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-17 03:01:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1110 transitions. [2024-11-17 03:01:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 03:01:52,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:52,149 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] [2024-11-17 03:01:52,156 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 (17)] Forceful destruction successful, exit code 0 [2024-11-17 03:01:52,349 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-17 03:01:52,349 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:52,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash -255960519, now seen corresponding path program 1 times [2024-11-17 03:01:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:52,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110824713] [2024-11-17 03:01:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:52,350 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-17 03:01:52,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:52,352 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-17 03:01:52,353 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-17 03:01:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:52,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 03:01:52,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:52,711 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-17 03:01:52,733 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-17 03:01:52,743 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-17 03:01:52,789 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-17 03:01:52,801 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-17 03:01:52,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:52,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:52,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110824713] [2024-11-17 03:01:52,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110824713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:52,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:52,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:01:52,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271960165] [2024-11-17 03:01:52,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:52,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:01:52,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:52,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:01:52,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:01:52,803 INFO L87 Difference]: Start difference. First operand 1007 states and 1110 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-17 03:01:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:54,754 INFO L93 Difference]: Finished difference Result 1006 states and 1109 transitions. [2024-11-17 03:01:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:01:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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 69 [2024-11-17 03:01:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:54,757 INFO L225 Difference]: With dead ends: 1006 [2024-11-17 03:01:54,757 INFO L226 Difference]: Without dead ends: 1006 [2024-11-17 03:01:54,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-17 03:01:54,758 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 1 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:54,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2442 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 03:01:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2024-11-17 03:01:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2024-11-17 03:01:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 657 states have (on average 1.6453576864535768) internal successors, (1081), 999 states have internal predecessors, (1081), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 03:01:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1109 transitions. [2024-11-17 03:01:54,772 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1109 transitions. Word has length 69 [2024-11-17 03:01:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:54,773 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1109 transitions. [2024-11-17 03:01:54,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 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-17 03:01:54,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1109 transitions. [2024-11-17 03:01:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-17 03:01:54,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:54,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:54,785 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-17 03:01:54,974 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-17 03:01:54,975 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash -47272747, now seen corresponding path program 1 times [2024-11-17 03:01:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711932710] [2024-11-17 03:01:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:54,976 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-17 03:01:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:54,977 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-17 03:01:54,980 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-17 03:01:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:55,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:01:55,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:55,274 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-17 03:01:55,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:01:55,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711932710] [2024-11-17 03:01:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711932710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:01:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:01:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:01:55,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948823440] [2024-11-17 03:01:55,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:01:55,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:01:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:55,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:01:55,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:01:55,277 INFO L87 Difference]: Start difference. First operand 1006 states and 1109 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (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-17 03:01:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:55,323 INFO L93 Difference]: Finished difference Result 1009 states and 1113 transitions. [2024-11-17 03:01:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:01:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (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 77 [2024-11-17 03:01:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:55,328 INFO L225 Difference]: With dead ends: 1009 [2024-11-17 03:01:55,329 INFO L226 Difference]: Without dead ends: 1009 [2024-11-17 03:01:55,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-17 03:01:55,329 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:55,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2710 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 03:01:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-17 03:01:55,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2024-11-17 03:01:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 659 states have (on average 1.644916540212443) internal successors, (1084), 1002 states have internal predecessors, (1084), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1113 transitions. [2024-11-17 03:01:55,350 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1113 transitions. Word has length 77 [2024-11-17 03:01:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:55,350 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1113 transitions. [2024-11-17 03:01:55,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (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-17 03:01:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1113 transitions. [2024-11-17 03:01:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 03:01:55,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:55,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:55,365 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 (19)] Forceful destruction successful, exit code 0 [2024-11-17 03:01:55,553 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-17 03:01:55,553 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:55,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash 690671234, now seen corresponding path program 1 times [2024-11-17 03:01:55,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:55,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456911057] [2024-11-17 03:01:55,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:01:55,555 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-17 03:01:55,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:55,558 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-17 03:01:55,559 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-17 03:01:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:01:55,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:01:55,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:55,865 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-17 03:01:55,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:55,922 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-17 03:01:55,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:55,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456911057] [2024-11-17 03:01:55,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456911057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:01:55,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:55,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 03:01:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689021416] [2024-11-17 03:01:55,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:55,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:01:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:01:55,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:01:55,925 INFO L87 Difference]: Start difference. First operand 1009 states and 1113 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-17 03:01:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:56,033 INFO L93 Difference]: Finished difference Result 1021 states and 1130 transitions. [2024-11-17 03:01:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:01:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 78 [2024-11-17 03:01:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:56,038 INFO L225 Difference]: With dead ends: 1021 [2024-11-17 03:01:56,039 INFO L226 Difference]: Without dead ends: 1021 [2024-11-17 03:01:56,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 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-17 03:01:56,040 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 5 mSDsluCounter, 3606 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:56,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4511 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 03:01:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-11-17 03:01:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1019. [2024-11-17 03:01:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 668 states have (on average 1.6452095808383234) internal successors, (1099), 1011 states have internal predecessors, (1099), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1128 transitions. [2024-11-17 03:01:56,055 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1128 transitions. Word has length 78 [2024-11-17 03:01:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:56,055 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1128 transitions. [2024-11-17 03:01:56,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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-17 03:01:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1128 transitions. [2024-11-17 03:01:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-17 03:01:56,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:56,065 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:56,073 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 (20)] Forceful destruction successful, exit code 0 [2024-11-17 03:01:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 03:01:56,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:56,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash 738209813, now seen corresponding path program 2 times [2024-11-17 03:01:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475648756] [2024-11-17 03:01:56,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:01:56,267 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-17 03:01:56,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:56,270 INFO L229 MonitoredProcess]: Starting monitored process 21 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-17 03:01:56,273 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 (21)] Waiting until timeout for monitored process [2024-11-17 03:01:56,736 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:01:56,736 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:01:56,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:01:56,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:56,806 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-17 03:01:56,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:56,954 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-17 03:01:56,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475648756] [2024-11-17 03:01:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475648756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:01:56,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:56,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 03:01:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052790546] [2024-11-17 03:01:56,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 03:01:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 03:01:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 03:01:56,957 INFO L87 Difference]: Start difference. First operand 1019 states and 1128 transitions. Second operand has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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-17 03:01:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:01:57,316 INFO L93 Difference]: Finished difference Result 1034 states and 1150 transitions. [2024-11-17 03:01:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 03:01:57,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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 81 [2024-11-17 03:01:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:01:57,327 INFO L225 Difference]: With dead ends: 1034 [2024-11-17 03:01:57,327 INFO L226 Difference]: Without dead ends: 1030 [2024-11-17 03:01:57,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 03:01:57,328 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 8 mSDsluCounter, 8112 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9017 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 03:01:57,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9017 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 03:01:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-11-17 03:01:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1028. [2024-11-17 03:01:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 677 states have (on average 1.6410635155096012) internal successors, (1111), 1020 states have internal predecessors, (1111), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:01:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1140 transitions. [2024-11-17 03:01:57,347 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1140 transitions. Word has length 81 [2024-11-17 03:01:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:01:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1140 transitions. [2024-11-17 03:01:57,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.142857142857143) internal successors, (86), 14 states have internal predecessors, (86), 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-17 03:01:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1140 transitions. [2024-11-17 03:01:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 03:01:57,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:01:57,349 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:01:57,360 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 (21)] Forceful destruction successful, exit code 0 [2024-11-17 03:01:57,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 03:01:57,549 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:01:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:01:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1428334837, now seen corresponding path program 3 times [2024-11-17 03:01:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:01:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545962947] [2024-11-17 03:01:57,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:01:57,551 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-17 03:01:57,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:01:57,552 INFO L229 MonitoredProcess]: Starting monitored process 22 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-17 03:01:57,553 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 (22)] Waiting until timeout for monitored process [2024-11-17 03:01:58,215 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 03:01:58,216 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:01:58,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 03:01:58,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:01:58,349 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-17 03:01:58,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:01:58,790 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-17 03:01:58,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:01:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545962947] [2024-11-17 03:01:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545962947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:01:58,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:01:58,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 03:01:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446788815] [2024-11-17 03:01:58,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:01:58,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 03:01:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:01:58,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 03:01:58,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 03:01:58,793 INFO L87 Difference]: Start difference. First operand 1028 states and 1140 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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-17 03:02:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:00,381 INFO L93 Difference]: Finished difference Result 1052 states and 1179 transitions. [2024-11-17 03:02:00,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 03:02:00,381 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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 87 [2024-11-17 03:02:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:00,385 INFO L225 Difference]: With dead ends: 1052 [2024-11-17 03:02:00,385 INFO L226 Difference]: Without dead ends: 1046 [2024-11-17 03:02:00,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 03:02:00,386 INFO L432 NwaCegarLoop]: 906 mSDtfsCounter, 26 mSDsluCounter, 9935 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10841 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:00,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10841 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 03:02:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-17 03:02:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2024-11-17 03:02:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 695 states have (on average 1.6316546762589927) internal successors, (1134), 1038 states have internal predecessors, (1134), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:02:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1163 transitions. [2024-11-17 03:02:00,403 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1163 transitions. Word has length 87 [2024-11-17 03:02:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:00,403 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1163 transitions. [2024-11-17 03:02:00,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 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-17 03:02:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1163 transitions. [2024-11-17 03:02:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 03:02:00,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:00,404 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:00,412 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 (22)] Forceful destruction successful, exit code 0 [2024-11-17 03:02:00,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 03:02:00,605 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:02:00,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1976771253, now seen corresponding path program 4 times [2024-11-17 03:02:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119239637] [2024-11-17 03:02:00,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:02:00,606 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-17 03:02:00,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:00,607 INFO L229 MonitoredProcess]: Starting monitored process 23 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-17 03:02:00,609 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 (23)] Waiting until timeout for monitored process [2024-11-17 03:02:01,063 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:02:01,063 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:02:01,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 03:02:01,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:01,434 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-17 03:02:01,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:02:02,616 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-17 03:02:02,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:02,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119239637] [2024-11-17 03:02:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119239637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:02:02,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:02:02,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 03:02:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957031198] [2024-11-17 03:02:02,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:02:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 03:02:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:02:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 03:02:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 03:02:02,620 INFO L87 Difference]: Start difference. First operand 1046 states and 1163 transitions. Second operand has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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-17 03:02:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 03:02:07,748 INFO L93 Difference]: Finished difference Result 1086 states and 1235 transitions. [2024-11-17 03:02:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 03:02:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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 99 [2024-11-17 03:02:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 03:02:07,753 INFO L225 Difference]: With dead ends: 1086 [2024-11-17 03:02:07,753 INFO L226 Difference]: Without dead ends: 1082 [2024-11-17 03:02:07,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 03:02:07,755 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 32 mSDsluCounter, 20750 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 21655 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 03:02:07,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 21655 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 03:02:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2024-11-17 03:02:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2024-11-17 03:02:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 729 states have (on average 1.6186556927297668) internal successors, (1180), 1072 states have internal predecessors, (1180), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-17 03:02:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1209 transitions. [2024-11-17 03:02:07,768 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1209 transitions. Word has length 99 [2024-11-17 03:02:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 03:02:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1209 transitions. [2024-11-17 03:02:07,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.44) internal successors, (122), 50 states have internal predecessors, (122), 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-17 03:02:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1209 transitions. [2024-11-17 03:02:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-17 03:02:07,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 03:02:07,770 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:02:07,785 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 (23)] Ended with exit code 0 [2024-11-17 03:02:07,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 03:02:07,971 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-17 03:02:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:02:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1310199659, now seen corresponding path program 5 times [2024-11-17 03:02:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:02:07,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747133654] [2024-11-17 03:02:07,972 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 03:02:07,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:02:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:02:07,974 INFO L229 MonitoredProcess]: Starting monitored process 24 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-17 03:02:07,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-17 03:02:09,171 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 03:02:09,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:02:09,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-17 03:02:09,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:02:09,210 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-17 03:02:09,323 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 03:02:09,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-17 03:02:09,354 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-17 03:02:09,423 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 24 treesize of output 12 [2024-11-17 03:02:10,451 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 03:02:10,451 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 44 treesize of output 43 [2024-11-17 03:02:10,522 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 33 treesize of output 15 [2024-11-17 03:02:10,554 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-17 03:02:10,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:02:10,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:02:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747133654] [2024-11-17 03:02:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747133654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:02:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1347472646] [2024-11-17 03:02:10,982 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 03:02:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 03:02:10,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 03:02:10,984 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 03:02:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process