./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_OAT_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:11:59,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:11:59,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:11:59,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:11:59,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:11:59,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:11:59,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:11:59,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:11:59,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:11:59,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:11:59,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:11:59,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:11:59,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:11:59,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:11:59,521 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:11:59,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:11:59,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:11:59,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:11:59,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:11:59,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:11:59,523 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:11:59,525 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:11:59,526 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:11:59,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:11:59,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:11:59,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:11:59,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:11:59,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:11:59,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:11:59,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:11:59,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:11:59,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:11:59,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:11:59,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:11:59,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:11:59,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:11:59,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:11:59,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:11:59,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:11:59,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:11:59,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:11:59,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:11:59,531 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 -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2024-11-09 10:11:59,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:11:59,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:11:59,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:11:59,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:11:59,784 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:11:59,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-11-09 10:12:01,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:12:01,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:12:01,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-11-09 10:12:01,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e176cc01e/d2a0a3bf2dc048f8bf40d78ebbf6cdb0/FLAGfcb78ed28 [2024-11-09 10:12:01,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e176cc01e/d2a0a3bf2dc048f8bf40d78ebbf6cdb0 [2024-11-09 10:12:01,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:12:01,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:12:01,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:01,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:12:01,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:12:01,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:01" (1/1) ... [2024-11-09 10:12:01,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c24b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:01, skipping insertion in model container [2024-11-09 10:12:01,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:01" (1/1) ... [2024-11-09 10:12:01,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:12:02,249 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-09 10:12:02,270 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-09 10:12:02,273 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-09 10:12:02,276 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-09 10:12:02,284 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-09 10:12:02,314 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-09 10:12:02,315 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-09 10:12:02,317 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-09 10:12:02,318 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-09 10:12:02,320 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-09 10:12:02,322 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-09 10:12:02,324 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-09 10:12:02,325 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-09 10:12:02,326 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-09 10:12:02,329 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-09 10:12:02,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:02,349 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-09 10:12:02,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@11a43ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:02, skipping insertion in model container [2024-11-09 10:12:02,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:02,351 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:12:02,353 INFO L158 Benchmark]: Toolchain (without parser) took 700.50ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 69.9MB in the beginning and 131.9MB in the end (delta: -62.0MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-09 10:12:02,353 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 146.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:12:02,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 698.60ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 69.8MB in the beginning and 131.9MB in the end (delta: -62.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-09 10:12:02,355 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.16ms. Allocated memory is still 146.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 698.60ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 69.8MB in the beginning and 131.9MB in the end (delta: -62.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: 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_OAT_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:12:04,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:12:04,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:12:04,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:12:04,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:12:04,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:12:04,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:12:04,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:12:04,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:12:04,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:12:04,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:12:04,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:12:04,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:12:04,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:12:04,134 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:12:04,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:12:04,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:12:04,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:12:04,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:12:04,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:12:04,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:12:04,139 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:12:04,139 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:12:04,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:12:04,140 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:12:04,142 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:12:04,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:12:04,143 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:12:04,143 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:12:04,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:12:04,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:12:04,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:12:04,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:12:04,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:12:04,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:12:04,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:04,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:12:04,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:12:04,145 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:12:04,145 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:12:04,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:12:04,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:12:04,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:12:04,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:12:04,147 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 -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2024-11-09 10:12:04,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:12:04,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:12:04,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:12:04,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:12:04,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:12:04,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-11-09 10:12:05,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:12:06,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:12:06,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2024-11-09 10:12:06,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853fc42f4/bc8b78f44cbe4904a2a7fc0500cb0b80/FLAGeeefc49d7 [2024-11-09 10:12:06,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853fc42f4/bc8b78f44cbe4904a2a7fc0500cb0b80 [2024-11-09 10:12:06,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:12:06,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:12:06,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:06,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:12:06,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:12:06,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:06" (1/1) ... [2024-11-09 10:12:06,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d80c084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:06, skipping insertion in model container [2024-11-09 10:12:06,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:06" (1/1) ... [2024-11-09 10:12:06,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:12:06,838 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-09 10:12:06,861 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-09 10:12:06,866 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-09 10:12:06,871 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-09 10:12:06,878 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-09 10:12:06,893 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-09 10:12:06,894 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-09 10:12:06,896 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-09 10:12:06,896 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-09 10:12:06,897 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-09 10:12:06,898 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-09 10:12:06,899 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-09 10:12:06,900 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-09 10:12:06,901 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-09 10:12:06,903 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-09 10:12:06,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:06,922 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:12:06,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:12:06,996 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-09 10:12:07,004 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-09 10:12:07,006 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-09 10:12:07,007 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-09 10:12:07,010 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-09 10:12:07,023 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-09 10:12:07,024 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-09 10:12:07,026 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-09 10:12:07,028 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-09 10:12:07,029 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-09 10:12:07,030 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-09 10:12:07,031 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-09 10:12:07,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-09 10:12:07,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-09 10:12:07,039 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-09 10:12:07,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:07,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:12:07,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:07,201 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:12:07,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07 WrapperNode [2024-11-09 10:12:07,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:07,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:12:07,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:12:07,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:12:07,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,350 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3062 [2024-11-09 10:12:07,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:12:07,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:12:07,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:12:07,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:12:07,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,453 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-09 10:12:07,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:12:07,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:12:07,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:12:07,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:12:07,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (1/1) ... [2024-11-09 10:12:07,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:07,622 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-09 10:12:07,628 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-09 10:12:07,665 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:12:07,666 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:12:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:12:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:12:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:12:07,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:12:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:12:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:12:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:12:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:12:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:12:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:12:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:12:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:12:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:12:07,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:12:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:12:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:12:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:12:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:12:07,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:12:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:12:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:12:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:12:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:12:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:12:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:12:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:12:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:12:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:12:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:12:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:12:07,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:12:07,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:12:07,851 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:12:07,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:12:07,875 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:07,930 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:07,953 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:12,172 INFO L? ?]: Removed 1596 outVars from TransFormulas that were not future-live. [2024-11-09 10:12:12,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:12:12,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:12:12,228 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 10:12:12,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:12:12 BoogieIcfgContainer [2024-11-09 10:12:12,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:12:12,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:12:12,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:12:12,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:12:12,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:12:06" (1/3) ... [2024-11-09 10:12:12,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3319daf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:12:12, skipping insertion in model container [2024-11-09 10:12:12,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:07" (2/3) ... [2024-11-09 10:12:12,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3319daf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:12:12, skipping insertion in model container [2024-11-09 10:12:12,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:12:12" (3/3) ... [2024-11-09 10:12:12,236 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-2.i [2024-11-09 10:12:12,250 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:12:12,251 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-09 10:12:12,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:12:12,329 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;@2136955a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:12:12,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-09 10:12:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-09 10:12:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:12:12,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:12,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:12:12,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-09 10:12:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356118780] [2024-11-09 10:12:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:12,357 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-09 10:12:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:12,358 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-09 10:12:12,359 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-09 10:12:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:12,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:12:12,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:12,501 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-09 10:12:12,517 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-09 10:12:12,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:12,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:12,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356118780] [2024-11-09 10:12:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356118780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:12,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807041712] [2024-11-09 10:12:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:12,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:12,556 INFO L87 Difference]: Start difference. First operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 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-09 10:12:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:14,755 INFO L93 Difference]: Finished difference Result 2238 states and 3305 transitions. [2024-11-09 10:12:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:14,757 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-09 10:12:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:14,791 INFO L225 Difference]: With dead ends: 2238 [2024-11-09 10:12:14,791 INFO L226 Difference]: Without dead ends: 2236 [2024-11-09 10:12:14,792 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-09 10:12:14,795 INFO L432 NwaCegarLoop]: 2640 mSDtfsCounter, 1973 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:14,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 2796 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:12:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2024-11-09 10:12:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2057. [2024-11-09 10:12:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 1040 states have (on average 2.0259615384615386) internal successors, (2107), 2050 states have internal predecessors, (2107), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 10:12:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3115 transitions. [2024-11-09 10:12:15,052 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3115 transitions. Word has length 3 [2024-11-09 10:12:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:15,052 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 3115 transitions. [2024-11-09 10:12:15,053 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-09 10:12:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3115 transitions. [2024-11-09 10:12:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:12:15,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:15,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:12:15,061 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-09 10:12:15,255 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-09 10:12:15,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:15,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-09 10:12:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771522171] [2024-11-09 10:12:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:15,257 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-09 10:12:15,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:15,258 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-09 10:12:15,272 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-09 10:12:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:15,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:12:15,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:15,371 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-09 10:12:15,381 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-09 10:12:15,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:15,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771522171] [2024-11-09 10:12:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771522171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:15,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554431508] [2024-11-09 10:12:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:15,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:15,384 INFO L87 Difference]: Start difference. First operand 2057 states and 3115 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-09 10:12:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:17,996 INFO L93 Difference]: Finished difference Result 3474 states and 5565 transitions. [2024-11-09 10:12:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:17,996 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-09 10:12:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:18,012 INFO L225 Difference]: With dead ends: 3474 [2024-11-09 10:12:18,013 INFO L226 Difference]: Without dead ends: 3474 [2024-11-09 10:12:18,013 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-09 10:12:18,014 INFO L432 NwaCegarLoop]: 3017 mSDtfsCounter, 1449 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:18,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5104 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:12:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2024-11-09 10:12:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3185. [2024-11-09 10:12:18,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 1669 states have (on average 2.0029958058717794) internal successors, (3343), 3178 states have internal predecessors, (3343), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 5351 transitions. [2024-11-09 10:12:18,256 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 5351 transitions. Word has length 3 [2024-11-09 10:12:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:18,257 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 5351 transitions. [2024-11-09 10:12:18,257 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-09 10:12:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 5351 transitions. [2024-11-09 10:12:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 10:12:18,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:18,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:18,265 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-09 10:12:18,459 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-09 10:12:18,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:18,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-09 10:12:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:18,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718506694] [2024-11-09 10:12:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:18,460 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-09 10:12:18,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:18,466 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-09 10:12:18,467 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-09 10:12:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:18,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:12:18,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:18,602 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-09 10:12:18,610 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-09 10:12:18,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:12:18,669 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-09 10:12:18,686 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:12:18,686 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-09 10:12:18,716 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-09 10:12:18,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:18,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:18,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718506694] [2024-11-09 10:12:18,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718506694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:18,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:18,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:18,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16364360] [2024-11-09 10:12:18,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:18,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:18,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:18,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:18,718 INFO L87 Difference]: Start difference. First operand 3185 states and 5351 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-09 10:12:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:21,432 INFO L93 Difference]: Finished difference Result 3353 states and 5527 transitions. [2024-11-09 10:12:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:21,432 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-09 10:12:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:21,444 INFO L225 Difference]: With dead ends: 3353 [2024-11-09 10:12:21,444 INFO L226 Difference]: Without dead ends: 3353 [2024-11-09 10:12:21,445 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-09 10:12:21,445 INFO L432 NwaCegarLoop]: 2371 mSDtfsCounter, 2257 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:21,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 2471 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 10:12:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2024-11-09 10:12:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2045. [2024-11-09 10:12:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 1040 states have (on average 2.0134615384615384) internal successors, (2094), 2038 states have internal predecessors, (2094), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 10:12:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 3102 transitions. [2024-11-09 10:12:21,663 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 3102 transitions. Word has length 7 [2024-11-09 10:12:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:21,665 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 3102 transitions. [2024-11-09 10:12:21,665 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-09 10:12:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 3102 transitions. [2024-11-09 10:12:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:12:21,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:21,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:21,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:21,866 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-09 10:12:21,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:21,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-09 10:12:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66961635] [2024-11-09 10:12:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:21,868 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-09 10:12:21,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:21,870 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-09 10:12:21,871 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-09 10:12:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:21,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:12:21,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:21,959 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-09 10:12:21,977 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-09 10:12:21,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:21,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:21,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66961635] [2024-11-09 10:12:21,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66961635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:21,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:21,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823403105] [2024-11-09 10:12:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:21,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:21,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:21,981 INFO L87 Difference]: Start difference. First operand 2045 states and 3102 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-09 10:12:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:24,345 INFO L93 Difference]: Finished difference Result 3338 states and 5424 transitions. [2024-11-09 10:12:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:24,346 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-09 10:12:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:24,359 INFO L225 Difference]: With dead ends: 3338 [2024-11-09 10:12:24,360 INFO L226 Difference]: Without dead ends: 3338 [2024-11-09 10:12:24,361 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-09 10:12:24,362 INFO L432 NwaCegarLoop]: 4987 mSDtfsCounter, 1505 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 7415 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:24,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 7415 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:12:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2024-11-09 10:12:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2072. [2024-11-09 10:12:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1077 states have (on average 2.007428040854225) internal successors, (2162), 2065 states have internal predecessors, (2162), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 10:12:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3170 transitions. [2024-11-09 10:12:24,541 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3170 transitions. Word has length 8 [2024-11-09 10:12:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:24,541 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3170 transitions. [2024-11-09 10:12:24,541 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-09 10:12:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3170 transitions. [2024-11-09 10:12:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:12:24,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:24,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:24,549 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-09 10:12:24,742 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-09 10:12:24,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-09 10:12:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645386983] [2024-11-09 10:12:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:24,744 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-09 10:12:24,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:24,745 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-09 10:12:24,746 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-09 10:12:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:24,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:12:24,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:24,832 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-09 10:12:24,840 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-09 10:12:24,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:24,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:24,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645386983] [2024-11-09 10:12:24,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645386983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:24,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892081916] [2024-11-09 10:12:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:24,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:24,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:24,843 INFO L87 Difference]: Start difference. First operand 2072 states and 3170 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-09 10:12:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:26,600 INFO L93 Difference]: Finished difference Result 3242 states and 5358 transitions. [2024-11-09 10:12:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:26,600 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-09 10:12:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:26,611 INFO L225 Difference]: With dead ends: 3242 [2024-11-09 10:12:26,611 INFO L226 Difference]: Without dead ends: 3242 [2024-11-09 10:12:26,611 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-09 10:12:26,612 INFO L432 NwaCegarLoop]: 4761 mSDtfsCounter, 1754 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 7020 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:26,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 7020 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:12:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2024-11-09 10:12:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2025. [2024-11-09 10:12:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1077 states have (on average 1.9600742804085423) internal successors, (2111), 2018 states have internal predecessors, (2111), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 10:12:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 3119 transitions. [2024-11-09 10:12:26,801 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 3119 transitions. Word has length 8 [2024-11-09 10:12:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:26,802 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 3119 transitions. [2024-11-09 10:12:26,802 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-09 10:12:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 3119 transitions. [2024-11-09 10:12:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 10:12:26,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:26,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:26,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:12:27,005 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-09 10:12:27,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:27,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash -282866277, now seen corresponding path program 1 times [2024-11-09 10:12:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:27,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984243737] [2024-11-09 10:12:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:27,007 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-09 10:12:27,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:27,009 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-09 10:12:27,010 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-09 10:12:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:27,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:12:27,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:27,138 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-09 10:12:27,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:27,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984243737] [2024-11-09 10:12:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984243737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:27,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:27,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:27,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893043855] [2024-11-09 10:12:27,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:27,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:27,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:27,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:27,139 INFO L87 Difference]: Start difference. First operand 2025 states and 3119 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-09 10:12:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:27,358 INFO L93 Difference]: Finished difference Result 3470 states and 5620 transitions. [2024-11-09 10:12:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:27,359 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-09 10:12:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:27,370 INFO L225 Difference]: With dead ends: 3470 [2024-11-09 10:12:27,371 INFO L226 Difference]: Without dead ends: 3470 [2024-11-09 10:12:27,371 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-09 10:12:27,372 INFO L432 NwaCegarLoop]: 3105 mSDtfsCounter, 1471 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:27,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 6058 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:12:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2024-11-09 10:12:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3202. [2024-11-09 10:12:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 1754 states have (on average 1.944697833523375) internal successors, (3411), 3195 states have internal predecessors, (3411), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5419 transitions. [2024-11-09 10:12:27,579 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5419 transitions. Word has length 11 [2024-11-09 10:12:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:27,580 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 5419 transitions. [2024-11-09 10:12:27,581 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-09 10:12:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5419 transitions. [2024-11-09 10:12:27,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:12:27,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:27,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:27,591 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-09 10:12:27,782 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-09 10:12:27,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:27,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-09 10:12:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331986402] [2024-11-09 10:12:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:27,784 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-09 10:12:27,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:27,786 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-09 10:12:27,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 (8)] Waiting until timeout for monitored process [2024-11-09 10:12:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:27,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:12:27,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:27,889 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-09 10:12:27,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:27,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:27,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331986402] [2024-11-09 10:12:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331986402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480678224] [2024-11-09 10:12:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:27,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:27,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:27,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:27,890 INFO L87 Difference]: Start difference. First operand 3202 states and 5419 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:27,973 INFO L93 Difference]: Finished difference Result 3142 states and 5333 transitions. [2024-11-09 10:12:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:27,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:12:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:27,986 INFO L225 Difference]: With dead ends: 3142 [2024-11-09 10:12:27,987 INFO L226 Difference]: Without dead ends: 3142 [2024-11-09 10:12:27,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:27,988 INFO L432 NwaCegarLoop]: 2982 mSDtfsCounter, 71 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5901 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-09 10:12:27,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5901 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-11-09 10:12:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3142. [2024-11-09 10:12:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 1718 states have (on average 1.9353899883585564) internal successors, (3325), 3135 states have internal predecessors, (3325), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 5333 transitions. [2024-11-09 10:12:28,187 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 5333 transitions. Word has length 13 [2024-11-09 10:12:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:28,188 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 5333 transitions. [2024-11-09 10:12:28,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 5333 transitions. [2024-11-09 10:12:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:12:28,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:28,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:28,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:28,389 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-09 10:12:28,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:28,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -133316320, now seen corresponding path program 1 times [2024-11-09 10:12:28,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736747033] [2024-11-09 10:12:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:28,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-09 10:12:28,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:28,394 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-09 10:12:28,395 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-09 10:12:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:28,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:12:28,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:28,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:12:28,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:12:28,545 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-09 10:12:28,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:12:28,577 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-09 10:12:28,592 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-09 10:12:28,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:28,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:28,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736747033] [2024-11-09 10:12:28,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736747033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:28,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:28,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055447161] [2024-11-09 10:12:28,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:28,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:28,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:28,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:28,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:28,594 INFO L87 Difference]: Start difference. First operand 3142 states and 5333 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09 10:12:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:29,861 INFO L93 Difference]: Finished difference Result 5952 states and 10146 transitions. [2024-11-09 10:12:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:29,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-09 10:12:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:29,883 INFO L225 Difference]: With dead ends: 5952 [2024-11-09 10:12:29,884 INFO L226 Difference]: Without dead ends: 5952 [2024-11-09 10:12:29,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-09 10:12:29,884 INFO L432 NwaCegarLoop]: 3446 mSDtfsCounter, 1924 mSDsluCounter, 5906 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 9352 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:29,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 9352 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:12:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2024-11-09 10:12:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3141. [2024-11-09 10:12:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 1717 states have (on average 1.9353523587652883) internal successors, (3323), 3134 states have internal predecessors, (3323), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5331 transitions. [2024-11-09 10:12:30,224 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5331 transitions. Word has length 14 [2024-11-09 10:12:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:30,225 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5331 transitions. [2024-11-09 10:12:30,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09 10:12:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5331 transitions. [2024-11-09 10:12:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 10:12:30,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:30,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:30,231 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-09 10:12:30,426 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-09 10:12:30,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-09 10:12:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810199954] [2024-11-09 10:12:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:30,428 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-09 10:12:30,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:30,429 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-09 10:12:30,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:12:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:30,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:12:30,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:30,560 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-09 10:12:30,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:30,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:30,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810199954] [2024-11-09 10:12:30,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810199954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:30,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:30,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331126784] [2024-11-09 10:12:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:30,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:30,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:30,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:30,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:30,563 INFO L87 Difference]: Start difference. First operand 3141 states and 5331 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:30,601 INFO L93 Difference]: Finished difference Result 3081 states and 5245 transitions. [2024-11-09 10:12:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 10:12:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:30,609 INFO L225 Difference]: With dead ends: 3081 [2024-11-09 10:12:30,610 INFO L226 Difference]: Without dead ends: 3081 [2024-11-09 10:12:30,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-09 10:12:30,610 INFO L432 NwaCegarLoop]: 2939 mSDtfsCounter, 71 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5815 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-09 10:12:30,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5815 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2024-11-09 10:12:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3081. [2024-11-09 10:12:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 1681 states have (on average 1.925639500297442) internal successors, (3237), 3074 states have internal predecessors, (3237), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 5245 transitions. [2024-11-09 10:12:30,816 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 5245 transitions. Word has length 18 [2024-11-09 10:12:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:30,817 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 5245 transitions. [2024-11-09 10:12:30,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 5245 transitions. [2024-11-09 10:12:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 10:12:30,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:30,818 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-09 10:12:30,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:31,021 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-09 10:12:31,022 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:31,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-09 10:12:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666123352] [2024-11-09 10:12:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:31,023 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-09 10:12:31,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:31,024 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-09 10:12:31,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:12:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:31,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:12:31,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:31,184 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-09 10:12:31,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:31,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:31,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666123352] [2024-11-09 10:12:31,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666123352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038769778] [2024-11-09 10:12:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:31,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:31,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:31,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:31,186 INFO L87 Difference]: Start difference. First operand 3081 states and 5245 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-09 10:12:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:31,254 INFO L93 Difference]: Finished difference Result 3051 states and 5187 transitions. [2024-11-09 10:12:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:12:31,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-09 10:12:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:31,263 INFO L225 Difference]: With dead ends: 3051 [2024-11-09 10:12:31,263 INFO L226 Difference]: Without dead ends: 3051 [2024-11-09 10:12:31,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-09 10:12:31,264 INFO L432 NwaCegarLoop]: 2894 mSDtfsCounter, 48 mSDsluCounter, 5762 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8656 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-09 10:12:31,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8656 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2024-11-09 10:12:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3051. [2024-11-09 10:12:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3051 states, 1665 states have (on average 1.9093093093093092) internal successors, (3179), 3044 states have internal predecessors, (3179), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:31,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 5187 transitions. [2024-11-09 10:12:31,457 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 5187 transitions. Word has length 20 [2024-11-09 10:12:31,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:31,457 INFO L471 AbstractCegarLoop]: Abstraction has 3051 states and 5187 transitions. [2024-11-09 10:12:31,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-09 10:12:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 5187 transitions. [2024-11-09 10:12:31,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 10:12:31,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:31,458 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] [2024-11-09 10:12:31,464 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-09 10:12:31,662 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-09 10:12:31,662 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:31,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-09 10:12:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:31,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226552069] [2024-11-09 10:12:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:31,663 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-09 10:12:31,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:31,664 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-09 10:12:31,665 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-09 10:12:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:31,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:12:31,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:31,848 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-09 10:12:31,928 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-09 10:12:31,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:31,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226552069] [2024-11-09 10:12:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226552069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:31,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296541865] [2024-11-09 10:12:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:31,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:31,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:31,931 INFO L87 Difference]: Start difference. First operand 3051 states and 5187 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:12:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:34,932 INFO L93 Difference]: Finished difference Result 3055 states and 5187 transitions. [2024-11-09 10:12:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:34,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-09 10:12:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:34,966 INFO L225 Difference]: With dead ends: 3055 [2024-11-09 10:12:34,966 INFO L226 Difference]: Without dead ends: 3055 [2024-11-09 10:12:34,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-09 10:12:34,967 INFO L432 NwaCegarLoop]: 2580 mSDtfsCounter, 1644 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 4124 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:34,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 4124 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 10:12:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-11-09 10:12:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3047. [2024-11-09 10:12:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 1665 states have (on average 1.9045045045045046) internal successors, (3171), 3040 states have internal predecessors, (3171), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 5179 transitions. [2024-11-09 10:12:35,138 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 5179 transitions. Word has length 34 [2024-11-09 10:12:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:35,139 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 5179 transitions. [2024-11-09 10:12:35,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:12:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 5179 transitions. [2024-11-09 10:12:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 10:12:35,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:35,141 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] [2024-11-09 10:12:35,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:35,344 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-09 10:12:35,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:35,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-09 10:12:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:35,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915817182] [2024-11-09 10:12:35,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:35,347 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-09 10:12:35,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:35,348 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-09 10:12:35,349 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-09 10:12:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:35,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:12:35,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:35,490 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-09 10:12:35,652 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-09 10:12:35,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:35,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:35,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915817182] [2024-11-09 10:12:35,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915817182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:35,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:35,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680241383] [2024-11-09 10:12:35,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:35,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:35,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:35,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:35,654 INFO L87 Difference]: Start difference. First operand 3047 states and 5179 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:12:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:39,437 INFO L93 Difference]: Finished difference Result 5346 states and 9500 transitions. [2024-11-09 10:12:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:39,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-09 10:12:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:39,451 INFO L225 Difference]: With dead ends: 5346 [2024-11-09 10:12:39,451 INFO L226 Difference]: Without dead ends: 5346 [2024-11-09 10:12:39,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-09 10:12:39,452 INFO L432 NwaCegarLoop]: 4937 mSDtfsCounter, 1391 mSDsluCounter, 5926 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 10863 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:39,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 10863 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 10:12:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2024-11-09 10:12:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 3043. [2024-11-09 10:12:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 1665 states have (on average 1.8996996996996998) internal successors, (3163), 3036 states have internal predecessors, (3163), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 5171 transitions. [2024-11-09 10:12:39,817 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 5171 transitions. Word has length 34 [2024-11-09 10:12:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:39,818 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 5171 transitions. [2024-11-09 10:12:39,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-09 10:12:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 5171 transitions. [2024-11-09 10:12:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 10:12:39,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:39,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, 1, 1, 1, 1, 1, 1, 1, 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-09 10:12:39,828 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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:40,019 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-09 10:12:40,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:40,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-09 10:12:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311054054] [2024-11-09 10:12:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:40,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-09 10:12:40,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:40,023 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-09 10:12:40,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 (14)] Waiting until timeout for monitored process [2024-11-09 10:12:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:40,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:12:40,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:40,226 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-09 10:12:40,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:40,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311054054] [2024-11-09 10:12:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311054054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:40,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:40,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:40,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178485092] [2024-11-09 10:12:40,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:40,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:40,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:40,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:40,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:40,228 INFO L87 Difference]: Start difference. First operand 3043 states and 5171 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 10:12:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:40,288 INFO L93 Difference]: Finished difference Result 3031 states and 5151 transitions. [2024-11-09 10:12:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:12:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-11-09 10:12:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:40,295 INFO L225 Difference]: With dead ends: 3031 [2024-11-09 10:12:40,295 INFO L226 Difference]: Without dead ends: 3031 [2024-11-09 10:12:40,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-09 10:12:40,298 INFO L432 NwaCegarLoop]: 2888 mSDtfsCounter, 21 mSDsluCounter, 5745 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8633 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-09 10:12:40,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8633 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2024-11-09 10:12:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 3031. [2024-11-09 10:12:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 1653 states have (on average 1.9013914095583786) internal successors, (3143), 3024 states have internal predecessors, (3143), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 5151 transitions. [2024-11-09 10:12:40,469 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 5151 transitions. Word has length 53 [2024-11-09 10:12:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:40,471 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 5151 transitions. [2024-11-09 10:12:40,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 10:12:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 5151 transitions. [2024-11-09 10:12:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 10:12:40,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:40,474 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] [2024-11-09 10:12:40,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:40,674 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-09 10:12:40,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-09 10:12:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:40,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562845273] [2024-11-09 10:12:40,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:40,676 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-09 10:12:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:40,679 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-09 10:12:40,680 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-09 10:12:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:40,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:12:40,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:40,948 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-09 10:12:40,954 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-09 10:12:41,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:12:41,337 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-09 10:12:41,348 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:12:41,349 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-09 10:12:41,358 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-09 10:12:41,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:41,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:41,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562845273] [2024-11-09 10:12:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562845273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701278304] [2024-11-09 10:12:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:41,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:41,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:41,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:41,360 INFO L87 Difference]: Start difference. First operand 3031 states and 5151 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-09 10:12:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:43,265 INFO L93 Difference]: Finished difference Result 2993 states and 5113 transitions. [2024-11-09 10:12:43,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:43,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-09 10:12:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:43,273 INFO L225 Difference]: With dead ends: 2993 [2024-11-09 10:12:43,273 INFO L226 Difference]: Without dead ends: 2993 [2024-11-09 10:12:43,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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-09 10:12:43,273 INFO L432 NwaCegarLoop]: 2459 mSDtfsCounter, 1570 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:43,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 2641 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:12:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2024-11-09 10:12:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2956. [2024-11-09 10:12:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 1616 states have (on average 1.875618811881188) internal successors, (3031), 2949 states have internal predecessors, (3031), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 5039 transitions. [2024-11-09 10:12:43,458 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 5039 transitions. Word has length 61 [2024-11-09 10:12:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:43,459 INFO L471 AbstractCegarLoop]: Abstraction has 2956 states and 5039 transitions. [2024-11-09 10:12:43,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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-09 10:12:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 5039 transitions. [2024-11-09 10:12:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 10:12:43,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:43,461 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] [2024-11-09 10:12:43,469 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-09 10:12:43,661 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-09 10:12:43,662 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:43,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-09 10:12:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921364335] [2024-11-09 10:12:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:43,664 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-09 10:12:43,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:43,666 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-09 10:12:43,669 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-09 10:12:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:43,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:12:43,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:43,885 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-09 10:12:43,900 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-09 10:12:43,917 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-09 10:12:43,925 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-09 10:12:43,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:43,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:43,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921364335] [2024-11-09 10:12:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921364335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:43,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:43,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789306006] [2024-11-09 10:12:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:43,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:12:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:43,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:12:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:12:43,927 INFO L87 Difference]: Start difference. First operand 2956 states and 5039 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:45,373 INFO L93 Difference]: Finished difference Result 2955 states and 5038 transitions. [2024-11-09 10:12:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:45,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-09 10:12:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:45,380 INFO L225 Difference]: With dead ends: 2955 [2024-11-09 10:12:45,380 INFO L226 Difference]: Without dead ends: 2955 [2024-11-09 10:12:45,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-09 10:12:45,381 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 2 mSDsluCounter, 7372 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10233 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:45,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10233 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:12:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2024-11-09 10:12:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2024-11-09 10:12:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 1616 states have (on average 1.875) internal successors, (3030), 2948 states have internal predecessors, (3030), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 5038 transitions. [2024-11-09 10:12:45,568 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 5038 transitions. Word has length 66 [2024-11-09 10:12:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:45,570 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 5038 transitions. [2024-11-09 10:12:45,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 5038 transitions. [2024-11-09 10:12:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 10:12:45,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:45,571 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] [2024-11-09 10:12:45,580 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:45,771 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-09 10:12:45,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:45,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-09 10:12:45,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:45,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552453931] [2024-11-09 10:12:45,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:45,773 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-09 10:12:45,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:45,774 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-09 10:12:45,776 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-09 10:12:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:45,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:12:45,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:45,994 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-09 10:12:46,015 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-09 10:12:46,026 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-09 10:12:46,054 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-09 10:12:46,067 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-09 10:12:46,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:46,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552453931] [2024-11-09 10:12:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552453931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:46,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:46,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:46,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415538313] [2024-11-09 10:12:46,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:46,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:12:46,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:46,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:12:46,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:12:46,069 INFO L87 Difference]: Start difference. First operand 2955 states and 5038 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:47,800 INFO L93 Difference]: Finished difference Result 2954 states and 5037 transitions. [2024-11-09 10:12:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-09 10:12:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:47,807 INFO L225 Difference]: With dead ends: 2954 [2024-11-09 10:12:47,807 INFO L226 Difference]: Without dead ends: 2954 [2024-11-09 10:12:47,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 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-09 10:12:47,808 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 1 mSDsluCounter, 7405 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10266 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:47,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10266 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:12:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2024-11-09 10:12:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2954. [2024-11-09 10:12:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 1615 states have (on average 1.8755417956656346) internal successors, (3029), 2947 states have internal predecessors, (3029), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 10:12:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 5037 transitions. [2024-11-09 10:12:48,012 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 5037 transitions. Word has length 66 [2024-11-09 10:12:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:48,013 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 5037 transitions. [2024-11-09 10:12:48,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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-09 10:12:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 5037 transitions. [2024-11-09 10:12:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 10:12:48,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:48,014 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] [2024-11-09 10:12:48,023 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-09 10:12:48,214 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-09 10:12:48,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:48,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash -620255098, now seen corresponding path program 1 times [2024-11-09 10:12:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:48,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007759627] [2024-11-09 10:12:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:48,216 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-09 10:12:48,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:48,219 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-09 10:12:48,220 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-09 10:12:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:48,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:12:48,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:48,472 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-09 10:12:48,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:12:48,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007759627] [2024-11-09 10:12:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007759627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265900975] [2024-11-09 10:12:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:48,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:48,476 INFO L87 Difference]: Start difference. First operand 2954 states and 5037 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-09 10:12:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:48,540 INFO L93 Difference]: Finished difference Result 2957 states and 5041 transitions. [2024-11-09 10:12:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:48,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-09 10:12:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:48,556 INFO L225 Difference]: With dead ends: 2957 [2024-11-09 10:12:48,556 INFO L226 Difference]: Without dead ends: 2957 [2024-11-09 10:12:48,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-09 10:12:48,557 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 0 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8578 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8578 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2024-11-09 10:12:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2024-11-09 10:12:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 1617 states have (on average 1.8750773036487323) internal successors, (3032), 2950 states have internal predecessors, (3032), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 10:12:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 5041 transitions. [2024-11-09 10:12:48,741 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 5041 transitions. Word has length 74 [2024-11-09 10:12:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:48,741 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 5041 transitions. [2024-11-09 10:12:48,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-09 10:12:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 5041 transitions. [2024-11-09 10:12:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 10:12:48,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:48,742 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] [2024-11-09 10:12:48,749 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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:48,942 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-09 10:12:48,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash 537846652, now seen corresponding path program 1 times [2024-11-09 10:12:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198692710] [2024-11-09 10:12:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:48,944 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-09 10:12:48,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:48,945 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-09 10:12:48,946 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-09 10:12:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:49,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:12:49,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:49,195 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-09 10:12:49,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:49,247 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-09 10:12:49,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:49,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198692710] [2024-11-09 10:12:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198692710] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:49,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:12:49,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872203817] [2024-11-09 10:12:49,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:49,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:12:49,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:49,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:12:49,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:12:49,249 INFO L87 Difference]: Start difference. First operand 2957 states and 5041 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 10:12:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:49,396 INFO L93 Difference]: Finished difference Result 2969 states and 5058 transitions. [2024-11-09 10:12:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:12:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 75 [2024-11-09 10:12:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:49,410 INFO L225 Difference]: With dead ends: 2969 [2024-11-09 10:12:49,411 INFO L226 Difference]: Without dead ends: 2969 [2024-11-09 10:12:49,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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-09 10:12:49,411 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 5 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14291 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:49,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14291 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:12:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2024-11-09 10:12:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2967. [2024-11-09 10:12:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 1626 states have (on average 1.8739237392373924) internal successors, (3047), 2959 states have internal predecessors, (3047), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 10:12:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 5056 transitions. [2024-11-09 10:12:49,620 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 5056 transitions. Word has length 75 [2024-11-09 10:12:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:49,620 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 5056 transitions. [2024-11-09 10:12:49,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-09 10:12:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 5056 transitions. [2024-11-09 10:12:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 10:12:49,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:49,622 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] [2024-11-09 10:12:49,633 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-09 10:12:49,827 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-09 10:12:49,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:49,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2139507194, now seen corresponding path program 2 times [2024-11-09 10:12:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:49,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958932119] [2024-11-09 10:12:49,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:12:49,829 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-09 10:12:49,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:49,832 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-09 10:12:49,833 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-09 10:12:50,265 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:12:50,266 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:12:50,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:12:50,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:50,317 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-09 10:12:50,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:50,434 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-09 10:12:50,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958932119] [2024-11-09 10:12:50,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958932119] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:50,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:50,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:12:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844573827] [2024-11-09 10:12:50,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:50,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:12:50,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:12:50,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:12:50,436 INFO L87 Difference]: Start difference. First operand 2967 states and 5056 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-09 10:12:50,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:50,784 INFO L93 Difference]: Finished difference Result 2982 states and 5078 transitions. [2024-11-09 10:12:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:12:50,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-09 10:12:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:50,795 INFO L225 Difference]: With dead ends: 2982 [2024-11-09 10:12:50,795 INFO L226 Difference]: Without dead ends: 2978 [2024-11-09 10:12:50,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 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-09 10:12:50,796 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 11 mSDsluCounter, 17150 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20011 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:50,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20011 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:12:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2024-11-09 10:12:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2024-11-09 10:12:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 1635 states have (on average 1.8709480122324158) internal successors, (3059), 2968 states have internal predecessors, (3059), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 10:12:50,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5068 transitions. [2024-11-09 10:12:50,997 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5068 transitions. Word has length 78 [2024-11-09 10:12:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:50,997 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5068 transitions. [2024-11-09 10:12:50,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-09 10:12:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5068 transitions. [2024-11-09 10:12:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 10:12:50,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:50,998 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] [2024-11-09 10:12:51,006 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-09 10:12:51,198 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-09 10:12:51,199 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:51,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash -114974138, now seen corresponding path program 3 times [2024-11-09 10:12:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97715746] [2024-11-09 10:12:51,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:12:51,200 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-09 10:12:51,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:51,203 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-09 10:12:51,206 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-09 10:12:51,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:12:51,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:12:51,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:12:51,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:51,947 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-09 10:12:51,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:52,305 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-09 10:12:52,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97715746] [2024-11-09 10:12:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97715746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:52,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:12:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901359439] [2024-11-09 10:12:52,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:52,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:12:52,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:52,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:12:52,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:12:52,307 INFO L87 Difference]: Start difference. First operand 2976 states and 5068 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-09 10:12:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:53,627 INFO L93 Difference]: Finished difference Result 3000 states and 5107 transitions. [2024-11-09 10:12:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:12:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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 84 [2024-11-09 10:12:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:53,634 INFO L225 Difference]: With dead ends: 3000 [2024-11-09 10:12:53,634 INFO L226 Difference]: Without dead ends: 2994 [2024-11-09 10:12:53,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 10:12:53,636 INFO L432 NwaCegarLoop]: 2862 mSDtfsCounter, 23 mSDsluCounter, 34307 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37169 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:53,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37169 Invalid, 611 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:12:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-11-09 10:12:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2994. [2024-11-09 10:12:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 1653 states have (on average 1.8644888082274653) internal successors, (3082), 2986 states have internal predecessors, (3082), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 10:12:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 5091 transitions. [2024-11-09 10:12:53,808 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 5091 transitions. Word has length 84 [2024-11-09 10:12:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:53,808 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 5091 transitions. [2024-11-09 10:12:53,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 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-09 10:12:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 5091 transitions. [2024-11-09 10:12:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:12:53,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:53,809 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] [2024-11-09 10:12:53,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:54,013 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-09 10:12:54,014 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:12:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1196758330, now seen corresponding path program 4 times [2024-11-09 10:12:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:12:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941547544] [2024-11-09 10:12:54,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:12:54,015 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-09 10:12:54,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:12:54,016 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-09 10:12:54,018 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-09 10:12:54,396 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:12:54,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:12:54,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:12:54,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:54,672 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-09 10:12:54,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:55,615 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-09 10:12:55,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:12:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941547544] [2024-11-09 10:12:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941547544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:12:55,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:12:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419826763] [2024-11-09 10:12:55,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:55,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:12:55,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:12:55,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:12:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:12:55,618 INFO L87 Difference]: Start difference. First operand 2994 states and 5091 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-09 10:12:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:59,833 INFO L93 Difference]: Finished difference Result 3034 states and 5163 transitions. [2024-11-09 10:12:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:12:59,834 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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 96 [2024-11-09 10:12:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:59,841 INFO L225 Difference]: With dead ends: 3034 [2024-11-09 10:12:59,841 INFO L226 Difference]: Without dead ends: 3030 [2024-11-09 10:12:59,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:12:59,844 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 47 mSDsluCounter, 74305 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 77166 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:59,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 77166 Invalid, 2003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 10:12:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-09 10:13:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3028. [2024-11-09 10:13:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1687 states have (on average 1.8541790160047422) internal successors, (3128), 3020 states have internal predecessors, (3128), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-09 10:13:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5137 transitions. [2024-11-09 10:13:00,042 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5137 transitions. Word has length 96 [2024-11-09 10:13:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:00,043 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5137 transitions. [2024-11-09 10:13:00,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 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-09 10:13:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5137 transitions. [2024-11-09 10:13:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 10:13:00,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:00,044 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] [2024-11-09 10:13:00,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:00,245 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-09 10:13:00,245 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 10:13:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1074332410, now seen corresponding path program 5 times [2024-11-09 10:13:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049775371] [2024-11-09 10:13:00,247 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:13:00,247 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-09 10:13:00,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:00,249 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-09 10:13:00,251 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-09 10:13:01,319 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:13:01,319 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:01,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 10:13:01,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:01,352 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-09 10:13:01,429 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 10:13:01,429 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-09 10:13:01,453 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-09 10:13:01,521 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-09 10:13:02,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:02,433 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-09 10:13:02,468 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-09 10:13:02,490 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-09 10:13:02,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:02,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 10:13:02,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049775371] [2024-11-09 10:13:02,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049775371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:02,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1844039538] [2024-11-09 10:13:02,776 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:13:02,776 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:13:02,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:13:02,777 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:13:02,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process