./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:57:22,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:57:22,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 08:57:22,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:57:22,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:57:22,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:57:22,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:57:22,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:57:22,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:57:22,820 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:57:22,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:57:22,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:57:22,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:57:22,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:57:22,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:57:22,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:57:22,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 08:57:22,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:57:22,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 08:57:22,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:57:22,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:57:22,826 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:57:22,826 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:57:22,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:57:22,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:57:22,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:57:22,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:57:22,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 08:57:22,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:57:22,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:57:22,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:57:22,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:57:22,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:57:22,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:57:22,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:57:22,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:57:22,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 08:57:22,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 08:57:22,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:57:22,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:57:22,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:57:22,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:57:22,830 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2024-11-19 08:57:23,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:57:23,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:57:23,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:57:23,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:57:23,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:57:23,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2024-11-19 08:57:24,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:57:24,604 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:57:24,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2024-11-19 08:57:24,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c40ef6b/7d1072b673bd46c09e7300b2108232af/FLAG662fd2296 [2024-11-19 08:57:24,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c40ef6b/7d1072b673bd46c09e7300b2108232af [2024-11-19 08:57:24,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:57:24,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:57:24,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:24,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:57:24,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:57:24,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:24" (1/1) ... [2024-11-19 08:57:24,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b062d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:24, skipping insertion in model container [2024-11-19 08:57:24,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:24" (1/1) ... [2024-11-19 08:57:24,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:57:25,032 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,065 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,069 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,073 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,111 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,116 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,121 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,124 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,156 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,160 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,161 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,162 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,175 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,177 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,179 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,179 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,186 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,189 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,191 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,193 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,206 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,207 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,208 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,208 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,209 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,212 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,214 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,215 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,216 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,219 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,223 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,223 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,225 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:25,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:25,248 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-19 08:57:25,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7377d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:25, skipping insertion in model container [2024-11-19 08:57:25,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:25,249 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 08:57:25,251 INFO L158 Benchmark]: Toolchain (without parser) took 609.96ms. Allocated memory is still 161.5MB. Free memory was 131.7MB in the beginning and 95.2MB in the end (delta: 36.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 08:57:25,251 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 08:57:25,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.59ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 95.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 08:57:25,253 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.13ms. Allocated memory is still 117.4MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.59ms. Allocated memory is still 161.5MB. Free memory was 130.8MB in the beginning and 95.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:57:26,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:57:26,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 08:57:26,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:57:26,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:57:26,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:57:26,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:57:26,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:57:26,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:57:26,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:57:26,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:57:26,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:57:26,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:57:26,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:57:26,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:57:26,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:57:26,942 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 08:57:26,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:57:26,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 08:57:26,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:57:26,942 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:57:26,943 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:57:26,943 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:57:26,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:57:26,944 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:57:26,944 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 08:57:26,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:57:26,944 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 08:57:26,944 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:57:26,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 08:57:26,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:57:26,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:57:26,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:57:26,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:57:26,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:57:26,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:57:26,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:57:26,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:57:26,946 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 08:57:26,946 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 08:57:26,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:57:26,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:57:26,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:57:26,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:57:26,947 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 -> 5577528c45849c92d31dcecadbfe6524610e7683d1e420d37b6f0ce59c6c59b8 [2024-11-19 08:57:27,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:57:27,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:57:27,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:57:27,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:57:27,204 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:57:27,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2024-11-19 08:57:28,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:57:28,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:57:28,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test10-3.i [2024-11-19 08:57:28,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c512d7f55/f48c0736d97342dabb4be2e41d2725ef/FLAG2bb87aeb6 [2024-11-19 08:57:28,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c512d7f55/f48c0736d97342dabb4be2e41d2725ef [2024-11-19 08:57:28,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:57:28,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:57:28,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:28,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:57:28,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:57:28,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:28" (1/1) ... [2024-11-19 08:57:28,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347a4ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:28, skipping insertion in model container [2024-11-19 08:57:28,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:57:28" (1/1) ... [2024-11-19 08:57:29,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:57:29,400 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,428 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,431 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,435 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,439 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,469 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,475 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,477 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,481 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,507 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,508 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,508 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,528 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,528 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,533 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,535 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,550 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,550 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,552 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,552 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,554 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,556 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,560 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,561 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,561 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,566 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,569 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:29,592 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 08:57:29,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:57:29,627 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,633 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,635 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,636 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,647 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,648 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,651 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,653 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,664 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,664 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,669 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,670 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,671 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,671 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,681 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,681 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,682 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,683 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,695 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,695 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,696 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,697 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,701 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,702 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,709 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,709 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,709 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,710 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,712 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 08:57:29,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:29,723 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 08:57:29,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:57:29,859 INFO L204 MainTranslator]: Completed translation [2024-11-19 08:57:29,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29 WrapperNode [2024-11-19 08:57:29,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:57:29,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 08:57:29,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 08:57:29,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 08:57:29,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:29,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:29,987 INFO L138 Inliner]: procedures = 180, calls = 606, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2586 [2024-11-19 08:57:29,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 08:57:29,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 08:57:29,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 08:57:29,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 08:57:29,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:29,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,161 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 106, 466]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 4, 98]. [2024-11-19 08:57:30,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 08:57:30,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 08:57:30,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 08:57:30,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 08:57:30,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (1/1) ... [2024-11-19 08:57:30,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:57:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:57:30,324 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-19 08:57:30,326 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-19 08:57:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 08:57:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 08:57:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 08:57:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-19 08:57:30,363 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-19 08:57:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 08:57:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 08:57:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 08:57:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 08:57:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 08:57:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 08:57:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 08:57:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 08:57:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 08:57:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 08:57:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 08:57:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 08:57:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 08:57:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 08:57:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 08:57:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 08:57:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 08:57:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 08:57:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 08:57:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 08:57:30,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 08:57:30,631 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 08:57:30,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 08:57:30,684 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:57:30,705 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:57:30,725 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:57:35,995 INFO L? ?]: Removed 2434 outVars from TransFormulas that were not future-live. [2024-11-19 08:57:35,995 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 08:57:36,040 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 08:57:36,041 INFO L316 CfgBuilder]: Removed 168 assume(true) statements. [2024-11-19 08:57:36,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:57:36 BoogieIcfgContainer [2024-11-19 08:57:36,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 08:57:36,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 08:57:36,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 08:57:36,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 08:57:36,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:57:28" (1/3) ... [2024-11-19 08:57:36,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef624a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:57:36, skipping insertion in model container [2024-11-19 08:57:36,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:57:29" (2/3) ... [2024-11-19 08:57:36,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef624a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:57:36, skipping insertion in model container [2024-11-19 08:57:36,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:57:36" (3/3) ... [2024-11-19 08:57:36,049 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test10-3.i [2024-11-19 08:57:36,061 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 08:57:36,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1189 error locations. [2024-11-19 08:57:36,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 08:57:36,133 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;@1e15d065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 08:57:36,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1189 error locations. [2024-11-19 08:57:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 2457 states, 1256 states have (on average 2.200636942675159) internal successors, (2764), 2443 states have internal predecessors, (2764), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 08:57:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:57:36,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:36,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:57:36,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-19 08:57:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:36,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396169700] [2024-11-19 08:57:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:57:36,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:36,164 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-19 08:57:36,166 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-19 08:57:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:36,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:57:36,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:36,397 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-19 08:57:36,413 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-19 08:57:36,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:36,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:36,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396169700] [2024-11-19 08:57:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396169700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:36,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698663682] [2024-11-19 08:57:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:36,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:36,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:36,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:36,469 INFO L87 Difference]: Start difference. First operand has 2457 states, 1256 states have (on average 2.200636942675159) internal successors, (2764), 2443 states have internal predecessors, (2764), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-19 08:57:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:39,373 INFO L93 Difference]: Finished difference Result 3292 states and 3492 transitions. [2024-11-19 08:57:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:39,375 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-19 08:57:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:39,395 INFO L225 Difference]: With dead ends: 3292 [2024-11-19 08:57:39,395 INFO L226 Difference]: Without dead ends: 3290 [2024-11-19 08:57:39,396 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-19 08:57:39,398 INFO L432 NwaCegarLoop]: 1676 mSDtfsCounter, 2320 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:39,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 2247 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 08:57:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2024-11-19 08:57:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2601. [2024-11-19 08:57:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 1428 states have (on average 2.03781512605042) internal successors, (2910), 2585 states have internal predecessors, (2910), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:57:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 2942 transitions. [2024-11-19 08:57:39,497 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 2942 transitions. Word has length 3 [2024-11-19 08:57:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:39,497 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 2942 transitions. [2024-11-19 08:57:39,497 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-19 08:57:39,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 2942 transitions. [2024-11-19 08:57:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:57:39,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:39,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:57:39,505 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-19 08:57:39,705 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-19 08:57:39,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-19 08:57:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823812664] [2024-11-19 08:57:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:39,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:57:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:39,708 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-19 08:57:39,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 08:57:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:39,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:57:39,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:39,886 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-19 08:57:39,898 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-19 08:57:39,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:39,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:39,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823812664] [2024-11-19 08:57:39,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823812664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:39,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403339063] [2024-11-19 08:57:39,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:39,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:39,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:39,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:39,903 INFO L87 Difference]: Start difference. First operand 2601 states and 2942 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-19 08:57:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:43,062 INFO L93 Difference]: Finished difference Result 3402 states and 3823 transitions. [2024-11-19 08:57:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:43,063 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-19 08:57:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:43,071 INFO L225 Difference]: With dead ends: 3402 [2024-11-19 08:57:43,071 INFO L226 Difference]: Without dead ends: 3402 [2024-11-19 08:57:43,071 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-19 08:57:43,072 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 875 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:43,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 3631 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 08:57:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2024-11-19 08:57:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3074. [2024-11-19 08:57:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 1899 states have (on average 1.9931542917324907) internal successors, (3785), 3055 states have internal predecessors, (3785), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 08:57:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3823 transitions. [2024-11-19 08:57:43,112 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3823 transitions. Word has length 3 [2024-11-19 08:57:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:43,112 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 3823 transitions. [2024-11-19 08:57:43,112 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-19 08:57:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3823 transitions. [2024-11-19 08:57:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 08:57:43,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:43,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:43,115 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-19 08:57:43,313 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-19 08:57:43,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:43,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:43,314 INFO L85 PathProgramCache]: Analyzing trace with hash 703308354, now seen corresponding path program 1 times [2024-11-19 08:57:43,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:43,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759302878] [2024-11-19 08:57:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:43,315 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-19 08:57:43,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:43,317 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-19 08:57:43,318 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-19 08:57:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:43,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 08:57:43,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:43,493 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-19 08:57:43,496 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-19 08:57:43,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:57:43,543 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-19 08:57:43,556 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 08:57:43,556 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-19 08:57:43,577 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-19 08:57:43,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:43,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:43,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759302878] [2024-11-19 08:57:43,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759302878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:43,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:43,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:43,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383897557] [2024-11-19 08:57:43,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:43,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:43,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:43,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:43,581 INFO L87 Difference]: Start difference. First operand 3074 states and 3823 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-19 08:57:49,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:49,534 INFO L93 Difference]: Finished difference Result 5339 states and 6238 transitions. [2024-11-19 08:57:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:57:49,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-19 08:57:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:49,548 INFO L225 Difference]: With dead ends: 5339 [2024-11-19 08:57:49,548 INFO L226 Difference]: Without dead ends: 5339 [2024-11-19 08:57:49,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-19 08:57:49,549 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 2384 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:49,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 3399 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-19 08:57:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2024-11-19 08:57:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 3794. [2024-11-19 08:57:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 2619 states have (on average 2.020236731576938) internal successors, (5291), 3769 states have internal predecessors, (5291), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5341 transitions. [2024-11-19 08:57:49,598 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5341 transitions. Word has length 7 [2024-11-19 08:57:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:49,598 INFO L471 AbstractCegarLoop]: Abstraction has 3794 states and 5341 transitions. [2024-11-19 08:57:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-19 08:57:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5341 transitions. [2024-11-19 08:57:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 08:57:49,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:49,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:49,604 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-19 08:57:49,799 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-19 08:57:49,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:49,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-19 08:57:49,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:49,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812848667] [2024-11-19 08:57:49,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:49,801 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-19 08:57:49,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:49,804 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-19 08:57:49,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 08:57:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:49,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:57:49,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:49,937 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-19 08:57:49,945 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-19 08:57:49,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:49,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:49,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812848667] [2024-11-19 08:57:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812848667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:49,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24014291] [2024-11-19 08:57:49,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:49,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:49,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:49,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:49,947 INFO L87 Difference]: Start difference. First operand 3794 states and 5341 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:52,024 INFO L93 Difference]: Finished difference Result 4506 states and 6011 transitions. [2024-11-19 08:57:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 08:57:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:52,034 INFO L225 Difference]: With dead ends: 4506 [2024-11-19 08:57:52,034 INFO L226 Difference]: Without dead ends: 4506 [2024-11-19 08:57:52,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:52,034 INFO L432 NwaCegarLoop]: 2413 mSDtfsCounter, 1920 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:52,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 3181 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 08:57:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2024-11-19 08:57:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 3702. [2024-11-19 08:57:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2619 states have (on average 1.9381443298969072) internal successors, (5076), 3677 states have internal predecessors, (5076), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5126 transitions. [2024-11-19 08:57:52,082 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5126 transitions. Word has length 8 [2024-11-19 08:57:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:52,083 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5126 transitions. [2024-11-19 08:57:52,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5126 transitions. [2024-11-19 08:57:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 08:57:52,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:52,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:52,088 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-19 08:57:52,284 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-19 08:57:52,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:52,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-19 08:57:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131289933] [2024-11-19 08:57:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:52,285 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-19 08:57:52,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:52,286 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-19 08:57:52,287 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-19 08:57:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:52,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:57:52,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:52,430 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-19 08:57:52,451 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-19 08:57:52,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:52,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131289933] [2024-11-19 08:57:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131289933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:52,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:52,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:52,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142738037] [2024-11-19 08:57:52,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:52,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:52,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:52,454 INFO L87 Difference]: Start difference. First operand 3702 states and 5126 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:55,450 INFO L93 Difference]: Finished difference Result 5507 states and 7586 transitions. [2024-11-19 08:57:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:55,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 08:57:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:55,462 INFO L225 Difference]: With dead ends: 5507 [2024-11-19 08:57:55,462 INFO L226 Difference]: Without dead ends: 5507 [2024-11-19 08:57:55,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:55,463 INFO L432 NwaCegarLoop]: 2765 mSDtfsCounter, 1423 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3968 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:55,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3968 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 08:57:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5507 states. [2024-11-19 08:57:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5507 to 4046. [2024-11-19 08:57:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4046 states, 2973 states have (on average 1.922637066935755) internal successors, (5716), 4021 states have internal predecessors, (5716), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4046 states to 4046 states and 5766 transitions. [2024-11-19 08:57:55,508 INFO L78 Accepts]: Start accepts. Automaton has 4046 states and 5766 transitions. Word has length 8 [2024-11-19 08:57:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:55,509 INFO L471 AbstractCegarLoop]: Abstraction has 4046 states and 5766 transitions. [2024-11-19 08:57:55,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:57:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4046 states and 5766 transitions. [2024-11-19 08:57:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 08:57:55,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:55,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:55,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 08:57:55,710 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-19 08:57:55,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:55,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:55,711 INFO L85 PathProgramCache]: Analyzing trace with hash -582246585, now seen corresponding path program 1 times [2024-11-19 08:57:55,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149431532] [2024-11-19 08:57:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:55,711 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-19 08:57:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:55,713 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-19 08:57:55,714 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-19 08:57:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:55,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 08:57:55,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:55,852 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-19 08:57:55,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:55,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149431532] [2024-11-19 08:57:55,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149431532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:55,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:55,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682892300] [2024-11-19 08:57:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:55,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:55,854 INFO L87 Difference]: Start difference. First operand 4046 states and 5766 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 08:57:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:55,893 INFO L93 Difference]: Finished difference Result 3986 states and 5680 transitions. [2024-11-19 08:57:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-19 08:57:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:55,905 INFO L225 Difference]: With dead ends: 3986 [2024-11-19 08:57:55,905 INFO L226 Difference]: Without dead ends: 3986 [2024-11-19 08:57:55,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-19 08:57:55,906 INFO L432 NwaCegarLoop]: 2419 mSDtfsCounter, 71 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4775 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-19 08:57:55,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4775 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-19 08:57:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3986. [2024-11-19 08:57:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 2937 states have (on average 1.9169220292815798) internal successors, (5630), 3961 states have internal predecessors, (5630), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5680 transitions. [2024-11-19 08:57:55,949 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5680 transitions. Word has length 11 [2024-11-19 08:57:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:55,950 INFO L471 AbstractCegarLoop]: Abstraction has 3986 states and 5680 transitions. [2024-11-19 08:57:55,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-19 08:57:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5680 transitions. [2024-11-19 08:57:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 08:57:55,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:55,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:55,954 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-19 08:57:56,153 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-19 08:57:56,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1193166111, now seen corresponding path program 1 times [2024-11-19 08:57:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053128534] [2024-11-19 08:57:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:56,156 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-19 08:57:56,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:56,158 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-19 08:57:56,159 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-19 08:57:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:56,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:57:56,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:56,314 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-19 08:57:56,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:56,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053128534] [2024-11-19 08:57:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053128534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145703903] [2024-11-19 08:57:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:56,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:56,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:56,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:56,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:56,316 INFO L87 Difference]: Start difference. First operand 3986 states and 5680 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 08:57:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:56,381 INFO L93 Difference]: Finished difference Result 3956 states and 5622 transitions. [2024-11-19 08:57:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:57:56,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 08:57:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:56,389 INFO L225 Difference]: With dead ends: 3956 [2024-11-19 08:57:56,389 INFO L226 Difference]: Without dead ends: 3956 [2024-11-19 08:57:56,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-19 08:57:56,390 INFO L432 NwaCegarLoop]: 2374 mSDtfsCounter, 48 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7096 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:56,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2024-11-19 08:57:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3956. [2024-11-19 08:57:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 2921 states have (on average 1.907565902088326) internal successors, (5572), 3931 states have internal predecessors, (5572), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 5622 transitions. [2024-11-19 08:57:56,450 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 5622 transitions. Word has length 13 [2024-11-19 08:57:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:56,450 INFO L471 AbstractCegarLoop]: Abstraction has 3956 states and 5622 transitions. [2024-11-19 08:57:56,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-19 08:57:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 5622 transitions. [2024-11-19 08:57:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 08:57:56,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:56,451 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-19 08:57:56,457 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-19 08:57:56,652 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-19 08:57:56,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -555227553, now seen corresponding path program 1 times [2024-11-19 08:57:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685270739] [2024-11-19 08:57:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:56,654 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-19 08:57:56,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:56,656 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-19 08:57:56,657 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-19 08:57:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:56,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 08:57:56,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:56,822 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-19 08:57:56,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:56,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685270739] [2024-11-19 08:57:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685270739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:56,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841380745] [2024-11-19 08:57:56,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:56,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:56,823 INFO L87 Difference]: Start difference. First operand 3956 states and 5622 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-19 08:57:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:56,854 INFO L93 Difference]: Finished difference Result 3824 states and 5364 transitions. [2024-11-19 08:57:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:56,855 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-19 08:57:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:56,863 INFO L225 Difference]: With dead ends: 3824 [2024-11-19 08:57:56,863 INFO L226 Difference]: Without dead ends: 3824 [2024-11-19 08:57:56,863 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-19 08:57:56,864 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 71 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4619 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-19 08:57:56,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4619 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2024-11-19 08:57:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3824. [2024-11-19 08:57:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 2813 states have (on average 1.8890863846427302) internal successors, (5314), 3799 states have internal predecessors, (5314), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5364 transitions. [2024-11-19 08:57:56,903 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5364 transitions. Word has length 20 [2024-11-19 08:57:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:56,903 INFO L471 AbstractCegarLoop]: Abstraction has 3824 states and 5364 transitions. [2024-11-19 08:57:56,904 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-19 08:57:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5364 transitions. [2024-11-19 08:57:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 08:57:56,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:56,908 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-19 08:57:56,913 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-19 08:57:57,108 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-19 08:57:57,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:57,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-19 08:57:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:57,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346320491] [2024-11-19 08:57:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:57,110 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-19 08:57:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:57,111 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-19 08:57:57,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 08:57:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:57,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 08:57:57,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:57,275 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-19 08:57:57,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:57,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:57,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346320491] [2024-11-19 08:57:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346320491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:57,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215682960] [2024-11-19 08:57:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:57,276 INFO L87 Difference]: Start difference. First operand 3824 states and 5364 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-19 08:57:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:57,302 INFO L93 Difference]: Finished difference Result 3764 states and 5278 transitions. [2024-11-19 08:57:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:57,302 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-19 08:57:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:57,307 INFO L225 Difference]: With dead ends: 3764 [2024-11-19 08:57:57,307 INFO L226 Difference]: Without dead ends: 3764 [2024-11-19 08:57:57,307 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-19 08:57:57,307 INFO L432 NwaCegarLoop]: 2298 mSDtfsCounter, 71 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4533 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-19 08:57:57,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4533 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2024-11-19 08:57:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2024-11-19 08:57:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 2777 states have (on average 1.882607129996399) internal successors, (5228), 3739 states have internal predecessors, (5228), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5278 transitions. [2024-11-19 08:57:57,339 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5278 transitions. Word has length 20 [2024-11-19 08:57:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:57,339 INFO L471 AbstractCegarLoop]: Abstraction has 3764 states and 5278 transitions. [2024-11-19 08:57:57,339 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-19 08:57:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5278 transitions. [2024-11-19 08:57:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 08:57:57,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:57,340 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-19 08:57:57,345 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-19 08:57:57,540 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-19 08:57:57,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:57,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash -997708103, now seen corresponding path program 1 times [2024-11-19 08:57:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:57,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959741606] [2024-11-19 08:57:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:57,542 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-19 08:57:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:57,544 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-19 08:57:57,545 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-19 08:57:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:57,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:57:57,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:57,710 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-19 08:57:57,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:57,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:57,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959741606] [2024-11-19 08:57:57,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959741606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541410061] [2024-11-19 08:57:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:57,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:57,712 INFO L87 Difference]: Start difference. First operand 3764 states and 5278 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-19 08:57:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:57,784 INFO L93 Difference]: Finished difference Result 3702 states and 5104 transitions. [2024-11-19 08:57:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:57:57,784 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-19 08:57:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:57,788 INFO L225 Difference]: With dead ends: 3702 [2024-11-19 08:57:57,788 INFO L226 Difference]: Without dead ends: 3702 [2024-11-19 08:57:57,788 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-19 08:57:57,789 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 48 mSDsluCounter, 4480 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6733 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:57,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6733 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2024-11-19 08:57:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3702. [2024-11-19 08:57:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2729 states have (on average 1.851960425064126) internal successors, (5054), 3677 states have internal predecessors, (5054), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5104 transitions. [2024-11-19 08:57:57,818 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5104 transitions. Word has length 22 [2024-11-19 08:57:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:57,818 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5104 transitions. [2024-11-19 08:57:57,818 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-19 08:57:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5104 transitions. [2024-11-19 08:57:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 08:57:57,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:57,819 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-19 08:57:57,823 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-19 08:57:58,019 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-19 08:57:58,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:58,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash -316792903, now seen corresponding path program 1 times [2024-11-19 08:57:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942746745] [2024-11-19 08:57:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:58,021 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-19 08:57:58,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:58,023 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-19 08:57:58,024 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-19 08:57:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:58,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:57:58,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:58,200 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-19 08:57:58,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:58,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:58,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942746745] [2024-11-19 08:57:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942746745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:57:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512320274] [2024-11-19 08:57:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:58,202 INFO L87 Difference]: Start difference. First operand 3702 states and 5104 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-19 08:57:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:58,257 INFO L93 Difference]: Finished difference Result 3672 states and 5046 transitions. [2024-11-19 08:57:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:57:58,258 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-19 08:57:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:58,262 INFO L225 Difference]: With dead ends: 3672 [2024-11-19 08:57:58,262 INFO L226 Difference]: Without dead ends: 3672 [2024-11-19 08:57:58,262 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-19 08:57:58,263 INFO L432 NwaCegarLoop]: 2218 mSDtfsCounter, 48 mSDsluCounter, 4410 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6628 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:58,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6628 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:57:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-11-19 08:57:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3672. [2024-11-19 08:57:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 2713 states have (on average 1.841503870254331) internal successors, (4996), 3647 states have internal predecessors, (4996), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:57:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5046 transitions. [2024-11-19 08:57:58,298 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5046 transitions. Word has length 22 [2024-11-19 08:57:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:58,299 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 5046 transitions. [2024-11-19 08:57:58,299 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-19 08:57:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5046 transitions. [2024-11-19 08:57:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 08:57:58,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:58,300 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] [2024-11-19 08:57:58,305 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-19 08:57:58,500 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-19 08:57:58,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:57:58,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash -544433649, now seen corresponding path program 1 times [2024-11-19 08:57:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748899156] [2024-11-19 08:57:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:58,502 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-19 08:57:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:58,504 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-19 08:57:58,505 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-19 08:57:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:58,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:57:58,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:58,656 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-19 08:57:58,698 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-19 08:57:58,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:58,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748899156] [2024-11-19 08:57:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748899156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:58,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:58,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:57:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211729122] [2024-11-19 08:57:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:58,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:57:58,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:57:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:57:58,700 INFO L87 Difference]: Start difference. First operand 3672 states and 5046 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-19 08:58:01,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:01,216 INFO L93 Difference]: Finished difference Result 4290 states and 5579 transitions. [2024-11-19 08:58:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:01,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-19 08:58:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:01,223 INFO L225 Difference]: With dead ends: 4290 [2024-11-19 08:58:01,223 INFO L226 Difference]: Without dead ends: 4290 [2024-11-19 08:58:01,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-19 08:58:01,223 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 2013 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:01,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 3356 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 08:58:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2024-11-19 08:58:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 3668. [2024-11-19 08:58:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2713 states have (on average 1.8385551050497604) internal successors, (4988), 3643 states have internal predecessors, (4988), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:58:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5038 transitions. [2024-11-19 08:58:01,263 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5038 transitions. Word has length 27 [2024-11-19 08:58:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:01,264 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 5038 transitions. [2024-11-19 08:58:01,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-19 08:58:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5038 transitions. [2024-11-19 08:58:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 08:58:01,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:01,268 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] [2024-11-19 08:58:01,271 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-19 08:58:01,468 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-19 08:58:01,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:01,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash -544433648, now seen corresponding path program 1 times [2024-11-19 08:58:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010488030] [2024-11-19 08:58:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:01,470 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-19 08:58:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:01,473 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-19 08:58:01,474 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-19 08:58:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:01,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 08:58:01,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:01,625 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-19 08:58:01,704 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-19 08:58:01,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:01,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010488030] [2024-11-19 08:58:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010488030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:01,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:01,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:01,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900863384] [2024-11-19 08:58:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:01,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:01,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:01,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:01,706 INFO L87 Difference]: Start difference. First operand 3668 states and 5038 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-19 08:58:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:04,909 INFO L93 Difference]: Finished difference Result 4402 states and 5844 transitions. [2024-11-19 08:58:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:04,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-19 08:58:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:04,915 INFO L225 Difference]: With dead ends: 4402 [2024-11-19 08:58:04,915 INFO L226 Difference]: Without dead ends: 4402 [2024-11-19 08:58:04,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-19 08:58:04,916 INFO L432 NwaCegarLoop]: 1929 mSDtfsCounter, 806 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:04,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 4303 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 08:58:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2024-11-19 08:58:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 3704. [2024-11-19 08:58:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 2749 states have (on average 1.8293925063659513) internal successors, (5029), 3679 states have internal predecessors, (5029), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:58:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 5079 transitions. [2024-11-19 08:58:04,949 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 5079 transitions. Word has length 27 [2024-11-19 08:58:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:04,950 INFO L471 AbstractCegarLoop]: Abstraction has 3704 states and 5079 transitions. [2024-11-19 08:58:04,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-19 08:58:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 5079 transitions. [2024-11-19 08:58:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 08:58:04,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:04,951 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-19 08:58:04,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 08:58:05,151 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-19 08:58:05,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:05,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826599, now seen corresponding path program 1 times [2024-11-19 08:58:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069947826] [2024-11-19 08:58:05,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:05,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:58:05,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:05,155 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-19 08:58:05,155 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-19 08:58:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:05,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:05,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:05,321 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-19 08:58:05,376 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-19 08:58:05,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:05,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069947826] [2024-11-19 08:58:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069947826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:05,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:05,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:05,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627934601] [2024-11-19 08:58:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:05,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:05,378 INFO L87 Difference]: Start difference. First operand 3704 states and 5079 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-19 08:58:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:07,919 INFO L93 Difference]: Finished difference Result 4420 states and 5843 transitions. [2024-11-19 08:58:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:07,919 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-19 08:58:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:07,928 INFO L225 Difference]: With dead ends: 4420 [2024-11-19 08:58:07,929 INFO L226 Difference]: Without dead ends: 4420 [2024-11-19 08:58:07,929 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-19 08:58:07,929 INFO L432 NwaCegarLoop]: 2203 mSDtfsCounter, 1691 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:07,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4573 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 08:58:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-11-19 08:58:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3700. [2024-11-19 08:58:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2749 states have (on average 1.8206620589305202) internal successors, (5005), 3675 states have internal predecessors, (5005), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:58:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5055 transitions. [2024-11-19 08:58:07,982 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5055 transitions. Word has length 36 [2024-11-19 08:58:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:07,983 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5055 transitions. [2024-11-19 08:58:07,983 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-19 08:58:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5055 transitions. [2024-11-19 08:58:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 08:58:07,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:07,985 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-19 08:58:07,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:08,185 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-19 08:58:08,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:08,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826600, now seen corresponding path program 1 times [2024-11-19 08:58:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:08,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852576621] [2024-11-19 08:58:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:08,187 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-19 08:58:08,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:08,188 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-19 08:58:08,188 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-19 08:58:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:08,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 08:58:08,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:08,363 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-19 08:58:08,469 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-19 08:58:08,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:08,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:08,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852576621] [2024-11-19 08:58:08,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852576621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:08,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:08,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:08,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802986322] [2024-11-19 08:58:08,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:08,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:08,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:08,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:08,471 INFO L87 Difference]: Start difference. First operand 3700 states and 5055 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-19 08:58:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:12,036 INFO L93 Difference]: Finished difference Result 5029 states and 6723 transitions. [2024-11-19 08:58:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:12,037 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-19 08:58:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:12,042 INFO L225 Difference]: With dead ends: 5029 [2024-11-19 08:58:12,042 INFO L226 Difference]: Without dead ends: 5029 [2024-11-19 08:58:12,042 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-19 08:58:12,043 INFO L432 NwaCegarLoop]: 2555 mSDtfsCounter, 1190 mSDsluCounter, 2801 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 5356 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:12,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 5356 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 08:58:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2024-11-19 08:58:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 3700. [2024-11-19 08:58:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2749 states have (on average 1.8177519097853765) internal successors, (4997), 3675 states have internal predecessors, (4997), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:58:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5047 transitions. [2024-11-19 08:58:12,082 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5047 transitions. Word has length 36 [2024-11-19 08:58:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:12,083 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5047 transitions. [2024-11-19 08:58:12,083 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-19 08:58:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5047 transitions. [2024-11-19 08:58:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 08:58:12,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:12,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:12,089 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-19 08:58:12,284 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-19 08:58:12,285 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:12,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:12,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988007, now seen corresponding path program 1 times [2024-11-19 08:58:12,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:12,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926818405] [2024-11-19 08:58:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:12,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:58:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:12,289 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-19 08:58:12,290 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-19 08:58:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:12,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:12,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:12,481 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-19 08:58:12,519 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-19 08:58:12,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:12,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926818405] [2024-11-19 08:58:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926818405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:12,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601364918] [2024-11-19 08:58:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:12,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:12,521 INFO L87 Difference]: Start difference. First operand 3700 states and 5047 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-19 08:58:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:15,124 INFO L93 Difference]: Finished difference Result 4400 states and 5811 transitions. [2024-11-19 08:58:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:15,125 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-19 08:58:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:15,129 INFO L225 Difference]: With dead ends: 4400 [2024-11-19 08:58:15,129 INFO L226 Difference]: Without dead ends: 4400 [2024-11-19 08:58:15,129 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-19 08:58:15,130 INFO L432 NwaCegarLoop]: 2203 mSDtfsCounter, 1687 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:15,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 4573 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 08:58:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2024-11-19 08:58:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 3696. [2024-11-19 08:58:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2749 states have (on average 1.8148417606402327) internal successors, (4989), 3671 states have internal predecessors, (4989), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:58:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5039 transitions. [2024-11-19 08:58:15,171 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5039 transitions. Word has length 36 [2024-11-19 08:58:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:15,171 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 5039 transitions. [2024-11-19 08:58:15,171 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-19 08:58:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5039 transitions. [2024-11-19 08:58:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 08:58:15,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:15,173 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-19 08:58:15,178 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-19 08:58:15,373 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-19 08:58:15,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:15,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:15,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988008, now seen corresponding path program 1 times [2024-11-19 08:58:15,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:15,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223281207] [2024-11-19 08:58:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:15,374 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-19 08:58:15,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:15,377 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-19 08:58:15,377 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-19 08:58:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:15,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 08:58:15,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:15,557 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-19 08:58:15,657 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-19 08:58:15,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:15,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223281207] [2024-11-19 08:58:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223281207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:15,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058405157] [2024-11-19 08:58:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:15,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:15,659 INFO L87 Difference]: Start difference. First operand 3696 states and 5039 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-19 08:58:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:19,195 INFO L93 Difference]: Finished difference Result 5021 states and 6707 transitions. [2024-11-19 08:58:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:19,195 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-19 08:58:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:19,200 INFO L225 Difference]: With dead ends: 5021 [2024-11-19 08:58:19,200 INFO L226 Difference]: Without dead ends: 5021 [2024-11-19 08:58:19,200 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-19 08:58:19,201 INFO L432 NwaCegarLoop]: 2551 mSDtfsCounter, 1182 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:19,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5318 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 08:58:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2024-11-19 08:58:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 3692. [2024-11-19 08:58:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 2749 states have (on average 1.8119316114950892) internal successors, (4981), 3667 states have internal predecessors, (4981), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:58:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5031 transitions. [2024-11-19 08:58:19,232 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5031 transitions. Word has length 36 [2024-11-19 08:58:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:19,233 INFO L471 AbstractCegarLoop]: Abstraction has 3692 states and 5031 transitions. [2024-11-19 08:58:19,233 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-19 08:58:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5031 transitions. [2024-11-19 08:58:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 08:58:19,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:19,233 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] [2024-11-19 08:58:19,239 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-19 08:58:19,434 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-19 08:58:19,434 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash 841114057, now seen corresponding path program 1 times [2024-11-19 08:58:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:19,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595521024] [2024-11-19 08:58:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:19,435 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-19 08:58:19,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:19,437 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-19 08:58:19,437 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-19 08:58:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:19,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:19,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:19,622 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-19 08:58:19,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:19,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595521024] [2024-11-19 08:58:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595521024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491247317] [2024-11-19 08:58:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:19,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:19,623 INFO L87 Difference]: Start difference. First operand 3692 states and 5031 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-19 08:58:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:19,673 INFO L93 Difference]: Finished difference Result 3680 states and 5007 transitions. [2024-11-19 08:58:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:58:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-19 08:58:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:19,677 INFO L225 Difference]: With dead ends: 3680 [2024-11-19 08:58:19,677 INFO L226 Difference]: Without dead ends: 3680 [2024-11-19 08:58:19,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-19 08:58:19,677 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 27 mSDsluCounter, 4371 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6575 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-19 08:58:19,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6575 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2024-11-19 08:58:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3680. [2024-11-19 08:58:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 2737 states have (on average 1.8111070515162586) internal successors, (4957), 3655 states have internal predecessors, (4957), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 08:58:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5007 transitions. [2024-11-19 08:58:19,706 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5007 transitions. Word has length 41 [2024-11-19 08:58:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:19,706 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5007 transitions. [2024-11-19 08:58:19,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-19 08:58:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5007 transitions. [2024-11-19 08:58:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 08:58:19,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:19,707 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] [2024-11-19 08:58:19,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-19 08:58:19,908 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-19 08:58:19,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:19,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash 385316629, now seen corresponding path program 1 times [2024-11-19 08:58:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:19,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797439953] [2024-11-19 08:58:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:19,909 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-19 08:58:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:19,912 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-19 08:58:19,913 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-19 08:58:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:20,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:20,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:20,235 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-19 08:58:20,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:20,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797439953] [2024-11-19 08:58:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797439953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:20,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:20,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:20,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36393187] [2024-11-19 08:58:20,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:20,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:20,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:20,238 INFO L87 Difference]: Start difference. First operand 3680 states and 5007 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-19 08:58:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:20,436 INFO L93 Difference]: Finished difference Result 5511 states and 7253 transitions. [2024-11-19 08:58:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:20,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-11-19 08:58:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:20,442 INFO L225 Difference]: With dead ends: 5511 [2024-11-19 08:58:20,442 INFO L226 Difference]: Without dead ends: 5511 [2024-11-19 08:58:20,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-19 08:58:20,443 INFO L432 NwaCegarLoop]: 2289 mSDtfsCounter, 1487 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:20,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 4407 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:58:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2024-11-19 08:58:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 4734. [2024-11-19 08:58:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 3784 states have (on average 1.7957188160676534) internal successors, (6795), 4699 states have internal predecessors, (6795), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 08:58:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6865 transitions. [2024-11-19 08:58:20,490 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6865 transitions. Word has length 49 [2024-11-19 08:58:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:20,491 INFO L471 AbstractCegarLoop]: Abstraction has 4734 states and 6865 transitions. [2024-11-19 08:58:20,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-19 08:58:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6865 transitions. [2024-11-19 08:58:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 08:58:20,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:20,492 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] [2024-11-19 08:58:20,497 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-19 08:58:20,692 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-19 08:58:20,693 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2050666657, now seen corresponding path program 1 times [2024-11-19 08:58:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499480706] [2024-11-19 08:58:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:20,694 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-19 08:58:20,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:20,696 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-19 08:58:20,698 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-19 08:58:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:20,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:20,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:20,946 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-19 08:58:20,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:20,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:20,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499480706] [2024-11-19 08:58:20,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499480706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:20,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:20,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774704678] [2024-11-19 08:58:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:20,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:20,948 INFO L87 Difference]: Start difference. First operand 4734 states and 6865 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-19 08:58:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:21,003 INFO L93 Difference]: Finished difference Result 4692 states and 6795 transitions. [2024-11-19 08:58:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:58:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2024-11-19 08:58:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:21,009 INFO L225 Difference]: With dead ends: 4692 [2024-11-19 08:58:21,009 INFO L226 Difference]: Without dead ends: 4692 [2024-11-19 08:58:21,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-19 08:58:21,010 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 27 mSDsluCounter, 4363 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6563 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-19 08:58:21,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6563 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2024-11-19 08:58:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 4692. [2024-11-19 08:58:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 3742 states have (on average 1.7971672902191342) internal successors, (6725), 4657 states have internal predecessors, (6725), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 08:58:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 6795 transitions. [2024-11-19 08:58:21,049 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 6795 transitions. Word has length 52 [2024-11-19 08:58:21,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:21,049 INFO L471 AbstractCegarLoop]: Abstraction has 4692 states and 6795 transitions. [2024-11-19 08:58:21,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-19 08:58:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 6795 transitions. [2024-11-19 08:58:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 08:58:21,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:21,050 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] [2024-11-19 08:58:21,056 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 (21)] Ended with exit code 0 [2024-11-19 08:58:21,251 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-19 08:58:21,251 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 705263610, now seen corresponding path program 1 times [2024-11-19 08:58:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058272893] [2024-11-19 08:58:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:21,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:58:21,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:21,255 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-19 08:58:21,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 08:58:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:21,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:21,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:21,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-19 08:58:21,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:21,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058272893] [2024-11-19 08:58:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058272893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:21,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520373635] [2024-11-19 08:58:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:21,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:21,512 INFO L87 Difference]: Start difference. First operand 4692 states and 6795 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-19 08:58:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:21,564 INFO L93 Difference]: Finished difference Result 4674 states and 6765 transitions. [2024-11-19 08:58:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:58:21,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-19 08:58:21,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:21,569 INFO L225 Difference]: With dead ends: 4674 [2024-11-19 08:58:21,569 INFO L226 Difference]: Without dead ends: 4674 [2024-11-19 08:58:21,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-19 08:58:21,570 INFO L432 NwaCegarLoop]: 2196 mSDtfsCounter, 21 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6557 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-19 08:58:21,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6557 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2024-11-19 08:58:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4674. [2024-11-19 08:58:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 3724 states have (on average 1.797798066595059) internal successors, (6695), 4639 states have internal predecessors, (6695), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 08:58:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 6765 transitions. [2024-11-19 08:58:21,607 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 6765 transitions. Word has length 55 [2024-11-19 08:58:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:21,607 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 6765 transitions. [2024-11-19 08:58:21,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-19 08:58:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 6765 transitions. [2024-11-19 08:58:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 08:58:21,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:21,608 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] [2024-11-19 08:58:21,615 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 (22)] Ended with exit code 0 [2024-11-19 08:58:21,808 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-19 08:58:21,809 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1121817781, now seen corresponding path program 1 times [2024-11-19 08:58:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015306215] [2024-11-19 08:58:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:21,810 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-19 08:58:21,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:21,814 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-19 08:58:21,815 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-19 08:58:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:22,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:22,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:22,048 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:22,049 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:22,051 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 33 treesize of output 31 [2024-11-19 08:58:22,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:58:22,073 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 62 treesize of output 22 [2024-11-19 08:58:22,091 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-19 08:58:22,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:22,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015306215] [2024-11-19 08:58:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015306215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:22,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:22,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:22,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566688107] [2024-11-19 08:58:22,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:22,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:22,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:22,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:22,095 INFO L87 Difference]: Start difference. First operand 4674 states and 6765 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:22,728 INFO L93 Difference]: Finished difference Result 6132 states and 8780 transitions. [2024-11-19 08:58:22,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-19 08:58:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:22,736 INFO L225 Difference]: With dead ends: 6132 [2024-11-19 08:58:22,736 INFO L226 Difference]: Without dead ends: 6132 [2024-11-19 08:58:22,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-19 08:58:22,737 INFO L432 NwaCegarLoop]: 2318 mSDtfsCounter, 1694 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 6019 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:22,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 6019 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 08:58:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2024-11-19 08:58:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 4640. [2024-11-19 08:58:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4640 states, 3690 states have (on average 1.8048780487804879) internal successors, (6660), 4605 states have internal predecessors, (6660), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 08:58:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4640 states to 4640 states and 6730 transitions. [2024-11-19 08:58:22,773 INFO L78 Accepts]: Start accepts. Automaton has 4640 states and 6730 transitions. Word has length 60 [2024-11-19 08:58:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:22,773 INFO L471 AbstractCegarLoop]: Abstraction has 4640 states and 6730 transitions. [2024-11-19 08:58:22,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4640 states and 6730 transitions. [2024-11-19 08:58:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 08:58:22,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:22,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] [2024-11-19 08:58:22,783 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 (23)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:22,974 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-19 08:58:22,975 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:22,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1034209811, now seen corresponding path program 1 times [2024-11-19 08:58:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:22,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436473380] [2024-11-19 08:58:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:22,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-19 08:58:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:22,978 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-19 08:58:22,979 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-19 08:58:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:23,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:23,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:23,379 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-19 08:58:23,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:23,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:23,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436473380] [2024-11-19 08:58:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436473380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:23,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:23,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205997387] [2024-11-19 08:58:23,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:23,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:23,381 INFO L87 Difference]: Start difference. First operand 4640 states and 6730 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-19 08:58:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:23,475 INFO L93 Difference]: Finished difference Result 6468 states and 9033 transitions. [2024-11-19 08:58:23,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:23,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-19 08:58:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:23,482 INFO L225 Difference]: With dead ends: 6468 [2024-11-19 08:58:23,482 INFO L226 Difference]: Without dead ends: 6468 [2024-11-19 08:58:23,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-19 08:58:23,483 INFO L432 NwaCegarLoop]: 2294 mSDtfsCounter, 1197 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:23,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 4443 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:58:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6468 states. [2024-11-19 08:58:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6468 to 5740. [2024-11-19 08:58:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 4782 states have (on average 1.7806357172731075) internal successors, (8515), 5694 states have internal predecessors, (8515), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 08:58:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 8607 transitions. [2024-11-19 08:58:23,547 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 8607 transitions. Word has length 60 [2024-11-19 08:58:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:23,547 INFO L471 AbstractCegarLoop]: Abstraction has 5740 states and 8607 transitions. [2024-11-19 08:58:23,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-19 08:58:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 8607 transitions. [2024-11-19 08:58:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 08:58:23,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:23,547 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] [2024-11-19 08:58:23,553 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 (24)] Ended with exit code 0 [2024-11-19 08:58:23,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:23,748 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:23,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1844344716, now seen corresponding path program 1 times [2024-11-19 08:58:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:23,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217671860] [2024-11-19 08:58:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:23,749 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-19 08:58:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:23,750 INFO L229 MonitoredProcess]: Starting monitored process 25 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-19 08:58:23,751 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 (25)] Waiting until timeout for monitored process [2024-11-19 08:58:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:24,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:58:24,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:24,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:24,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:24,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:24,074 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-19 08:58:24,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:58:24,182 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-19 08:58:24,188 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-19 08:58:24,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:24,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:24,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217671860] [2024-11-19 08:58:24,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217671860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:24,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:24,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821307250] [2024-11-19 08:58:24,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:24,189 INFO L87 Difference]: Start difference. First operand 5740 states and 8607 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-19 08:58:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:24,539 INFO L93 Difference]: Finished difference Result 6064 states and 8693 transitions. [2024-11-19 08:58:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-19 08:58:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:24,545 INFO L225 Difference]: With dead ends: 6064 [2024-11-19 08:58:24,545 INFO L226 Difference]: Without dead ends: 6064 [2024-11-19 08:58:24,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-19 08:58:24,546 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 857 mSDsluCounter, 4286 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 6487 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:24,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 6487 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 08:58:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2024-11-19 08:58:24,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 5299. [2024-11-19 08:58:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 4341 states have (on average 1.8007371573370192) internal successors, (7817), 5256 states have internal predecessors, (7817), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 08:58:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7903 transitions. [2024-11-19 08:58:24,583 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7903 transitions. Word has length 63 [2024-11-19 08:58:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:24,583 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7903 transitions. [2024-11-19 08:58:24,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-19 08:58:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7903 transitions. [2024-11-19 08:58:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 08:58:24,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:24,583 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] [2024-11-19 08:58:24,592 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 (25)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:24,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:24,784 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:24,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1265725906, now seen corresponding path program 1 times [2024-11-19 08:58:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112977837] [2024-11-19 08:58:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:24,785 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-19 08:58:24,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:24,786 INFO L229 MonitoredProcess]: Starting monitored process 26 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-19 08:58:24,787 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 (26)] Waiting until timeout for monitored process [2024-11-19 08:58:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:25,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 08:58:25,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:25,098 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-19 08:58:25,104 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-19 08:58:25,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:58:25,400 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-19 08:58:25,407 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 08:58:25,408 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-19 08:58:25,416 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-19 08:58:25,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:25,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112977837] [2024-11-19 08:58:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112977837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:25,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:25,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:25,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095968062] [2024-11-19 08:58:25,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:25,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:25,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:25,417 INFO L87 Difference]: Start difference. First operand 5299 states and 7903 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-19 08:58:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:27,597 INFO L93 Difference]: Finished difference Result 5215 states and 7660 transitions. [2024-11-19 08:58:27,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:27,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-19 08:58:27,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:27,603 INFO L225 Difference]: With dead ends: 5215 [2024-11-19 08:58:27,603 INFO L226 Difference]: Without dead ends: 5215 [2024-11-19 08:58:27,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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-19 08:58:27,604 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 3212 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3222 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:27,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3222 Valid, 1284 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 08:58:27,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2024-11-19 08:58:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5075. [2024-11-19 08:58:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4201 states have (on average 1.741966198524161) internal successors, (7318), 5032 states have internal predecessors, (7318), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 08:58:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 7404 transitions. [2024-11-19 08:58:27,635 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 7404 transitions. Word has length 63 [2024-11-19 08:58:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:27,635 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 7404 transitions. [2024-11-19 08:58:27,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-19 08:58:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 7404 transitions. [2024-11-19 08:58:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 08:58:27,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:27,636 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] [2024-11-19 08:58:27,643 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 (26)] Ended with exit code 0 [2024-11-19 08:58:27,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:27,837 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:27,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1551615488, now seen corresponding path program 1 times [2024-11-19 08:58:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042752625] [2024-11-19 08:58:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:27,838 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-19 08:58:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:27,839 INFO L229 MonitoredProcess]: Starting monitored process 27 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-19 08:58:27,840 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 (27)] Waiting until timeout for monitored process [2024-11-19 08:58:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:28,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 08:58:28,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:28,091 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-19 08:58:28,099 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-19 08:58:28,112 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-19 08:58:28,117 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-19 08:58:28,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:28,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042752625] [2024-11-19 08:58:28,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042752625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:28,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:28,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113250084] [2024-11-19 08:58:28,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:28,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:58:28,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:28,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:58:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:58:28,118 INFO L87 Difference]: Start difference. First operand 5075 states and 7404 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-19 08:58:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:30,660 INFO L93 Difference]: Finished difference Result 5074 states and 7401 transitions. [2024-11-19 08:58:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:58:30,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-19 08:58:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:30,666 INFO L225 Difference]: With dead ends: 5074 [2024-11-19 08:58:30,666 INFO L226 Difference]: Without dead ends: 5074 [2024-11-19 08:58:30,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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-19 08:58:30,666 INFO L432 NwaCegarLoop]: 2123 mSDtfsCounter, 2 mSDsluCounter, 3533 mSDsCounter, 0 mSdLazyCounter, 2843 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5656 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:30,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5656 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2843 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 08:58:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2024-11-19 08:58:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5074. [2024-11-19 08:58:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 4201 states have (on average 1.7412520828374196) internal successors, (7315), 5031 states have internal predecessors, (7315), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 08:58:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 7401 transitions. [2024-11-19 08:58:30,703 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 7401 transitions. Word has length 68 [2024-11-19 08:58:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:30,703 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 7401 transitions. [2024-11-19 08:58:30,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-19 08:58:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 7401 transitions. [2024-11-19 08:58:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 08:58:30,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:30,704 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] [2024-11-19 08:58:30,712 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 (27)] Ended with exit code 0 [2024-11-19 08:58:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:30,904 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:30,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1551615487, now seen corresponding path program 1 times [2024-11-19 08:58:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101191882] [2024-11-19 08:58:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:30,905 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-19 08:58:30,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:30,907 INFO L229 MonitoredProcess]: Starting monitored process 28 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-19 08:58:30,907 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 (28)] Waiting until timeout for monitored process [2024-11-19 08:58:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:31,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 08:58:31,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:31,192 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-19 08:58:31,202 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-19 08:58:31,207 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-19 08:58:31,236 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-19 08:58:31,246 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-19 08:58:31,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:31,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101191882] [2024-11-19 08:58:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101191882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:31,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822867059] [2024-11-19 08:58:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:31,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:58:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:31,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:58:31,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:58:31,247 INFO L87 Difference]: Start difference. First operand 5074 states and 7401 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-19 08:58:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:34,612 INFO L93 Difference]: Finished difference Result 5073 states and 7398 transitions. [2024-11-19 08:58:34,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:58:34,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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 68 [2024-11-19 08:58:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:34,617 INFO L225 Difference]: With dead ends: 5073 [2024-11-19 08:58:34,617 INFO L226 Difference]: Without dead ends: 5073 [2024-11-19 08:58:34,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 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-19 08:58:34,618 INFO L432 NwaCegarLoop]: 2123 mSDtfsCounter, 1 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 2862 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:34,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5634 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2862 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 08:58:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2024-11-19 08:58:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 5073. [2024-11-19 08:58:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 4198 states have (on average 1.7417818008575512) internal successors, (7312), 5030 states have internal predecessors, (7312), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 08:58:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 7398 transitions. [2024-11-19 08:58:34,648 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 7398 transitions. Word has length 68 [2024-11-19 08:58:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:34,648 INFO L471 AbstractCegarLoop]: Abstraction has 5073 states and 7398 transitions. [2024-11-19 08:58:34,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 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-19 08:58:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 7398 transitions. [2024-11-19 08:58:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 08:58:34,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:34,650 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] [2024-11-19 08:58:34,658 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 (28)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:34,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:34,850 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:34,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1215350439, now seen corresponding path program 1 times [2024-11-19 08:58:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:34,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894754654] [2024-11-19 08:58:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:34,851 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-19 08:58:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:34,852 INFO L229 MonitoredProcess]: Starting monitored process 29 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-19 08:58:34,853 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 (29)] Waiting until timeout for monitored process [2024-11-19 08:58:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:35,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:35,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:35,121 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-19 08:58:35,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:35,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894754654] [2024-11-19 08:58:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894754654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:35,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:35,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541062855] [2024-11-19 08:58:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:35,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:35,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:35,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:35,124 INFO L87 Difference]: Start difference. First operand 5073 states and 7398 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-19 08:58:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:35,178 INFO L93 Difference]: Finished difference Result 5076 states and 7406 transitions. [2024-11-19 08:58:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 76 [2024-11-19 08:58:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:35,187 INFO L225 Difference]: With dead ends: 5076 [2024-11-19 08:58:35,187 INFO L226 Difference]: Without dead ends: 5076 [2024-11-19 08:58:35,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 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-19 08:58:35,187 INFO L432 NwaCegarLoop]: 2122 mSDtfsCounter, 0 mSDsluCounter, 4236 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6358 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:35,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6358 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2024-11-19 08:58:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 5076. [2024-11-19 08:58:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 4200 states have (on average 1.7416666666666667) internal successors, (7315), 5033 states have internal predecessors, (7315), 43 states have call successors, (43), 3 states have call predecessors, (43), 4 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-19 08:58:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7406 transitions. [2024-11-19 08:58:35,231 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7406 transitions. Word has length 76 [2024-11-19 08:58:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:35,231 INFO L471 AbstractCegarLoop]: Abstraction has 5076 states and 7406 transitions. [2024-11-19 08:58:35,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-19 08:58:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7406 transitions. [2024-11-19 08:58:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 08:58:35,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:35,232 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-19 08:58:35,239 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 (29)] Ended with exit code 0 [2024-11-19 08:58:35,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:35,432 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:35,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2074467548, now seen corresponding path program 1 times [2024-11-19 08:58:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:35,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508004191] [2024-11-19 08:58:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:35,434 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-19 08:58:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:35,435 INFO L229 MonitoredProcess]: Starting monitored process 30 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-19 08:58:35,435 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 (30)] Waiting until timeout for monitored process [2024-11-19 08:58:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:35,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:35,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:35,719 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-19 08:58:35,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:35,777 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-19 08:58:35,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:35,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508004191] [2024-11-19 08:58:35,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508004191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:58:35,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 08:58:35,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950386180] [2024-11-19 08:58:35,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:35,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 08:58:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 08:58:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 08:58:35,779 INFO L87 Difference]: Start difference. First operand 5076 states and 7406 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:35,926 INFO L93 Difference]: Finished difference Result 5088 states and 7427 transitions. [2024-11-19 08:58:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:58:35,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-19 08:58:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:35,935 INFO L225 Difference]: With dead ends: 5088 [2024-11-19 08:58:35,935 INFO L226 Difference]: Without dead ends: 5088 [2024-11-19 08:58:35,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 146 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-19 08:58:35,936 INFO L432 NwaCegarLoop]: 2121 mSDtfsCounter, 8 mSDsluCounter, 8465 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10586 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:35,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10586 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:58:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5088 states. [2024-11-19 08:58:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5088 to 5086. [2024-11-19 08:58:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 4209 states have (on average 1.7415062960323118) internal successors, (7330), 5042 states have internal predecessors, (7330), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-19 08:58:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 7421 transitions. [2024-11-19 08:58:35,972 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 7421 transitions. Word has length 77 [2024-11-19 08:58:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:35,972 INFO L471 AbstractCegarLoop]: Abstraction has 5086 states and 7421 transitions. [2024-11-19 08:58:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 7421 transitions. [2024-11-19 08:58:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 08:58:35,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:35,973 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] [2024-11-19 08:58:35,980 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 (30)] Ended with exit code 0 [2024-11-19 08:58:36,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:36,174 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:36,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1507688985, now seen corresponding path program 2 times [2024-11-19 08:58:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:36,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801743410] [2024-11-19 08:58:36,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:58:36,175 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-19 08:58:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:36,176 INFO L229 MonitoredProcess]: Starting monitored process 31 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-19 08:58:36,176 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 (31)] Waiting until timeout for monitored process [2024-11-19 08:58:36,604 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 08:58:36,604 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:58:36,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 08:58:36,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:36,656 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-19 08:58:36,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:36,752 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-19 08:58:36,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:36,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801743410] [2024-11-19 08:58:36,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801743410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:58:36,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:36,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 08:58:36,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121370154] [2024-11-19 08:58:36,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:36,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:58:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:58:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 08:58:36,754 INFO L87 Difference]: Start difference. First operand 5086 states and 7421 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-19 08:58:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:37,107 INFO L93 Difference]: Finished difference Result 5101 states and 7447 transitions. [2024-11-19 08:58:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 08:58:37,108 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2024-11-19 08:58:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:37,116 INFO L225 Difference]: With dead ends: 5101 [2024-11-19 08:58:37,116 INFO L226 Difference]: Without dead ends: 5097 [2024-11-19 08:58:37,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 08:58:37,117 INFO L432 NwaCegarLoop]: 2121 mSDtfsCounter, 14 mSDsluCounter, 12700 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14821 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:37,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14821 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:58:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2024-11-19 08:58:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5095. [2024-11-19 08:58:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 4218 states have (on average 1.7406353722143195) internal successors, (7342), 5051 states have internal predecessors, (7342), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-19 08:58:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 7433 transitions. [2024-11-19 08:58:37,188 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 7433 transitions. Word has length 80 [2024-11-19 08:58:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:37,188 INFO L471 AbstractCegarLoop]: Abstraction has 5095 states and 7433 transitions. [2024-11-19 08:58:37,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 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-19 08:58:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 7433 transitions. [2024-11-19 08:58:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 08:58:37,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:37,189 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] [2024-11-19 08:58:37,200 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 (31)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:37,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:37,390 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:37,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash -526875449, now seen corresponding path program 3 times [2024-11-19 08:58:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256153832] [2024-11-19 08:58:37,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 08:58:37,391 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-19 08:58:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:37,393 INFO L229 MonitoredProcess]: Starting monitored process 32 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-19 08:58:37,394 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 (32)] Waiting until timeout for monitored process [2024-11-19 08:58:38,020 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 08:58:38,020 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:58:38,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 08:58:38,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:38,129 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-19 08:58:38,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:38,464 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-19 08:58:38,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:38,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256153832] [2024-11-19 08:58:38,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256153832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:58:38,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:38,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 08:58:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537643766] [2024-11-19 08:58:38,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:38,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 08:58:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:38,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 08:58:38,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 08:58:38,465 INFO L87 Difference]: Start difference. First operand 5095 states and 7433 transitions. Second operand has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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-19 08:58:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:39,660 INFO L93 Difference]: Finished difference Result 5119 states and 7472 transitions. [2024-11-19 08:58:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 08:58:39,661 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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 86 [2024-11-19 08:58:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:39,667 INFO L225 Difference]: With dead ends: 5119 [2024-11-19 08:58:39,667 INFO L226 Difference]: Without dead ends: 5113 [2024-11-19 08:58:39,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 08:58:39,668 INFO L432 NwaCegarLoop]: 2122 mSDtfsCounter, 26 mSDsluCounter, 25412 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27534 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:39,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27534 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:58:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2024-11-19 08:58:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 5113. [2024-11-19 08:58:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 4236 states have (on average 1.7386685552407932) internal successors, (7365), 5069 states have internal predecessors, (7365), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-19 08:58:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 7456 transitions. [2024-11-19 08:58:39,703 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 7456 transitions. Word has length 86 [2024-11-19 08:58:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:39,704 INFO L471 AbstractCegarLoop]: Abstraction has 5113 states and 7456 transitions. [2024-11-19 08:58:39,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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-19 08:58:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 7456 transitions. [2024-11-19 08:58:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 08:58:39,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:39,705 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] [2024-11-19 08:58:39,713 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 (32)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:39,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:39,906 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:39,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1750558073, now seen corresponding path program 4 times [2024-11-19 08:58:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:39,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698191745] [2024-11-19 08:58:39,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 08:58:39,907 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-19 08:58:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:39,909 INFO L229 MonitoredProcess]: Starting monitored process 33 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-19 08:58:39,910 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 (33)] Waiting until timeout for monitored process [2024-11-19 08:58:40,339 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 08:58:40,339 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:58:40,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 08:58:40,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:40,620 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-19 08:58:40,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:41,585 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-19 08:58:41,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698191745] [2024-11-19 08:58:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698191745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:58:41,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 08:58:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039582922] [2024-11-19 08:58:41,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 08:58:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 08:58:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 08:58:41,588 INFO L87 Difference]: Start difference. First operand 5113 states and 7456 transitions. Second operand has 50 states, 50 states have (on average 2.42) internal successors, (121), 50 states have internal predecessors, (121), 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-19 08:58:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:45,597 INFO L93 Difference]: Finished difference Result 5153 states and 7532 transitions. [2024-11-19 08:58:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 08:58:45,598 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 50 states have internal predecessors, (121), 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 98 [2024-11-19 08:58:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:45,604 INFO L225 Difference]: With dead ends: 5153 [2024-11-19 08:58:45,604 INFO L226 Difference]: Without dead ends: 5149 [2024-11-19 08:58:45,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 08:58:45,606 INFO L432 NwaCegarLoop]: 2121 mSDtfsCounter, 49 mSDsluCounter, 48695 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 50816 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:45,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 50816 Invalid, 2148 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [119 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 08:58:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5149 states. [2024-11-19 08:58:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5149 to 5147. [2024-11-19 08:58:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5147 states, 4270 states have (on average 1.7355971896955504) internal successors, (7411), 5103 states have internal predecessors, (7411), 43 states have call successors, (43), 4 states have call predecessors, (43), 5 states have return successors, (48), 40 states have call predecessors, (48), 43 states have call successors, (48) [2024-11-19 08:58:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7502 transitions. [2024-11-19 08:58:45,641 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7502 transitions. Word has length 98 [2024-11-19 08:58:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:45,642 INFO L471 AbstractCegarLoop]: Abstraction has 5147 states and 7502 transitions. [2024-11-19 08:58:45,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 50 states have internal predecessors, (121), 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-19 08:58:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7502 transitions. [2024-11-19 08:58:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 08:58:45,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:45,643 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] [2024-11-19 08:58:45,655 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 (33)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:45,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-19 08:58:45,843 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 08:58:45,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1616266855, now seen corresponding path program 5 times [2024-11-19 08:58:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:45,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126320617] [2024-11-19 08:58:45,844 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 08:58:45,845 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-19 08:58:45,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:45,846 INFO L229 MonitoredProcess]: Starting monitored process 34 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-19 08:58:45,846 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 (34)] Waiting until timeout for monitored process [2024-11-19 08:58:46,911 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 08:58:46,911 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:58:46,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 08:58:46,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:46,943 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-19 08:58:47,022 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 08:58:47,023 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-19 08:58:47,038 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-19 08:58:47,089 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-19 08:58:47,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:47,699 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-19 08:58:47,724 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-19 08:58:47,746 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-19 08:58:47,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:48,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126320617] [2024-11-19 08:58:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126320617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1353308919] [2024-11-19 08:58:48,003 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 08:58:48,004 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 08:58:48,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 08:58:48,005 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 08:58:48,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process