./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:03:36,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:03:36,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:03:36,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:03:36,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:03:36,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:03:36,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:03:36,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:03:36,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:03:36,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:03:36,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:03:36,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:03:36,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:03:36,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:03:36,662 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:03:36,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:03:36,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:03:36,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:03:36,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:03:36,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:03:36,664 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:03:36,667 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:03:36,667 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:03:36,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:03:36,667 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:03:36,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:03:36,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:03:36,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:03:36,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:03:36,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:03:36,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:03:36,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:03:36,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:03:36,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:03:36,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:03:36,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:03:36,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:03:36,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:03:36,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:03:36,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:03:36,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:03:36,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:03:36,671 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-19 09:03:36,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:03:36,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:03:37,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:03:37,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:03:37,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:03:37,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-19 09:03:38,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:03:38,758 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:03:38,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-19 09:03:38,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a13ccf3/e795d5f3b0af450f9874c1d276eccbf9/FLAGc98dde562 [2024-11-19 09:03:38,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a13ccf3/e795d5f3b0af450f9874c1d276eccbf9 [2024-11-19 09:03:38,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:03:38,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:03:38,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:03:38,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:03:38,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:03:38,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:03:38" (1/1) ... [2024-11-19 09:03:38,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a814a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:38, skipping insertion in model container [2024-11-19 09:03:38,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:03:38" (1/1) ... [2024-11-19 09:03:38,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:03:39,233 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,264 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,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-19 09:03:39,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-19 09:03:39,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-19 09:03:39,307 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,335 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,341 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,341 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,343 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,344 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,345 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,346 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,348 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,351 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:39,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:03:39,380 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 09:03:39,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@575d0d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:39, skipping insertion in model container [2024-11-19 09:03:39,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:03:39,382 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:03:39,384 INFO L158 Benchmark]: Toolchain (without parser) took 595.51ms. Allocated memory is still 184.5MB. Free memory was 114.1MB in the beginning and 151.7MB in the end (delta: -37.6MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-11-19 09:03:39,384 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:03:39,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.76ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 152.5MB in the end (delta: -38.7MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-19 09:03:39,386 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.17ms. Allocated memory is still 109.1MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.76ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 152.5MB in the end (delta: -38.7MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: 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_JEN_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:03:41,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:03:41,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:03:41,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:03:41,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:03:41,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:03:41,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:03:41,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:03:41,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:03:41,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:03:41,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:03:41,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:03:41,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:03:41,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:03:41,498 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:03:41,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:03:41,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:03:41,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:03:41,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:03:41,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:03:41,504 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:03:41,507 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:03:41,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:03:41,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:03:41,508 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:03:41,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:03:41,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:03:41,509 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:03:41,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:03:41,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:03:41,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:03:41,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:03:41,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:03:41,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:03:41,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:03:41,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:03:41,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:03:41,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:03:41,511 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:03:41,511 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:03:41,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:03:41,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:03:41,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:03:41,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:03:41,512 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-19 09:03:41,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:03:41,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:03:41,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:03:41,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:03:41,834 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:03:41,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-19 09:03:43,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:03:43,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:03:43,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-19 09:03:43,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0675cd261/f676f6ec7f9b4536aa8d8b2af504a189/FLAG68f3351eb [2024-11-19 09:03:43,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0675cd261/f676f6ec7f9b4536aa8d8b2af504a189 [2024-11-19 09:03:43,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:03:43,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:03:43,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:03:43,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:03:43,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:03:43,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:03:43" (1/1) ... [2024-11-19 09:03:43,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1825bc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:43, skipping insertion in model container [2024-11-19 09:03:43,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:03:43" (1/1) ... [2024-11-19 09:03:43,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:03:44,281 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,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-19 09:03:44,319 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,323 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,332 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,376 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,380 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,382 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,386 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,388 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,390 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,394 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,395 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,397 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,402 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:03:44,430 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:03:44,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:03:44,462 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,475 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,477 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,478 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,482 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,502 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,508 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,508 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,509 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,511 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,513 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,514 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,517 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,520 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:03:44,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:03:44,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:03:44,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:03:44,690 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:03:44,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44 WrapperNode [2024-11-19 09:03:44,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:03:44,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:03:44,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:03:44,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:03:44,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,789 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1059 [2024-11-19 09:03:44,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:03:44,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:03:44,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:03:44,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:03:44,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,905 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 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-19 09:03:44,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:03:44,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:03:44,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:03:44,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:03:44,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (1/1) ... [2024-11-19 09:03:44,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:03:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:03:44,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:03:44,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:03:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:03:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:03:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:03:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:03:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:03:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:03:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:03:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:03:45,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:03:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:03:45,030 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:03:45,031 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:03:45,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:03:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:03:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:03:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:03:45,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:03:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:03:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:03:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:03:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:03:45,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:03:45,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:03:45,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:03:45,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:03:45,217 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:03:45,260 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:03:45,283 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:03:49,050 INFO L? ?]: Removed 1087 outVars from TransFormulas that were not future-live. [2024-11-19 09:03:49,050 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:03:49,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:03:49,079 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 09:03:49,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:03:49 BoogieIcfgContainer [2024-11-19 09:03:49,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:03:49,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:03:49,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:03:49,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:03:49,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:03:43" (1/3) ... [2024-11-19 09:03:49,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475d1d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:03:49, skipping insertion in model container [2024-11-19 09:03:49,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:03:44" (2/3) ... [2024-11-19 09:03:49,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475d1d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:03:49, skipping insertion in model container [2024-11-19 09:03:49,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:03:49" (3/3) ... [2024-11-19 09:03:49,090 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-2.i [2024-11-19 09:03:49,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:03:49,134 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-19 09:03:49,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:03:49,206 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;@5a04a324, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:03:49,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-19 09:03:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 1060 states, 533 states have (on average 2.2157598499061915) internal successors, (1181), 1055 states have internal predecessors, (1181), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 09:03:49,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:49,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 09:03:49,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:03:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1758428, now seen corresponding path program 1 times [2024-11-19 09:03:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:49,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869426715] [2024-11-19 09:03:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:49,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:49,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:49,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:03:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:49,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:03:49,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:49,480 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-19 09:03:49,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:49,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:49,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869426715] [2024-11-19 09:03:49,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869426715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:49,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:49,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:03:49,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101394948] [2024-11-19 09:03:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:49,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:49,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:03:49,533 INFO L87 Difference]: Start difference. First operand has 1060 states, 533 states have (on average 2.2157598499061915) internal successors, (1181), 1055 states have internal predecessors, (1181), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:51,260 INFO L93 Difference]: Finished difference Result 1448 states and 1549 transitions. [2024-11-19 09:03:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:03:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-19 09:03:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:51,308 INFO L225 Difference]: With dead ends: 1448 [2024-11-19 09:03:51,308 INFO L226 Difference]: Without dead ends: 1445 [2024-11-19 09:03:51,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:03:51,312 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 426 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1550 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:51,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1483 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 1550 Unchecked, 1.6s Time] [2024-11-19 09:03:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-19 09:03:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1048. [2024-11-19 09:03:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 527 states have (on average 2.0853889943074004) internal successors, (1099), 1043 states have internal predecessors, (1099), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1105 transitions. [2024-11-19 09:03:51,413 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1105 transitions. Word has length 4 [2024-11-19 09:03:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:51,414 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1105 transitions. [2024-11-19 09:03:51,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1105 transitions. [2024-11-19 09:03:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 09:03:51,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:51,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 09:03:51,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:03:51,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:51,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:03:51,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:51,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-19 09:03:51,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:51,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603353378] [2024-11-19 09:03:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:51,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:51,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:51,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:03:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:51,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:03:51,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:51,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:03:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:51,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:51,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603353378] [2024-11-19 09:03:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603353378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:03:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132034440] [2024-11-19 09:03:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:51,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:03:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:51,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:03:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:51,769 INFO L87 Difference]: Start difference. First operand 1048 states and 1105 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:53,084 INFO L93 Difference]: Finished difference Result 1224 states and 1291 transitions. [2024-11-19 09:03:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:03:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-19 09:03:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:53,089 INFO L225 Difference]: With dead ends: 1224 [2024-11-19 09:03:53,089 INFO L226 Difference]: Without dead ends: 1224 [2024-11-19 09:03:53,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:53,091 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 968 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:53,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 778 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 09:03:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-19 09:03:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1045. [2024-11-19 09:03:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 535 states have (on average 2.0504672897196263) internal successors, (1097), 1040 states have internal predecessors, (1097), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1103 transitions. [2024-11-19 09:03:53,115 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1103 transitions. Word has length 4 [2024-11-19 09:03:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1103 transitions. [2024-11-19 09:03:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1103 transitions. [2024-11-19 09:03:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 09:03:53,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:53,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 09:03:53,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:03:53,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:53,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:03:53,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-19 09:03:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:53,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518481914] [2024-11-19 09:03:53,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:53,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:53,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:53,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:53,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:03:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:53,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:03:53,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:53,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:03:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:53,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:53,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:53,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518481914] [2024-11-19 09:03:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518481914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:53,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:03:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661853907] [2024-11-19 09:03:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:53,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:03:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:53,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:03:53,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:53,466 INFO L87 Difference]: Start difference. First operand 1045 states and 1103 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:55,217 INFO L93 Difference]: Finished difference Result 1457 states and 1547 transitions. [2024-11-19 09:03:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:03:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-19 09:03:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:55,230 INFO L225 Difference]: With dead ends: 1457 [2024-11-19 09:03:55,231 INFO L226 Difference]: Without dead ends: 1457 [2024-11-19 09:03:55,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:55,232 INFO L432 NwaCegarLoop]: 904 mSDtfsCounter, 444 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:55,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1483 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:03:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-11-19 09:03:55,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1170. [2024-11-19 09:03:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 661 states have (on average 2.006051437216339) internal successors, (1326), 1165 states have internal predecessors, (1326), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1332 transitions. [2024-11-19 09:03:55,302 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1332 transitions. Word has length 4 [2024-11-19 09:03:55,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:55,303 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1332 transitions. [2024-11-19 09:03:55,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1332 transitions. [2024-11-19 09:03:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:03:55,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:55,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:55,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:03:55,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:55,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:03:55,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-19 09:03:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532317314] [2024-11-19 09:03:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:55,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:55,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:55,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:55,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:03:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:55,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:03:55,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:55,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:03:55,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:03:55,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:03:55,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:03:55,709 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:03:55,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:03:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:55,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:55,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:55,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532317314] [2024-11-19 09:03:55,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532317314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:55,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:55,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:03:55,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440569513] [2024-11-19 09:03:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:55,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:03:55,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:03:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:55,734 INFO L87 Difference]: Start difference. First operand 1170 states and 1332 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:57,563 INFO L93 Difference]: Finished difference Result 1338 states and 1508 transitions. [2024-11-19 09:03:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:03:57,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 09:03:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:57,576 INFO L225 Difference]: With dead ends: 1338 [2024-11-19 09:03:57,576 INFO L226 Difference]: Without dead ends: 1338 [2024-11-19 09:03:57,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:03:57,582 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 1252 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:57,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 451 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:03:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-19 09:03:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1033. [2024-11-19 09:03:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 535 states have (on average 2.0261682242990653) internal successors, (1084), 1028 states have internal predecessors, (1084), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1090 transitions. [2024-11-19 09:03:57,624 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1090 transitions. Word has length 8 [2024-11-19 09:03:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1090 transitions. [2024-11-19 09:03:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1090 transitions. [2024-11-19 09:03:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:03:57,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:57,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:57,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 (5)] Ended with exit code 0 [2024-11-19 09:03:57,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:57,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:03:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:57,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-19 09:03:57,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053471087] [2024-11-19 09:03:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:57,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-19 09:03:57,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:57,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:57,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:03:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:57,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:03:57,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:57,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:03:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:57,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:57,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053471087] [2024-11-19 09:03:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053471087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:57,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:03:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488870001] [2024-11-19 09:03:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:03:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:03:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:57,943 INFO L87 Difference]: Start difference. First operand 1033 states and 1090 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:03:59,219 INFO L93 Difference]: Finished difference Result 1198 states and 1276 transitions. [2024-11-19 09:03:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:03:59,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 09:03:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:03:59,223 INFO L225 Difference]: With dead ends: 1198 [2024-11-19 09:03:59,223 INFO L226 Difference]: Without dead ends: 1198 [2024-11-19 09:03:59,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:59,224 INFO L432 NwaCegarLoop]: 866 mSDtfsCounter, 749 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:03:59,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1117 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:03:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-19 09:03:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 986. [2024-11-19 09:03:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 535 states have (on average 1.9383177570093457) internal successors, (1037), 981 states have internal predecessors, (1037), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:03:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1043 transitions. [2024-11-19 09:03:59,262 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1043 transitions. Word has length 9 [2024-11-19 09:03:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:03:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1043 transitions. [2024-11-19 09:03:59,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:03:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1043 transitions. [2024-11-19 09:03:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:03:59,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:03:59,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:03:59,268 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-19 09:03:59,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:59,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:03:59,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:03:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-19 09:03:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:03:59,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128013367] [2024-11-19 09:03:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:03:59,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:03:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:03:59,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:03:59,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:03:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:03:59,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:03:59,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:03:59,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:03:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:03:59,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:03:59,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:03:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128013367] [2024-11-19 09:03:59,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128013367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:03:59,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:03:59,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:03:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067999887] [2024-11-19 09:03:59,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:03:59,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:03:59,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:03:59,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:03:59,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:03:59,605 INFO L87 Difference]: Start difference. First operand 986 states and 1043 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:00,996 INFO L93 Difference]: Finished difference Result 1274 states and 1355 transitions. [2024-11-19 09:04:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:00,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 09:04:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:01,001 INFO L225 Difference]: With dead ends: 1274 [2024-11-19 09:04:01,005 INFO L226 Difference]: Without dead ends: 1274 [2024-11-19 09:04:01,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:01,008 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 500 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:01,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1464 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:04:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-19 09:04:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1013. [2024-11-19 09:04:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 572 states have (on average 1.9248251748251748) internal successors, (1101), 1008 states have internal predecessors, (1101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1107 transitions. [2024-11-19 09:04:01,039 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1107 transitions. Word has length 9 [2024-11-19 09:04:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:01,039 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1107 transitions. [2024-11-19 09:04:01,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1107 transitions. [2024-11-19 09:04:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 09:04:01,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:01,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:01,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:04:01,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:01,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -153057981, now seen corresponding path program 1 times [2024-11-19 09:04:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136833787] [2024-11-19 09:04:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:01,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:01,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:01,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:04:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:01,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:04:01,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:01,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:01,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:01,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136833787] [2024-11-19 09:04:01,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136833787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:01,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:01,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361593865] [2024-11-19 09:04:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:01,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:01,400 INFO L87 Difference]: Start difference. First operand 1013 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:01,596 INFO L93 Difference]: Finished difference Result 1453 states and 1602 transitions. [2024-11-19 09:04:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:01,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-19 09:04:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:01,600 INFO L225 Difference]: With dead ends: 1453 [2024-11-19 09:04:01,601 INFO L226 Difference]: Without dead ends: 1453 [2024-11-19 09:04:01,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:01,601 INFO L432 NwaCegarLoop]: 1093 mSDtfsCounter, 466 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2033 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-19 09:04:01,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2033 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:04:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-19 09:04:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1187. [2024-11-19 09:04:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 746 states have (on average 1.8686327077747988) internal successors, (1394), 1182 states have internal predecessors, (1394), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1400 transitions. [2024-11-19 09:04:01,618 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1400 transitions. Word has length 12 [2024-11-19 09:04:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:01,619 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1400 transitions. [2024-11-19 09:04:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1400 transitions. [2024-11-19 09:04:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 09:04:01,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:01,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:01,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:04:01,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:01,823 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:01,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1410939272, now seen corresponding path program 1 times [2024-11-19 09:04:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324937672] [2024-11-19 09:04:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:01,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:01,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:01,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:01,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:04:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:01,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:04:01,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:01,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:01,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:01,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324937672] [2024-11-19 09:04:01,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324937672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:01,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:01,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:01,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842864017] [2024-11-19 09:04:01,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:01,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:01,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:01,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:01,975 INFO L87 Difference]: Start difference. First operand 1187 states and 1400 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-19 09:04:02,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:02,003 INFO L93 Difference]: Finished difference Result 1127 states and 1314 transitions. [2024-11-19 09:04:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-19 09:04:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:02,008 INFO L225 Difference]: With dead ends: 1127 [2024-11-19 09:04:02,008 INFO L226 Difference]: Without dead ends: 1127 [2024-11-19 09:04:02,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:02,009 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 71 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:02,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1877 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:02,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-11-19 09:04:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2024-11-19 09:04:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 710 states have (on average 1.8422535211267606) internal successors, (1308), 1122 states have internal predecessors, (1308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1314 transitions. [2024-11-19 09:04:02,027 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1314 transitions. Word has length 14 [2024-11-19 09:04:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:02,027 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1314 transitions. [2024-11-19 09:04:02,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-19 09:04:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1314 transitions. [2024-11-19 09:04:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 09:04:02,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:02,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:02,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:02,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:02,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1512080444, now seen corresponding path program 1 times [2024-11-19 09:04:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805815254] [2024-11-19 09:04:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:02,239 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:02,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:04:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:02,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:04:02,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:02,468 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-19 09:04:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:02,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:02,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805815254] [2024-11-19 09:04:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805815254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:02,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598219875] [2024-11-19 09:04:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:02,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:04:02,470 INFO L87 Difference]: Start difference. First operand 1127 states and 1314 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:03,698 INFO L93 Difference]: Finished difference Result 1402 states and 1609 transitions. [2024-11-19 09:04:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 09:04:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:03,702 INFO L225 Difference]: With dead ends: 1402 [2024-11-19 09:04:03,702 INFO L226 Difference]: Without dead ends: 1400 [2024-11-19 09:04:03,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:04:03,703 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 286 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1280 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:03,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1406 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 564 Invalid, 0 Unknown, 1280 Unchecked, 1.2s Time] [2024-11-19 09:04:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-11-19 09:04:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1198. [2024-11-19 09:04:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 781 states have (on average 1.8104993597951344) internal successors, (1414), 1193 states have internal predecessors, (1414), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1420 transitions. [2024-11-19 09:04:03,743 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1420 transitions. Word has length 15 [2024-11-19 09:04:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:03,743 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1420 transitions. [2024-11-19 09:04:03,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1420 transitions. [2024-11-19 09:04:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 09:04:03,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:03,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:03,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 09:04:03,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:03,949 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:03,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1512073534, now seen corresponding path program 1 times [2024-11-19 09:04:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:03,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919849650] [2024-11-19 09:04:03,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:03,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:03,957 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:03,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:04:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:04,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:04:04,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:04,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:04,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919849650] [2024-11-19 09:04:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919849650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:04,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:04,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295056551] [2024-11-19 09:04:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:04,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:04,160 INFO L87 Difference]: Start difference. First operand 1198 states and 1420 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:04,630 INFO L93 Difference]: Finished difference Result 1442 states and 1623 transitions. [2024-11-19 09:04:04,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 09:04:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:04,634 INFO L225 Difference]: With dead ends: 1442 [2024-11-19 09:04:04,635 INFO L226 Difference]: Without dead ends: 1438 [2024-11-19 09:04:04,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:04,635 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 425 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:04,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 2890 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:04:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-19 09:04:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1196. [2024-11-19 09:04:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 779 states have (on average 1.8112965340179719) internal successors, (1411), 1191 states have internal predecessors, (1411), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1417 transitions. [2024-11-19 09:04:04,650 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1417 transitions. Word has length 15 [2024-11-19 09:04:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:04,650 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1417 transitions. [2024-11-19 09:04:04,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1417 transitions. [2024-11-19 09:04:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 09:04:04,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:04,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:04,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:04,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:04,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:04,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1297050578, now seen corresponding path program 1 times [2024-11-19 09:04:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719424734] [2024-11-19 09:04:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:04,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:04,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:04,858 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:04,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:04:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:04,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:04:04,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:04,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:04,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719424734] [2024-11-19 09:04:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719424734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:04,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:04,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128041535] [2024-11-19 09:04:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:04,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:04,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:04,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:04,987 INFO L87 Difference]: Start difference. First operand 1196 states and 1417 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:05,042 INFO L93 Difference]: Finished difference Result 1158 states and 1330 transitions. [2024-11-19 09:04:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:04:05,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 09:04:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:05,045 INFO L225 Difference]: With dead ends: 1158 [2024-11-19 09:04:05,045 INFO L226 Difference]: Without dead ends: 1158 [2024-11-19 09:04:05,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:05,046 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 48 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:05,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2749 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-19 09:04:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-19 09:04:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 755 states have (on average 1.7536423841059603) internal successors, (1324), 1153 states have internal predecessors, (1324), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1330 transitions. [2024-11-19 09:04:05,059 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1330 transitions. Word has length 16 [2024-11-19 09:04:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:05,059 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1330 transitions. [2024-11-19 09:04:05,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1330 transitions. [2024-11-19 09:04:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 09:04:05,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:05,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:05,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:04:05,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:05,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:05,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:05,261 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-19 09:04:05,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:05,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143915088] [2024-11-19 09:04:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:05,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:05,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:05,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:04:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:05,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:04:05,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:05,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:05,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:05,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143915088] [2024-11-19 09:04:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143915088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:05,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:05,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16959931] [2024-11-19 09:04:05,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:05,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:05,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:05,409 INFO L87 Difference]: Start difference. First operand 1158 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:05,429 INFO L93 Difference]: Finished difference Result 1098 states and 1244 transitions. [2024-11-19 09:04:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:05,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-19 09:04:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:05,432 INFO L225 Difference]: With dead ends: 1098 [2024-11-19 09:04:05,432 INFO L226 Difference]: Without dead ends: 1098 [2024-11-19 09:04:05,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:05,432 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 71 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:05,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1721 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-19 09:04:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2024-11-19 09:04:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 719 states have (on average 1.721835883171071) internal successors, (1238), 1093 states have internal predecessors, (1238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1244 transitions. [2024-11-19 09:04:05,462 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1244 transitions. Word has length 19 [2024-11-19 09:04:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1244 transitions. [2024-11-19 09:04:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1244 transitions. [2024-11-19 09:04:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 09:04:05,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:05,463 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] [2024-11-19 09:04:05,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 (13)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:05,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:05,665 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:05,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash -774929132, now seen corresponding path program 1 times [2024-11-19 09:04:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:05,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782185792] [2024-11-19 09:04:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:05,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:05,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:05,670 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:05,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:04:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:05,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:04:05,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:05,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:05,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782185792] [2024-11-19 09:04:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782185792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654420802] [2024-11-19 09:04:05,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:05,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:05,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:05,857 INFO L87 Difference]: Start difference. First operand 1098 states and 1244 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:05,918 INFO L93 Difference]: Finished difference Result 1068 states and 1186 transitions. [2024-11-19 09:04:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:04:05,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-19 09:04:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:05,923 INFO L225 Difference]: With dead ends: 1068 [2024-11-19 09:04:05,923 INFO L226 Difference]: Without dead ends: 1068 [2024-11-19 09:04:05,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:05,925 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 48 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:05,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2515 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2024-11-19 09:04:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2024-11-19 09:04:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 703 states have (on average 1.678520625889047) internal successors, (1180), 1063 states have internal predecessors, (1180), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1186 transitions. [2024-11-19 09:04:05,942 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1186 transitions. Word has length 21 [2024-11-19 09:04:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:05,943 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1186 transitions. [2024-11-19 09:04:05,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1186 transitions. [2024-11-19 09:04:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 09:04:05,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:05,947 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] [2024-11-19 09:04:05,953 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-19 09:04:06,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:06,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:06,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash 727437120, now seen corresponding path program 1 times [2024-11-19 09:04:06,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:06,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344919976] [2024-11-19 09:04:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:06,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:06,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:06,152 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:06,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 09:04:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:06,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:04:06,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:06,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:04:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:06,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:06,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344919976] [2024-11-19 09:04:06,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344919976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:06,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:06,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676164442] [2024-11-19 09:04:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:06,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:06,330 INFO L87 Difference]: Start difference. First operand 1068 states and 1186 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:07,753 INFO L93 Difference]: Finished difference Result 1255 states and 1374 transitions. [2024-11-19 09:04:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-19 09:04:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:07,757 INFO L225 Difference]: With dead ends: 1255 [2024-11-19 09:04:07,757 INFO L226 Difference]: Without dead ends: 1255 [2024-11-19 09:04:07,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:07,758 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 774 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:07,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1122 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:04:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-19 09:04:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1064. [2024-11-19 09:04:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 703 states have (on average 1.6614509246088194) internal successors, (1168), 1059 states have internal predecessors, (1168), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1174 transitions. [2024-11-19 09:04:07,785 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1174 transitions. Word has length 30 [2024-11-19 09:04:07,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:07,788 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1174 transitions. [2024-11-19 09:04:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1174 transitions. [2024-11-19 09:04:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 09:04:07,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:07,790 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] [2024-11-19 09:04:07,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:07,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:07,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:07,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:07,991 INFO L85 PathProgramCache]: Analyzing trace with hash 727437121, now seen corresponding path program 1 times [2024-11-19 09:04:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:07,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161126069] [2024-11-19 09:04:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:07,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:07,993 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:07,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:04:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:08,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:04:08,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:08,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:08,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:08,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:08,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161126069] [2024-11-19 09:04:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161126069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:08,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004650379] [2024-11-19 09:04:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:08,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:08,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:08,248 INFO L87 Difference]: Start difference. First operand 1064 states and 1174 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:09,799 INFO L93 Difference]: Finished difference Result 1071 states and 1176 transitions. [2024-11-19 09:04:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:09,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-19 09:04:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:09,802 INFO L225 Difference]: With dead ends: 1071 [2024-11-19 09:04:09,802 INFO L226 Difference]: Without dead ends: 1071 [2024-11-19 09:04:09,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:09,804 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 79 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:09,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1752 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:04:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-19 09:04:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1064. [2024-11-19 09:04:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 703 states have (on average 1.6557610241820768) internal successors, (1164), 1059 states have internal predecessors, (1164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1170 transitions. [2024-11-19 09:04:09,814 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1170 transitions. Word has length 30 [2024-11-19 09:04:09,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:09,814 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1170 transitions. [2024-11-19 09:04:09,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1170 transitions. [2024-11-19 09:04:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:04:09,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:09,815 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] [2024-11-19 09:04:09,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 09:04:10,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:10,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:10,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064798, now seen corresponding path program 1 times [2024-11-19 09:04:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071410111] [2024-11-19 09:04:10,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:10,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:10,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:10,021 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:10,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 09:04:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:10,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:04:10,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:10,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:04:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:10,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:10,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:10,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071410111] [2024-11-19 09:04:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071410111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:10,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:10,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155399322] [2024-11-19 09:04:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:10,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:10,218 INFO L87 Difference]: Start difference. First operand 1064 states and 1170 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:11,512 INFO L93 Difference]: Finished difference Result 1071 states and 1172 transitions. [2024-11-19 09:04:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-19 09:04:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:11,515 INFO L225 Difference]: With dead ends: 1071 [2024-11-19 09:04:11,516 INFO L226 Difference]: Without dead ends: 1071 [2024-11-19 09:04:11,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:11,516 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 600 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:11,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1231 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 09:04:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-19 09:04:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2024-11-19 09:04:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 703 states have (on average 1.6443812233285917) internal successors, (1156), 1055 states have internal predecessors, (1156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1162 transitions. [2024-11-19 09:04:11,527 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1162 transitions. Word has length 35 [2024-11-19 09:04:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:11,527 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1162 transitions. [2024-11-19 09:04:11,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1162 transitions. [2024-11-19 09:04:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:04:11,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:11,528 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] [2024-11-19 09:04:11,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:11,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:11,729 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:11,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064797, now seen corresponding path program 1 times [2024-11-19 09:04:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:11,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579683291] [2024-11-19 09:04:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:11,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:11,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:11,736 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:11,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 09:04:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:11,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:04:11,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:11,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:12,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:12,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579683291] [2024-11-19 09:04:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579683291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730442752] [2024-11-19 09:04:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:12,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:12,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:12,067 INFO L87 Difference]: Start difference. First operand 1060 states and 1162 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:13,922 INFO L93 Difference]: Finished difference Result 1317 states and 1404 transitions. [2024-11-19 09:04:13,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:13,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-19 09:04:13,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:13,925 INFO L225 Difference]: With dead ends: 1317 [2024-11-19 09:04:13,925 INFO L226 Difference]: Without dead ends: 1317 [2024-11-19 09:04:13,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:13,926 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 347 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:13,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1901 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 09:04:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-19 09:04:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1056. [2024-11-19 09:04:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 703 states have (on average 1.6330014224751066) internal successors, (1148), 1051 states have internal predecessors, (1148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1154 transitions. [2024-11-19 09:04:13,936 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1154 transitions. Word has length 35 [2024-11-19 09:04:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:13,937 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1154 transitions. [2024-11-19 09:04:13,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1154 transitions. [2024-11-19 09:04:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 09:04:13,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:13,938 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] [2024-11-19 09:04:13,943 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-19 09:04:14,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:14,139 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:14,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:14,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1556225793, now seen corresponding path program 1 times [2024-11-19 09:04:14,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:14,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038840720] [2024-11-19 09:04:14,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:14,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:14,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:14,142 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:14,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 09:04:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:14,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:04:14,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:14,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:14,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038840720] [2024-11-19 09:04:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038840720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:14,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:14,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007645040] [2024-11-19 09:04:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:14,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:14,323 INFO L87 Difference]: Start difference. First operand 1056 states and 1154 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:14,370 INFO L93 Difference]: Finished difference Result 1038 states and 1124 transitions. [2024-11-19 09:04:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:04:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-19 09:04:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:14,372 INFO L225 Difference]: With dead ends: 1038 [2024-11-19 09:04:14,373 INFO L226 Difference]: Without dead ends: 1038 [2024-11-19 09:04:14,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:14,373 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 27 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:14,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2474 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-19 09:04:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-11-19 09:04:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 685 states have (on average 1.6321167883211678) internal successors, (1118), 1033 states have internal predecessors, (1118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1124 transitions. [2024-11-19 09:04:14,385 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1124 transitions. Word has length 50 [2024-11-19 09:04:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:14,385 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1124 transitions. [2024-11-19 09:04:14,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1124 transitions. [2024-11-19 09:04:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 09:04:14,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:14,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:14,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:14,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:14,591 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:14,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash -848059422, now seen corresponding path program 1 times [2024-11-19 09:04:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637311211] [2024-11-19 09:04:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:14,595 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:14,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 09:04:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:14,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:04:14,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:14,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:14,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:14,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637311211] [2024-11-19 09:04:14,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637311211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405934861] [2024-11-19 09:04:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:14,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:14,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:14,805 INFO L87 Difference]: Start difference. First operand 1038 states and 1124 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:14,846 INFO L93 Difference]: Finished difference Result 1026 states and 1104 transitions. [2024-11-19 09:04:14,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:04:14,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-19 09:04:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:14,849 INFO L225 Difference]: With dead ends: 1026 [2024-11-19 09:04:14,849 INFO L226 Difference]: Without dead ends: 1026 [2024-11-19 09:04:14,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:14,850 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 21 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:14,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2468 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-19 09:04:14,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2024-11-19 09:04:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 673 states have (on average 1.6315007429420505) internal successors, (1098), 1021 states have internal predecessors, (1098), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1104 transitions. [2024-11-19 09:04:14,859 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1104 transitions. Word has length 54 [2024-11-19 09:04:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:14,859 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1104 transitions. [2024-11-19 09:04:14,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1104 transitions. [2024-11-19 09:04:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 09:04:14,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:14,860 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] [2024-11-19 09:04:14,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:15,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:15,061 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:15,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash 619385421, now seen corresponding path program 1 times [2024-11-19 09:04:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110567167] [2024-11-19 09:04:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:15,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:15,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:15,063 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:15,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 09:04:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:15,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:04:15,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:15,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:04:15,268 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:04:15,268 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:04:15,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 09:04:15,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:04:15,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 09:04: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-19 09:04:15,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:15,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110567167] [2024-11-19 09:04:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110567167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:15,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:15,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:04:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805122126] [2024-11-19 09:04:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:15,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:04:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:15,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:04:15,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:04:15,383 INFO L87 Difference]: Start difference. First operand 1026 states and 1104 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:15,642 INFO L93 Difference]: Finished difference Result 1498 states and 1597 transitions. [2024-11-19 09:04:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 58 [2024-11-19 09:04:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:15,646 INFO L225 Difference]: With dead ends: 1498 [2024-11-19 09:04:15,646 INFO L226 Difference]: Without dead ends: 1495 [2024-11-19 09:04:15,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:04:15,647 INFO L432 NwaCegarLoop]: 827 mSDtfsCounter, 1769 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:15,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 2847 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:04:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-19 09:04:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 972. [2024-11-19 09:04:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 619 states have (on average 1.6833602584814216) internal successors, (1042), 967 states have internal predecessors, (1042), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1048 transitions. [2024-11-19 09:04:15,658 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1048 transitions. Word has length 58 [2024-11-19 09:04:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:15,658 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1048 transitions. [2024-11-19 09:04:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1048 transitions. [2024-11-19 09:04:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 09:04:15,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:15,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:15,668 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-19 09:04:15,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:15,862 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:15,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash 887665558, now seen corresponding path program 1 times [2024-11-19 09:04:15,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:15,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032062879] [2024-11-19 09:04:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:15,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:15,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:15,865 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:15,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 09:04:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:16,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:04:16,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:16,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:04:16,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:16,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:04:16,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:04:16,447 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:04:16,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:04:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:16,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:16,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:16,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032062879] [2024-11-19 09:04:16,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032062879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:16,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:16,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:04:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103144007] [2024-11-19 09:04:16,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:16,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:16,456 INFO L87 Difference]: Start difference. First operand 972 states and 1048 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:17,635 INFO L93 Difference]: Finished difference Result 934 states and 1010 transitions. [2024-11-19 09:04:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-19 09:04:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:17,641 INFO L225 Difference]: With dead ends: 934 [2024-11-19 09:04:17,641 INFO L226 Difference]: Without dead ends: 934 [2024-11-19 09:04:17,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:17,642 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1044 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:17,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 547 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:04:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-11-19 09:04:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 897. [2024-11-19 09:04:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 582 states have (on average 1.597938144329897) internal successors, (930), 892 states have internal predecessors, (930), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 936 transitions. [2024-11-19 09:04:17,649 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 936 transitions. Word has length 62 [2024-11-19 09:04:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:17,650 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 936 transitions. [2024-11-19 09:04:17,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 936 transitions. [2024-11-19 09:04:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 09:04:17,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:17,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:17,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:17,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:17,855 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:17,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:17,855 INFO L85 PathProgramCache]: Analyzing trace with hash 512421051, now seen corresponding path program 1 times [2024-11-19 09:04:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295189139] [2024-11-19 09:04:17,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:17,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:17,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:17,857 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:17,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 09:04:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:18,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:04:18,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:18,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:04:18,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:04:18,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 09:04:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:18,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:18,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295189139] [2024-11-19 09:04:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295189139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38021505] [2024-11-19 09:04:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:18,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:04:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:18,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:04:18,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:18,116 INFO L87 Difference]: Start difference. First operand 897 states and 936 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:19,638 INFO L93 Difference]: Finished difference Result 896 states and 935 transitions. [2024-11-19 09:04:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-19 09:04:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:19,642 INFO L225 Difference]: With dead ends: 896 [2024-11-19 09:04:19,642 INFO L226 Difference]: Without dead ends: 896 [2024-11-19 09:04:19,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:04:19,643 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 2 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:19,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2079 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:04:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-19 09:04:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-11-19 09:04:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 582 states have (on average 1.5962199312714778) internal successors, (929), 891 states have internal predecessors, (929), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 935 transitions. [2024-11-19 09:04:19,651 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 935 transitions. Word has length 67 [2024-11-19 09:04:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 935 transitions. [2024-11-19 09:04:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 935 transitions. [2024-11-19 09:04:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 09:04:19,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:19,652 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] [2024-11-19 09:04:19,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:19,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:19,853 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:19,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 512421052, now seen corresponding path program 1 times [2024-11-19 09:04:19,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:19,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746206280] [2024-11-19 09:04:19,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:19,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:19,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:19,861 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:19,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-19 09:04:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:20,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:04:20,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:20,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:04:20,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:04:20,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:04:20,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 09:04:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:20,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:20,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746206280] [2024-11-19 09:04:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746206280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:20,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971315607] [2024-11-19 09:04:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:20,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:04:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:04:20,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:04:20,194 INFO L87 Difference]: Start difference. First operand 896 states and 935 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:22,140 INFO L93 Difference]: Finished difference Result 895 states and 934 transitions. [2024-11-19 09:04:22,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:04:22,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-19 09:04:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:22,142 INFO L225 Difference]: With dead ends: 895 [2024-11-19 09:04:22,142 INFO L226 Difference]: Without dead ends: 895 [2024-11-19 09:04:22,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:04:22,143 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 1 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:22,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2100 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:04:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-19 09:04:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2024-11-19 09:04:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 581 states have (on average 1.5972461273666092) internal successors, (928), 890 states have internal predecessors, (928), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:04:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 934 transitions. [2024-11-19 09:04:22,151 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 934 transitions. Word has length 67 [2024-11-19 09:04:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:22,151 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 934 transitions. [2024-11-19 09:04:22,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:04:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 934 transitions. [2024-11-19 09:04:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 09:04:22,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:22,152 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-19 09:04:22,160 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 (24)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:22,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:22,357 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:22,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1667443458, now seen corresponding path program 1 times [2024-11-19 09:04:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518605295] [2024-11-19 09:04:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:22,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:22,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:22,360 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:22,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-19 09:04:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:22,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:04:22,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:22,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:22,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:22,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518605295] [2024-11-19 09:04:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518605295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:04:22,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366079971] [2024-11-19 09:04:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:22,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:04:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:04:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:22,632 INFO L87 Difference]: Start difference. First operand 895 states and 934 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:22,660 INFO L93 Difference]: Finished difference Result 898 states and 938 transitions. [2024-11-19 09:04:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:04:22,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2024-11-19 09:04:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:22,664 INFO L225 Difference]: With dead ends: 898 [2024-11-19 09:04:22,664 INFO L226 Difference]: Without dead ends: 898 [2024-11-19 09:04:22,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:04:22,665 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 0 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2413 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-19 09:04:22,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2413 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:04:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-19 09:04:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-11-19 09:04:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 583 states have (on average 1.5969125214408233) internal successors, (931), 893 states have internal predecessors, (931), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:04:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 938 transitions. [2024-11-19 09:04:22,704 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 938 transitions. Word has length 75 [2024-11-19 09:04:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:22,705 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 938 transitions. [2024-11-19 09:04:22,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:04:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 938 transitions. [2024-11-19 09:04:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 09:04:22,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:22,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:22,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:22,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:22,911 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:22,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1126673817, now seen corresponding path program 1 times [2024-11-19 09:04:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:22,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324347858] [2024-11-19 09:04:22,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:22,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:22,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:22,915 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:22,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-19 09:04:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:23,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:04:23,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:23,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:23,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:23,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324347858] [2024-11-19 09:04:23,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324347858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:04:23,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:23,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:04:23,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835662378] [2024-11-19 09:04:23,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:23,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:04:23,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:23,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:04:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:04:23,227 INFO L87 Difference]: Start difference. First operand 898 states and 938 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:23,333 INFO L93 Difference]: Finished difference Result 910 states and 955 transitions. [2024-11-19 09:04:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:04:23,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2024-11-19 09:04:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:23,339 INFO L225 Difference]: With dead ends: 910 [2024-11-19 09:04:23,339 INFO L226 Difference]: Without dead ends: 910 [2024-11-19 09:04:23,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:04:23,340 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 8 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:23,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2416 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:04:23,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-19 09:04:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 908. [2024-11-19 09:04:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 592 states have (on average 1.597972972972973) internal successors, (946), 902 states have internal predecessors, (946), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:04:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 953 transitions. [2024-11-19 09:04:23,363 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 953 transitions. Word has length 76 [2024-11-19 09:04:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:23,363 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 953 transitions. [2024-11-19 09:04:23,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 953 transitions. [2024-11-19 09:04:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 09:04:23,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:23,364 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:23,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:23,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:23,568 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:23,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:23,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1908054210, now seen corresponding path program 2 times [2024-11-19 09:04:23,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:23,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691720066] [2024-11-19 09:04:23,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:04:23,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:23,572 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:23,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-19 09:04:23,972 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:04:23,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:04:23,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:04:23,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:24,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:24,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691720066] [2024-11-19 09:04:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691720066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:04:24,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 09:04:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158064918] [2024-11-19 09:04:24,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:24,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:04:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:24,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:04:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:04:24,148 INFO L87 Difference]: Start difference. First operand 908 states and 953 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:24,498 INFO L93 Difference]: Finished difference Result 923 states and 975 transitions. [2024-11-19 09:04:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:04:24,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 79 [2024-11-19 09:04:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:24,501 INFO L225 Difference]: With dead ends: 923 [2024-11-19 09:04:24,501 INFO L226 Difference]: Without dead ends: 919 [2024-11-19 09:04:24,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:04:24,502 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 14 mSDsluCounter, 5621 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6427 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:24,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6427 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:04:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-19 09:04:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 917. [2024-11-19 09:04:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 601 states have (on average 1.5940099833610648) internal successors, (958), 911 states have internal predecessors, (958), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:04:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 965 transitions. [2024-11-19 09:04:24,513 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 965 transitions. Word has length 79 [2024-11-19 09:04:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:24,514 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 965 transitions. [2024-11-19 09:04:24,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 965 transitions. [2024-11-19 09:04:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 09:04:24,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:24,514 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:24,525 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 (27)] Forceful destruction successful, exit code 0 [2024-11-19 09:04:24,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:24,715 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1759209118, now seen corresponding path program 3 times [2024-11-19 09:04:24,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:24,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025530342] [2024-11-19 09:04:24,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:04:24,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:24,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:24,732 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:24,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-19 09:04:25,375 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:04:25,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:04:25,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:04:25,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:25,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:26,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:26,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025530342] [2024-11-19 09:04:26,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025530342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:04:26,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:26,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 09:04:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516779877] [2024-11-19 09:04:26,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:26,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:04:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:04:26,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:04:26,125 INFO L87 Difference]: Start difference. First operand 917 states and 965 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:27,448 INFO L93 Difference]: Finished difference Result 941 states and 1004 transitions. [2024-11-19 09:04:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 09:04:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2024-11-19 09:04:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:27,451 INFO L225 Difference]: With dead ends: 941 [2024-11-19 09:04:27,451 INFO L226 Difference]: Without dead ends: 935 [2024-11-19 09:04:27,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 09:04:27,452 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 18 mSDsluCounter, 8845 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 9652 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:27,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 9652 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:04:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-19 09:04:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2024-11-19 09:04:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 619 states have (on average 1.5848142164781907) internal successors, (981), 929 states have internal predecessors, (981), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:04:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 988 transitions. [2024-11-19 09:04:27,463 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 988 transitions. Word has length 85 [2024-11-19 09:04:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:27,463 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 988 transitions. [2024-11-19 09:04:27,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 988 transitions. [2024-11-19 09:04:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 09:04:27,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:27,464 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:27,478 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 (28)] Ended with exit code 0 [2024-11-19 09:04:27,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:27,666 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:27,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:27,666 INFO L85 PathProgramCache]: Analyzing trace with hash -46026078, now seen corresponding path program 4 times [2024-11-19 09:04:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:27,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082823689] [2024-11-19 09:04:27,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:04:27,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:27,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:27,670 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:27,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-19 09:04:28,079 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:04:28,079 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:04:28,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 09:04:28,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:28,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:29,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082823689] [2024-11-19 09:04:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082823689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:04:29,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:04:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 09:04:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986312765] [2024-11-19 09:04:29,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:04:29,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 09:04:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:29,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 09:04:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 09:04:29,555 INFO L87 Difference]: Start difference. First operand 935 states and 988 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:34,205 INFO L93 Difference]: Finished difference Result 975 states and 1060 transitions. [2024-11-19 09:04:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:04:34,207 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2024-11-19 09:04:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:34,208 INFO L225 Difference]: With dead ends: 975 [2024-11-19 09:04:34,209 INFO L226 Difference]: Without dead ends: 971 [2024-11-19 09:04:34,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 09:04:34,211 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 49 mSDsluCounter, 20074 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:34,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 20880 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:04:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-19 09:04:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2024-11-19 09:04:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 653 states have (on average 1.5727411944869831) internal successors, (1027), 963 states have internal predecessors, (1027), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:04:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1034 transitions. [2024-11-19 09:04:34,226 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1034 transitions. Word has length 97 [2024-11-19 09:04:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:34,227 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1034 transitions. [2024-11-19 09:04:34,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:04:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1034 transitions. [2024-11-19 09:04:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 09:04:34,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:34,228 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:04:34,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-19 09:04:34,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:34,433 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:04:34,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1131463234, now seen corresponding path program 5 times [2024-11-19 09:04:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726458943] [2024-11-19 09:04:34,435 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:04:34,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:04:34,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:34,436 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:04:34,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-19 09:04:35,580 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:04:35,580 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:04:35,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 09:04:35,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:35,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:04:35,713 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:04:35,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:04:35,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:04:35,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 09:04:36,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:04:36,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 09:04:36,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-19 09:04:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 09:04:36,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:04:36,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726458943] [2024-11-19 09:04:36,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726458943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:04:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482071104] [2024-11-19 09:04:36,950 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:04:36,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:04:36,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:04:36,952 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 09:04:36,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process