./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-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_FNV_test1-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 f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 09:01:02,681 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-19 09:01:02,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-19 09:01:02,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 09:01:02,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 09:01:02,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 09:01:02,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 09:01:02,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 09:01:02,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 09:01:02,799 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-19 09:01:02,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 09:01:02,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 09:01:02,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 09:01:02,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-19 09:01:02,801 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-19 09:01:02,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 09:01:02,801 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-19 09:01:02,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-19 09:01:02,802 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-19 09:01:02,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-19 09:01:02,803 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-19 09:01:02,806 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-19 09:01:02,807 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-19 09:01:02,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 09:01:02,807 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-19 09:01:02,807 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-19 09:01:02,808 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-19 09:01:02,808 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-19 09:01:02,808 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-19 09:01:02,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 09:01:02,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-19 09:01:02,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 09:01:02,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-19 09:01:02,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 09:01:02,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 09:01:02,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 09:01:02,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-19 09:01:02,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 09:01:02,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 09:01:02,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 09:01:02,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 09:01:02,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 09:01:02,817 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 -> f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385
[2024-11-19 09:01:03,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 09:01:03,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 09:01:03,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 09:01:03,115 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-19 09:01:03,116 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-19 09:01:03,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i
[2024-11-19 09:01:04,615 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-19 09:01:04,907 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-19 09:01:04,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i
[2024-11-19 09:01:04,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a9c6dd5/f22461b09f5448e2a2d7ccb70d39184f/FLAGbd89f0c33
[2024-11-19 09:01:04,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a9c6dd5/f22461b09f5448e2a2d7ccb70d39184f
[2024-11-19 09:01:04,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 09:01:04,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 09:01:04,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 09:01:04,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 09:01:04,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 09:01:04,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:01:04" (1/1) ...
[2024-11-19 09:01:04,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bb24b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:04, skipping insertion in model container
[2024-11-19 09:01:04,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:01:04" (1/1) ...
[2024-11-19 09:01:05,021 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-19 09:01:05,421 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:01:05,449 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:01:05,458 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:01:05,464 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:01:05,470 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:01:05,484 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:01:05,489 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:01:05,491 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:01:05,497 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:01:05,498 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:01:05,499 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:01:05,504 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:01:05,510 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:01:05,524 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:01:05,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6bf2ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:05, skipping insertion in model container
[2024-11-19 09:01:05,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 09:01:05,525 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner
[2024-11-19 09:01:05,527 INFO L158 Benchmark]: Toolchain (without parser) took 580.47ms. Allocated memory is still 174.1MB. Free memory was 103.0MB in the beginning and 82.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-19 09:01:05,528 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 09:01:05,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.34ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 82.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-19 09:01:05,530 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.21ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 577.34ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 82.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- UnsupportedSyntaxResult [Line: 764]: 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_FNV_test1-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 f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 09:01:07,608 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-19 09:01:07,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-19 09:01:07,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 09:01:07,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 09:01:07,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 09:01:07,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 09:01:07,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 09:01:07,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 09:01:07,727 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-19 09:01:07,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 09:01:07,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 09:01:07,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 09:01:07,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-19 09:01:07,732 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-19 09:01:07,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 09:01:07,732 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-19 09:01:07,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-19 09:01:07,733 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-19 09:01:07,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-19 09:01:07,734 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-19 09:01:07,735 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-19 09:01:07,735 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-19 09:01:07,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 09:01:07,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-19 09:01:07,736 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-19 09:01:07,737 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-19 09:01:07,737 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-19 09:01:07,737 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-19 09:01:07,738 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-19 09:01:07,738 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-19 09:01:07,738 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 09:01:07,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-19 09:01:07,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 09:01:07,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-19 09:01:07,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 09:01:07,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 09:01:07,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 09:01:07,740 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-19 09:01:07,740 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-19 09:01:07,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 09:01:07,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 09:01:07,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 09:01:07,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 09:01:07,742 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 -> f0b44034f537cfca2c2eab71fbff4de4b57572a56ff00cd4bbb31f940e955385
[2024-11-19 09:01:08,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 09:01:08,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 09:01:08,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 09:01:08,104 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-19 09:01:08,104 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-19 09:01:08,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i
[2024-11-19 09:01:09,686 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-19 09:01:09,989 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-19 09:01:09,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test1-2.i
[2024-11-19 09:01:10,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f101710/193e606891734a80b2f80de4d71b1b8b/FLAG34e19d348
[2024-11-19 09:01:10,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f101710/193e606891734a80b2f80de4d71b1b8b
[2024-11-19 09:01:10,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 09:01:10,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 09:01:10,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 09:01:10,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 09:01:10,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 09:01:10,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:10,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9b5b9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10, skipping insertion in model container
[2024-11-19 09:01:10,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:10,103 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-19 09:01:10,571 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:01:10,614 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:01:10,622 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:01:10,630 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:01:10,639 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:01:10,660 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:01:10,662 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:01:10,666 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:01:10,689 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:01:10,690 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:01:10,692 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:01:10,702 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-19 09:01:10,707 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:01:10,728 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2024-11-19 09:01:10,740 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-19 09:01:10,780 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:01:10,803 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:01:10,805 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:01:10,811 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:01:10,818 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:01:10,828 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:01:10,829 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:01:10,831 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:01:10,832 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:01:10,832 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:01:10,833 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:01:10,837 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:01:10,840 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:01:10,846 INFO L200 MainTranslator]: Completed pre-run
[2024-11-19 09:01:10,919 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:01:10,977 INFO L204 MainTranslator]: Completed translation
[2024-11-19 09:01:10,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10 WrapperNode
[2024-11-19 09:01:10,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 09:01:10,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 09:01:10,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 09:01:10,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 09:01:10,986 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:01:10" (1/1) ...
[2024-11-19 09:01:11,021 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:01:10" (1/1) ...
[2024-11-19 09:01:11,088 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 807
[2024-11-19 09:01:11,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 09:01:11,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 09:01:11,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 09:01:11,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 09:01:11,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,198 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50].
[2024-11-19 09:01:11,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 09:01:11,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 09:01:11,268 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 09:01:11,268 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-19 09:01:11,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (1/1) ...
[2024-11-19 09:01:11,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 09:01:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 09:01:11,314 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:01:11,319 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:01:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-19 09:01:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-19 09:01:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-19 09:01:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-19 09:01:11,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2024-11-19 09:01:11,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2024-11-19 09:01:11,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0
[2024-11-19 09:01:11,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1
[2024-11-19 09:01:11,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0
[2024-11-19 09:01:11,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1
[2024-11-19 09:01:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-19 09:01:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 09:01:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-19 09:01:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-19 09:01:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-19 09:01:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-19 09:01:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-19 09:01:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-19 09:01:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-19 09:01:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-19 09:01:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-19 09:01:11,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 09:01:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 09:01:11,590 INFO L238 CfgBuilder]: Building ICFG
[2024-11-19 09:01:11,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 09:01:11,596 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2024-11-19 09:01:11,661 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock.
[2024-11-19 09:01:14,576 INFO L? ?]: Removed 907 outVars from TransFormulas that were not future-live.
[2024-11-19 09:01:14,577 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-19 09:01:14,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 09:01:14,634 INFO L316 CfgBuilder]: Removed 40 assume(true) statements.
[2024-11-19 09:01:14,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:01:14 BoogieIcfgContainer
[2024-11-19 09:01:14,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 09:01:14,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 09:01:14,638 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 09:01:14,641 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-19 09:01:14,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:01:10" (1/3) ...
[2024-11-19 09:01:14,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13781a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:01:14, skipping insertion in model container
[2024-11-19 09:01:14,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:01:10" (2/3) ...
[2024-11-19 09:01:14,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13781a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:01:14, skipping insertion in model container
[2024-11-19 09:01:14,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:01:14" (3/3) ...
[2024-11-19 09:01:14,645 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test1-2.i
[2024-11-19 09:01:14,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 09:01:14,660 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations.
[2024-11-19 09:01:14,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 09:01:14,741 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;@221866bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 09:01:14,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations.
[2024-11-19 09:01:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-19 09:01:14,762 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:14,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-19 09:01:14,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times
[2024-11-19 09:01:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:14,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768873146]
[2024-11-19 09:01:14,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:14,780 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:01:14,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:14,784 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:01:14,798 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:01:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:14,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:14,943 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:14,978 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:01:14,994 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:01:14,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:14,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768873146]
[2024-11-19 09:01:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768873146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 09:01:14,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077472547]
[2024-11-19 09:01:14,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:15,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:01:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:15,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:01:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:01:15,034 INFO L87 Difference]: Start difference. First operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:01:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:16,496 INFO L93 Difference]: Finished difference Result 801 states and 859 transitions.
[2024-11-19 09:01:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-19 09:01:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5
[2024-11-19 09:01:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:16,521 INFO L225 Difference]: With dead ends: 801
[2024-11-19 09:01:16,521 INFO L226 Difference]: Without dead ends: 799
[2024-11-19 09:01:16,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:01:16,527 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 535 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:16,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 663 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2024-11-19 09:01:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states.
[2024-11-19 09:01:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 797.
[2024-11-19 09:01:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 414 states have (on average 2.0) internal successors, (828), 791 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 854 transitions.
[2024-11-19 09:01:16,607 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 854 transitions. Word has length 5
[2024-11-19 09:01:16,607 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:16,607 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 854 transitions.
[2024-11-19 09:01:16,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:01:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 854 transitions.
[2024-11-19 09:01:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-19 09:01:16,608 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:16,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-19 09:01:16,611 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:01:16,809 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:01:16,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:16,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times
[2024-11-19 09:01:16,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:16,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197474563]
[2024-11-19 09:01:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:16,811 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:01:16,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:16,815 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:01:16,817 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:01:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:16,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:16,942 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:16,962 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:01:17,000 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:01:17,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:17,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197474563]
[2024-11-19 09:01:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197474563] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 09:01:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713117860]
[2024-11-19 09:01:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:17,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:01:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:17,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:01:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:01:17,005 INFO L87 Difference]: Start difference. First operand 797 states and 854 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:01:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:18,440 INFO L93 Difference]: Finished difference Result 872 states and 933 transitions.
[2024-11-19 09:01:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-19 09:01:18,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5
[2024-11-19 09:01:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:18,444 INFO L225 Difference]: With dead ends: 872
[2024-11-19 09:01:18,445 INFO L226 Difference]: Without dead ends: 872
[2024-11-19 09:01:18,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:01:18,446 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 263 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:18,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1050 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2024-11-19 09:01:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states.
[2024-11-19 09:01:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 824.
[2024-11-19 09:01:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 451 states have (on average 1.9778270509977827) internal successors, (892), 818 states have internal predecessors, (892), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 918 transitions.
[2024-11-19 09:01:18,476 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 918 transitions. Word has length 5
[2024-11-19 09:01:18,476 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:18,476 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 918 transitions.
[2024-11-19 09:01:18,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:01:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 918 transitions.
[2024-11-19 09:01:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-19 09:01:18,477 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:18,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-19 09:01:18,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-19 09:01:18,680 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:01:18,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1422972308, now seen corresponding path program 1 times
[2024-11-19 09:01:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811333857]
[2024-11-19 09:01:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:18,682 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:01:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:18,685 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:01:18,686 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:01:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:18,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:18,763 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:18,777 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:01:18,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:18,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:18,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811333857]
[2024-11-19 09:01:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811333857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:18,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:18,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:01:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8152779]
[2024-11-19 09:01:18,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:18,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:01:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:18,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:01:18,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:01:18,781 INFO L87 Difference]: Start difference. First operand 824 states and 918 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:18,875 INFO L93 Difference]: Finished difference Result 1397 states and 1554 transitions.
[2024-11-19 09:01:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-19 09:01:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-19 09:01:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:18,884 INFO L225 Difference]: With dead ends: 1397
[2024-11-19 09:01:18,884 INFO L226 Difference]: Without dead ends: 1397
[2024-11-19 09:01:18,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:01:18,886 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 555 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:18,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1893 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 09:01:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states.
[2024-11-19 09:01:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 825.
[2024-11-19 09:01:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 452 states have (on average 1.9756637168141593) internal successors, (893), 819 states have internal predecessors, (893), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 919 transitions.
[2024-11-19 09:01:18,912 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 919 transitions. Word has length 6
[2024-11-19 09:01:18,912 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:18,912 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 919 transitions.
[2024-11-19 09:01:18,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 919 transitions.
[2024-11-19 09:01:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-19 09:01:18,913 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:18,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:01:18,917 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:01:19,113 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:01:19,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:19,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times
[2024-11-19 09:01:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:19,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165236012]
[2024-11-19 09:01:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:19,116 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:01:19,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:19,119 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:01:19,122 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:01:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:19,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:19,240 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:19,252 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:01:19,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:19,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165236012]
[2024-11-19 09:01:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165236012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:19,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:01:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646223221]
[2024-11-19 09:01:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:19,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:01:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:01:19,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:01:19,255 INFO L87 Difference]: Start difference. First operand 825 states and 919 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:19,286 INFO L93 Difference]: Finished difference Result 783 states and 876 transitions.
[2024-11-19 09:01:19,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-19 09:01:19,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11
[2024-11-19 09:01:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:19,290 INFO L225 Difference]: With dead ends: 783
[2024-11-19 09:01:19,290 INFO L226 Difference]: Without dead ends: 783
[2024-11-19 09:01:19,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:01:19,291 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 71 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1515 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:01:19,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1515 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 09:01:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states.
[2024-11-19 09:01:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783.
[2024-11-19 09:01:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 434 states have (on average 1.9585253456221199) internal successors, (850), 777 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 876 transitions.
[2024-11-19 09:01:19,320 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 876 transitions. Word has length 11
[2024-11-19 09:01:19,320 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:19,320 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 876 transitions.
[2024-11-19 09:01:19,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 876 transitions.
[2024-11-19 09:01:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-11-19 09:01:19,323 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:19,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:01:19,329 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:01:19,524 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:01:19,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:19,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:19,525 INFO L85 PathProgramCache]: Analyzing trace with hash 614317568, now seen corresponding path program 1 times
[2024-11-19 09:01:19,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:19,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284175270]
[2024-11-19 09:01:19,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:19,526 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:01:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:19,530 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:01:19,531 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:01:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:19,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:19,649 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:19,667 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:01:19,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:19,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:19,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284175270]
[2024-11-19 09:01:19,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284175270] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:19,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:19,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 09:01:19,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830222791]
[2024-11-19 09:01:19,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:19,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:01:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:19,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:01:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:01:19,670 INFO L87 Difference]: Start difference. First operand 783 states and 876 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:19,747 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions.
[2024-11-19 09:01:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-19 09:01:19,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2024-11-19 09:01:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:19,751 INFO L225 Difference]: With dead ends: 761
[2024-11-19 09:01:19,751 INFO L226 Difference]: Without dead ends: 761
[2024-11-19 09:01:19,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:01:19,752 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 48 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:19,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 09:01:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states.
[2024-11-19 09:01:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761.
[2024-11-19 09:01:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 426 states have (on average 1.9272300469483568) internal successors, (821), 755 states have internal predecessors, (821), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 847 transitions.
[2024-11-19 09:01:19,767 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 847 transitions. Word has length 13
[2024-11-19 09:01:19,767 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:19,767 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 847 transitions.
[2024-11-19 09:01:19,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 847 transitions.
[2024-11-19 09:01:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-19 09:01:19,769 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:19,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:01:19,774 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:01:19,970 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:01:19,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:19,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash -957630610, now seen corresponding path program 1 times
[2024-11-19 09:01:19,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145240304]
[2024-11-19 09:01:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:19,971 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:01:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:19,973 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:01:19,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-11-19 09:01:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:20,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:20,104 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:20,110 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:01:20,175 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:01:20,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:20,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145240304]
[2024-11-19 09:01:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145240304] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:20,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:20,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:01:20,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80709591]
[2024-11-19 09:01:20,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:20,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:01:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:20,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:01:20,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:01:20,178 INFO L87 Difference]: Start difference. First operand 761 states and 847 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:21,734 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions.
[2024-11-19 09:01:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-19 09:01:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27
[2024-11-19 09:01:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:21,737 INFO L225 Difference]: With dead ends: 761
[2024-11-19 09:01:21,738 INFO L226 Difference]: Without dead ends: 761
[2024-11-19 09:01:21,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:01:21,738 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 472 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:21,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 944 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2024-11-19 09:01:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states.
[2024-11-19 09:01:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 757.
[2024-11-19 09:01:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 426 states have (on average 1.9178403755868545) internal successors, (817), 751 states have internal predecessors, (817), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 843 transitions.
[2024-11-19 09:01:21,754 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 843 transitions. Word has length 27
[2024-11-19 09:01:21,754 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:21,754 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 843 transitions.
[2024-11-19 09:01:21,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 843 transitions.
[2024-11-19 09:01:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-19 09:01:21,755 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:21,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:01:21,760 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:01:21,956 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:01:21,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:21,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -957630609, now seen corresponding path program 1 times
[2024-11-19 09:01:21,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:21,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027858853]
[2024-11-19 09:01:21,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:21,957 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:01:21,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:21,959 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:01:21,960 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:01:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:22,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:22,080 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:22,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-11-19 09:01:22,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:01:22,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:22,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027858853]
[2024-11-19 09:01:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027858853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:01:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761422727]
[2024-11-19 09:01:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:22,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:01:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:22,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:01:22,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:01:22,324 INFO L87 Difference]: Start difference. First operand 757 states and 843 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:24,151 INFO L93 Difference]: Finished difference Result 805 states and 858 transitions.
[2024-11-19 09:01:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-19 09:01:24,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27
[2024-11-19 09:01:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:24,155 INFO L225 Difference]: With dead ends: 805
[2024-11-19 09:01:24,155 INFO L226 Difference]: Without dead ends: 805
[2024-11-19 09:01:24,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:01:24,156 INFO L432 NwaCegarLoop]: 680 mSDtfsCounter, 196 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:24,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1371 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2024-11-19 09:01:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states.
[2024-11-19 09:01:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 753.
[2024-11-19 09:01:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 426 states have (on average 1.908450704225352) internal successors, (813), 747 states have internal predecessors, (813), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 839 transitions.
[2024-11-19 09:01:24,174 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 839 transitions. Word has length 27
[2024-11-19 09:01:24,174 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:24,175 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 839 transitions.
[2024-11-19 09:01:24,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:01:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 839 transitions.
[2024-11-19 09:01:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2024-11-19 09:01:24,176 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:24,176 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]
[2024-11-19 09:01:24,182 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:01:24,377 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:01:24,378 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:24,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -3860248, now seen corresponding path program 1 times
[2024-11-19 09:01:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018159081]
[2024-11-19 09:01:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:24,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-19 09:01:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:24,383 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:01:24,384 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:01:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:24,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:24,551 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:24,600 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:01:24,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:24,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018159081]
[2024-11-19 09:01:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018159081] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:24,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:24,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 09:01:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086289739]
[2024-11-19 09:01:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:01:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:24,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:01:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:01:24,606 INFO L87 Difference]: Start difference. First operand 753 states and 839 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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:01:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:24,663 INFO L93 Difference]: Finished difference Result 747 states and 829 transitions.
[2024-11-19 09:01:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-19 09:01:24,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43
[2024-11-19 09:01:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:24,667 INFO L225 Difference]: With dead ends: 747
[2024-11-19 09:01:24,668 INFO L226 Difference]: Without dead ends: 747
[2024-11-19 09:01:24,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:01:24,669 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 21 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2183 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:01:24,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 09:01:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states.
[2024-11-19 09:01:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747.
[2024-11-19 09:01:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 420 states have (on average 1.911904761904762) internal successors, (803), 741 states have internal predecessors, (803), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 829 transitions.
[2024-11-19 09:01:24,689 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 829 transitions. Word has length 43
[2024-11-19 09:01:24,689 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:24,689 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 829 transitions.
[2024-11-19 09:01:24,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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:01:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 829 transitions.
[2024-11-19 09:01:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2024-11-19 09:01:24,691 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:24,692 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]
[2024-11-19 09:01:24,700 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:01:24,892 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:01:24,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:24,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash 168131124, now seen corresponding path program 1 times
[2024-11-19 09:01:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666206478]
[2024-11-19 09:01:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:24,894 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:01:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:24,895 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:01:24,896 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:01:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:25,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:25,072 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:25,322 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:01:25,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:25,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666206478]
[2024-11-19 09:01:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666206478] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:25,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:01:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065753716]
[2024-11-19 09:01:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:25,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:01:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:01:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:01:25,324 INFO L87 Difference]: Start difference. First operand 747 states and 829 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:01:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:25,528 INFO L93 Difference]: Finished difference Result 965 states and 1076 transitions.
[2024-11-19 09:01:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-19 09:01:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51
[2024-11-19 09:01:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:25,535 INFO L225 Difference]: With dead ends: 965
[2024-11-19 09:01:25,535 INFO L226 Difference]: Without dead ends: 965
[2024-11-19 09:01:25,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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:01:25,536 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 178 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:25,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1512 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-19 09:01:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states.
[2024-11-19 09:01:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 794.
[2024-11-19 09:01:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 467 states have (on average 1.8201284796573876) internal successors, (850), 788 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 876 transitions.
[2024-11-19 09:01:25,554 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 876 transitions. Word has length 51
[2024-11-19 09:01:25,554 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:25,555 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 876 transitions.
[2024-11-19 09:01:25,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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:01:25,555 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 876 transitions.
[2024-11-19 09:01:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2024-11-19 09:01:25,559 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:25,559 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:01:25,567 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:01:25,760 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:01:25,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:25,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:25,761 INFO L85 PathProgramCache]: Analyzing trace with hash 754975115, now seen corresponding path program 1 times
[2024-11-19 09:01:25,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:25,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038247998]
[2024-11-19 09:01:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:25,762 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:01:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:25,765 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:01:25,766 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:01:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:26,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:26,035 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:26,045 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:01:26,054 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:01:26,531 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-19 09:01:26,533 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:01:26,552 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-11-19 09:01:26,552 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:01:26,564 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:01:26,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:26,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038247998]
[2024-11-19 09:01:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038247998] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:01:26,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304803634]
[2024-11-19 09:01:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:01:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:26,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:01:26,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:01:26,566 INFO L87 Difference]: Start difference. First operand 794 states and 876 transitions. Second operand has 4 states, 3 states have (on average 18.0) 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:01:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:27,794 INFO L93 Difference]: Finished difference Result 756 states and 838 transitions.
[2024-11-19 09:01:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-19 09:01:27,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) 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:01:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:27,798 INFO L225 Difference]: With dead ends: 756
[2024-11-19 09:01:27,798 INFO L226 Difference]: Without dead ends: 756
[2024-11-19 09:01:27,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:01:27,799 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 374 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:27,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 682 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2024-11-19 09:01:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states.
[2024-11-19 09:01:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 719.
[2024-11-19 09:01:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 430 states have (on average 1.716279069767442) internal successors, (738), 713 states have internal predecessors, (738), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 764 transitions.
[2024-11-19 09:01:27,816 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 764 transitions. Word has length 54
[2024-11-19 09:01:27,817 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:27,817 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 764 transitions.
[2024-11-19 09:01:27,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) 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:01:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 764 transitions.
[2024-11-19 09:01:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2024-11-19 09:01:27,818 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:27,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:27,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2024-11-19 09:01:28,020 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:01:28,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:28,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100217, now seen corresponding path program 1 times
[2024-11-19 09:01:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:28,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855216571]
[2024-11-19 09:01:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:28,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-19 09:01:28,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:28,025 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:01:28,026 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:01:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:28,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:28,268 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:28,283 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:01:28,303 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:01:28,325 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:01:28,334 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:01:28,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:28,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855216571]
[2024-11-19 09:01:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855216571] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:28,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:28,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 09:01:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103892292]
[2024-11-19 09:01:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:28,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 09:01:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:28,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 09:01:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:01:28,336 INFO L87 Difference]: Start difference. First operand 719 states and 764 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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:01:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:29,664 INFO L93 Difference]: Finished difference Result 718 states and 763 transitions.
[2024-11-19 09:01:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-19 09:01:29,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59
[2024-11-19 09:01:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:29,667 INFO L225 Difference]: With dead ends: 718
[2024-11-19 09:01:29,667 INFO L226 Difference]: Without dead ends: 718
[2024-11-19 09:01:29,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:01:29,668 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 2 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:29,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1842 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2024-11-19 09:01:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states.
[2024-11-19 09:01:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718.
[2024-11-19 09:01:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 430 states have (on average 1.713953488372093) internal successors, (737), 712 states have internal predecessors, (737), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 763 transitions.
[2024-11-19 09:01:29,680 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 763 transitions. Word has length 59
[2024-11-19 09:01:29,681 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:29,681 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 763 transitions.
[2024-11-19 09:01:29,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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:01:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 763 transitions.
[2024-11-19 09:01:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2024-11-19 09:01:29,682 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:29,682 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]
[2024-11-19 09:01:29,690 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:01:29,882 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:01:29,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:29,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100216, now seen corresponding path program 1 times
[2024-11-19 09:01:29,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:29,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897795704]
[2024-11-19 09:01:29,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:29,884 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:01:29,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:29,885 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:01:29,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-11-19 09:01:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:30,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:30,158 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:30,170 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:01:30,197 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:01:30,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1
[2024-11-19 09:01:30,251 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:01:30,272 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:01:30,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:30,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:30,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897795704]
[2024-11-19 09:01:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897795704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 09:01:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466586249]
[2024-11-19 09:01:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:30,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 09:01:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 09:01:30,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:01:30,274 INFO L87 Difference]: Start difference. First operand 718 states and 763 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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:01:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:31,953 INFO L93 Difference]: Finished difference Result 717 states and 762 transitions.
[2024-11-19 09:01:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-19 09:01:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59
[2024-11-19 09:01:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:31,956 INFO L225 Difference]: With dead ends: 717
[2024-11-19 09:01:31,956 INFO L226 Difference]: Without dead ends: 717
[2024-11-19 09:01:31,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:01:31,956 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:31,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1865 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2024-11-19 09:01:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states.
[2024-11-19 09:01:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717.
[2024-11-19 09:01:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 429 states have (on average 1.7156177156177157) internal successors, (736), 711 states have internal predecessors, (736), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-19 09:01:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 762 transitions.
[2024-11-19 09:01:31,968 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 762 transitions. Word has length 59
[2024-11-19 09:01:31,968 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:31,968 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 762 transitions.
[2024-11-19 09:01:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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:01:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 762 transitions.
[2024-11-19 09:01:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2024-11-19 09:01:31,969 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:31,970 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:01:31,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2024-11-19 09:01:32,180 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:01:32,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:32,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:32,181 INFO L85 PathProgramCache]: Analyzing trace with hash 216241902, now seen corresponding path program 1 times
[2024-11-19 09:01:32,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:32,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727402518]
[2024-11-19 09:01:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:32,181 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:01:32,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:32,183 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:01:32,184 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:01:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:32,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:32,426 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:32,453 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:01:32,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:01:32,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:32,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727402518]
[2024-11-19 09:01:32,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727402518] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:01:32,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:01:32,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 09:01:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677417053]
[2024-11-19 09:01:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:01:32,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:01:32,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:01:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:01:32,457 INFO L87 Difference]: Start difference. First operand 717 states and 762 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:01:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:32,498 INFO L93 Difference]: Finished difference Result 720 states and 766 transitions.
[2024-11-19 09:01:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-19 09:01:32,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 67
[2024-11-19 09:01:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:32,502 INFO L225 Difference]: With dead ends: 720
[2024-11-19 09:01:32,502 INFO L226 Difference]: Without dead ends: 720
[2024-11-19 09:01:32,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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:01:32,503 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 0 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2128 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:01:32,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-19 09:01:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states.
[2024-11-19 09:01:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720.
[2024-11-19 09:01:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 431 states have (on average 1.71461716937355) internal successors, (739), 714 states have internal predecessors, (739), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-19 09:01:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 766 transitions.
[2024-11-19 09:01:32,518 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 766 transitions. Word has length 67
[2024-11-19 09:01:32,519 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:32,519 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 766 transitions.
[2024-11-19 09:01:32,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:01:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 766 transitions.
[2024-11-19 09:01:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2024-11-19 09:01:32,520 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:32,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:01:32,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0
[2024-11-19 09:01:32,720 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:01:32,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash -572148029, now seen corresponding path program 1 times
[2024-11-19 09:01:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:32,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210068424]
[2024-11-19 09:01:32,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:01:32,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-19 09:01:32,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:32,724 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:01:32,725 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:01:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:01:32,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:32,934 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:32,963 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:01:32,963 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 09:01:33,035 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:01:33,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:33,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210068424]
[2024-11-19 09:01:33,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210068424] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 09:01:33,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-19 09:01:33,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-19 09:01:33,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043190557]
[2024-11-19 09:01:33,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-19 09:01:33,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-19 09:01:33,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:33,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-19 09:01:33,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-19 09:01:33,040 INFO L87 Difference]: Start difference. First operand 720 states and 766 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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:01:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:33,178 INFO L93 Difference]: Finished difference Result 732 states and 783 transitions.
[2024-11-19 09:01:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-19 09:01:33,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 68
[2024-11-19 09:01:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:33,182 INFO L225 Difference]: With dead ends: 732
[2024-11-19 09:01:33,182 INFO L226 Difference]: Without dead ends: 732
[2024-11-19 09:01:33,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 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:01:33,184 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 5 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:33,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2835 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-19 09:01:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states.
[2024-11-19 09:01:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730.
[2024-11-19 09:01:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 440 states have (on average 1.7136363636363636) internal successors, (754), 723 states have internal predecessors, (754), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-19 09:01:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 781 transitions.
[2024-11-19 09:01:33,200 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 781 transitions. Word has length 68
[2024-11-19 09:01:33,201 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:33,201 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 781 transitions.
[2024-11-19 09:01:33,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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:01:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 781 transitions.
[2024-11-19 09:01:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2024-11-19 09:01:33,202 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:33,202 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]
[2024-11-19 09:01:33,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0
[2024-11-19 09:01:33,402 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:01:33,403 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:33,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1280795694, now seen corresponding path program 2 times
[2024-11-19 09:01:33,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:33,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134915924]
[2024-11-19 09:01:33,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 09:01:33,404 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:01:33,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:33,405 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:01:33,406 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:01:33,835 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-19 09:01:33,835 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:01:33,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:33,847 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:33,901 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:01:33,902 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 09:01:34,064 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:01:34,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134915924]
[2024-11-19 09:01:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134915924] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 09:01:34,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-19 09:01:34,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14
[2024-11-19 09:01:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638135935]
[2024-11-19 09:01:34,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-19 09:01:34,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-19 09:01:34,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-19 09:01:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182
[2024-11-19 09:01:34,066 INFO L87 Difference]: Start difference. First operand 730 states and 781 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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:01:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:34,458 INFO L93 Difference]: Finished difference Result 745 states and 802 transitions.
[2024-11-19 09:01:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2024-11-19 09:01:34,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71
[2024-11-19 09:01:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:34,461 INFO L225 Difference]: With dead ends: 745
[2024-11-19 09:01:34,461 INFO L226 Difference]: Without dead ends: 739
[2024-11-19 09:01:34,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506
[2024-11-19 09:01:34,462 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 14 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:34,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4965 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-19 09:01:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states.
[2024-11-19 09:01:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739.
[2024-11-19 09:01:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 449 states have (on average 1.7037861915367483) internal successors, (765), 732 states have internal predecessors, (765), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-19 09:01:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 792 transitions.
[2024-11-19 09:01:34,475 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 792 transitions. Word has length 71
[2024-11-19 09:01:34,475 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:34,475 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 792 transitions.
[2024-11-19 09:01:34,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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:01:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 792 transitions.
[2024-11-19 09:01:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-19 09:01:34,477 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:34,477 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]
[2024-11-19 09:01:34,489 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:01:34,678 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:01:34,678 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1827542002, now seen corresponding path program 3 times
[2024-11-19 09:01:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079337053]
[2024-11-19 09:01:34,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 09:01:34,679 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:01:34,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:34,680 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:01:34,681 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:01:35,216 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s)
[2024-11-19 09:01:35,217 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:01:35,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:35,232 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:35,372 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:01:35,372 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 09:01:35,966 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:01:35,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079337053]
[2024-11-19 09:01:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079337053] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 09:01:35,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-19 09:01:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2024-11-19 09:01:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517734594]
[2024-11-19 09:01:35,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-19 09:01:35,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-11-19 09:01:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:35,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-19 09:01:35,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650
[2024-11-19 09:01:35,969 INFO L87 Difference]: Start difference. First operand 739 states and 792 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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:01:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:37,314 INFO L93 Difference]: Finished difference Result 763 states and 831 transitions.
[2024-11-19 09:01:37,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2024-11-19 09:01:37,315 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77
[2024-11-19 09:01:37,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:37,317 INFO L225 Difference]: With dead ends: 763
[2024-11-19 09:01:37,317 INFO L226 Difference]: Without dead ends: 757
[2024-11-19 09:01:37,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 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:01:37,322 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 23 mSDsluCounter, 8507 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9219 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:37,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9219 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-19 09:01:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states.
[2024-11-19 09:01:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757.
[2024-11-19 09:01:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 467 states have (on average 1.6873661670235547) internal successors, (788), 750 states have internal predecessors, (788), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-19 09:01:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 815 transitions.
[2024-11-19 09:01:37,336 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 815 transitions. Word has length 77
[2024-11-19 09:01:37,336 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:37,336 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 815 transitions.
[2024-11-19 09:01:37,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 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:01:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 815 transitions.
[2024-11-19 09:01:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2024-11-19 09:01:37,337 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:37,337 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]
[2024-11-19 09:01:37,347 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:01:37,538 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:01:37,538 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:37,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash -473119794, now seen corresponding path program 4 times
[2024-11-19 09:01:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143994417]
[2024-11-19 09:01:37,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 09:01:37,540 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:01:37,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:37,542 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:01:37,543 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:01:37,921 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 09:01:37,921 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:01:37,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:37,937 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:38,259 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:01:38,259 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 09:01:39,485 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:01:39,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:39,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143994417]
[2024-11-19 09:01:39,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143994417] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-19 09:01:39,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-19 09:01:39,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50
[2024-11-19 09:01:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761527505]
[2024-11-19 09:01:39,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-19 09:01:39,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2024-11-19 09:01:39,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:01:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2024-11-19 09:01:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450
[2024-11-19 09:01:39,488 INFO L87 Difference]: Start difference. First operand 757 states and 815 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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:01:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-19 09:01:44,034 INFO L93 Difference]: Finished difference Result 797 states and 887 transitions.
[2024-11-19 09:01:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states.
[2024-11-19 09:01:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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 89
[2024-11-19 09:01:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-19 09:01:44,038 INFO L225 Difference]: With dead ends: 797
[2024-11-19 09:01:44,038 INFO L226 Difference]: Without dead ends: 793
[2024-11-19 09:01:44,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 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:01:44,041 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 34 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16998 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2024-11-19 09:01:44,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16998 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2024-11-19 09:01:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states.
[2024-11-19 09:01:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791.
[2024-11-19 09:01:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 501 states have (on average 1.6646706586826348) internal successors, (834), 784 states have internal predecessors, (834), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14)
[2024-11-19 09:01:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 861 transitions.
[2024-11-19 09:01:44,056 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 861 transitions. Word has length 89
[2024-11-19 09:01:44,056 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-19 09:01:44,057 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 861 transitions.
[2024-11-19 09:01:44,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 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:01:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 861 transitions.
[2024-11-19 09:01:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-19 09:01:44,058 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-19 09:01:44,058 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]
[2024-11-19 09:01:44,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0
[2024-11-19 09:01:44,258 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:01:44,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] ===
[2024-11-19 09:01:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:01:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash 666044590, now seen corresponding path program 5 times
[2024-11-19 09:01:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:01:44,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964670914]
[2024-11-19 09:01:44,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 09:01:44,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:01:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:01:44,264 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:01:44,266 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:01:45,447 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s)
[2024-11-19 09:01:45,448 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:01:45,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 58 conjuncts are in the unsatisfiable core
[2024-11-19 09:01:45,474 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:01:45,492 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size
[2024-11-19 09:01:45,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22
[2024-11-19 09:01:45,798 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size
[2024-11-19 09:01:45,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45
[2024-11-19 09:01:45,853 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:01:45,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24
[2024-11-19 09:01:48,318 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size
[2024-11-19 09:01:48,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59
[2024-11-19 09:01:48,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27
[2024-11-19 09:01:48,453 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:01:48,454 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-19 09:01:48,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false
[2024-11-19 09:01:48,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:01:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964670914]
[2024-11-19 09:01:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964670914] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-19 09:01:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [458132125]
[2024-11-19 09:01:48,864 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 09:01:48,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt
[2024-11-19 09:01:48,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4
[2024-11-19 09:01:48,865 INFO L229 MonitoredProcess]: Starting monitored process 20 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:01:48,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process