./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:07:15,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:07:15,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:07:15,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:07:15,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:07:15,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:07:15,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:07:15,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:07:15,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:07:15,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:07:15,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:07:15,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:07:15,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:07:15,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:07:15,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:07:15,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:07:15,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:07:15,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:07:15,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:07:15,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:07:15,260 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:07:15,260 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:07:15,260 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:07:15,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:07:15,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:07:15,261 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:07:15,261 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:07:15,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:07:15,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:07:15,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:07:15,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:07:15,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:07:15,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:07:15,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:07:15,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:07:15,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:07:15,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:07:15,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:07:15,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:07:15,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:07:15,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:07:15,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:07:15,268 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-19 09:07:15,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:07:15,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:07:15,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:07:15,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:07:15,567 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:07:15,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-19 09:07:17,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:07:17,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:07:17,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-19 09:07:17,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d75a765/c4234b7f78ce4c4c981b94ef2deaa70b/FLAGd13805179 [2024-11-19 09:07:17,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2d75a765/c4234b7f78ce4c4c981b94ef2deaa70b [2024-11-19 09:07:17,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:07:17,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:07:17,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:07:17,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:07:17,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:07:17,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:07:17" (1/1) ... [2024-11-19 09:07:17,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e129603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:17, skipping insertion in model container [2024-11-19 09:07:17,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:07:17" (1/1) ... [2024-11-19 09:07:17,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:07:17,891 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:07:17,928 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:07:17,958 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:07:17,964 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:07:17,975 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:07:18,054 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:07:18,054 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:07:18,056 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:07:18,057 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:07:18,062 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:07:18,064 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:07:18,069 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:18,070 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:07:18,071 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:07:18,079 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:07:18,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:07:18,109 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:07:18,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@12a8c2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:18, skipping insertion in model container [2024-11-19 09:07:18,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:07:18,111 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:07:18,113 INFO L158 Benchmark]: Toolchain (without parser) took 771.63ms. Allocated memory is still 180.4MB. Free memory was 110.7MB in the beginning and 144.9MB in the end (delta: -34.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:07:18,113 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:07:18,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.14ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 144.9MB in the end (delta: -34.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:07:18,116 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.14ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 144.9MB in the end (delta: -34.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:07:20,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:07:20,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:07:20,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:07:20,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:07:20,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:07:20,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:07:20,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:07:20,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:07:20,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:07:20,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:07:20,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:07:20,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:07:20,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:07:20,163 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:07:20,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:07:20,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:07:20,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:07:20,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:07:20,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:07:20,168 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:07:20,168 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:07:20,169 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:07:20,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:07:20,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:07:20,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:07:20,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:07:20,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:07:20,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:07:20,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:07:20,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:07:20,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:07:20,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:07:20,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:07:20,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:07:20,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:07:20,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:07:20,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:07:20,174 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:07:20,175 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:07:20,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:07:20,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:07:20,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:07:20,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:07:20,176 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-19 09:07:20,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:07:20,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:07:20,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:07:20,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:07:20,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:07:20,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-19 09:07:22,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:07:22,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:07:22,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-19 09:07:22,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df7d859/f5c21e2af3c2470ba428fac5163a0b25/FLAG10a646747 [2024-11-19 09:07:22,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57df7d859/f5c21e2af3c2470ba428fac5163a0b25 [2024-11-19 09:07:22,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:07:22,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:07:22,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:07:22,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:07:22,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:07:22,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:07:22" (1/1) ... [2024-11-19 09:07:22,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6308f92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:22, skipping insertion in model container [2024-11-19 09:07:22,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:07:22" (1/1) ... [2024-11-19 09:07:22,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:07:23,236 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:07:23,263 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:07:23,268 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:07:23,281 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,289 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:07:23,333 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:07:23,335 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,338 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:07:23,339 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:07:23,341 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,343 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,345 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,345 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,346 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,350 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:07:23,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:07:23,374 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:07:23,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:07:23,416 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:07:23,428 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,430 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:07:23,432 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:07:23,450 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:07:23,478 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,478 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,480 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:07:23,481 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,482 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:07:23,483 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:07:23,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:07:23,485 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:07:23,486 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:07:23,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:07:23,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:07:23,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:07:23,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:07:23,661 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:07:23,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23 WrapperNode [2024-11-19 09:07:23,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:07:23,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:07:23,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:07:23,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:07:23,670 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:07:23" (1/1) ... [2024-11-19 09:07:23,719 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:07:23" (1/1) ... [2024-11-19 09:07:23,798 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1059 [2024-11-19 09:07:23,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:07:23,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:07:23,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:07:23,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:07:23,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:23,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:23,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:23,921 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-19 09:07:23,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:23,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:23,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:24,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:24,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:24,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:24,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:07:24,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:07:24,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:07:24,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:07:24,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (1/1) ... [2024-11-19 09:07:24,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:07:24,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:07:24,076 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:07:24,079 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:07:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:07:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:07:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:07:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:07:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:07:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:07:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:07:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:07:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:07:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:07:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:07:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:07:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:07:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:07:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:07:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:07:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:07:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:07:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:07:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:07:24,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:07:24,357 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:07:24,360 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:07:24,362 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:07:24,421 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:07:24,445 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:07:27,795 INFO L? ?]: Removed 1087 outVars from TransFormulas that were not future-live. [2024-11-19 09:07:27,796 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:07:27,842 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:07:27,842 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 09:07:27,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:07:27 BoogieIcfgContainer [2024-11-19 09:07:27,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:07:27,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:07:27,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:07:27,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:07:27,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:07:22" (1/3) ... [2024-11-19 09:07:27,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7289caf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:07:27, skipping insertion in model container [2024-11-19 09:07:27,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:07:23" (2/3) ... [2024-11-19 09:07:27,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7289caf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:07:27, skipping insertion in model container [2024-11-19 09:07:27,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:07:27" (3/3) ... [2024-11-19 09:07:27,853 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-2.i [2024-11-19 09:07:27,870 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:07:27,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-19 09:07:27,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:07:27,981 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;@21ab21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:07:27,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-19 09:07:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 1060 states, 533 states have (on average 2.2157598499061915) internal successors, (1181), 1055 states have internal predecessors, (1181), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 09:07:28,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:28,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 09:07:28,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:28,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1758428, now seen corresponding path program 1 times [2024-11-19 09:07:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:28,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122849339] [2024-11-19 09:07:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:28,022 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:07:28,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:28,025 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:07:28,027 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:07:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:28,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:07:28,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:28,278 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-19 09:07:28,280 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:07:28,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:28,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122849339] [2024-11-19 09:07:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122849339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:28,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48889721] [2024-11-19 09:07:28,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:28,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:28,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:07:28,340 INFO L87 Difference]: Start difference. First operand has 1060 states, 533 states have (on average 2.2157598499061915) internal successors, (1181), 1055 states have internal predecessors, (1181), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:30,131 INFO L93 Difference]: Finished difference Result 1448 states and 1549 transitions. [2024-11-19 09:07:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:30,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 09:07:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:30,150 INFO L225 Difference]: With dead ends: 1448 [2024-11-19 09:07:30,150 INFO L226 Difference]: Without dead ends: 1445 [2024-11-19 09:07:30,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:07:30,154 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 426 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1550 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:30,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1483 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 1550 Unchecked, 1.7s Time] [2024-11-19 09:07:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-19 09:07:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1048. [2024-11-19 09:07:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 527 states have (on average 2.0853889943074004) internal successors, (1099), 1043 states have internal predecessors, (1099), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1105 transitions. [2024-11-19 09:07:30,245 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1105 transitions. Word has length 4 [2024-11-19 09:07:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:30,246 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1105 transitions. [2024-11-19 09:07:30,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1105 transitions. [2024-11-19 09:07:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 09:07:30,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:30,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 09:07:30,249 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:07:30,447 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:07:30,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:30,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-19 09:07:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742362196] [2024-11-19 09:07:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:30,449 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:07:30,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:30,452 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:07:30,468 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:07:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:30,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:07:30,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:30,591 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:07:30,605 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:07:30,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:30,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742362196] [2024-11-19 09:07:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742362196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:30,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:07:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668333023] [2024-11-19 09:07:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:30,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:07:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:30,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:07:30,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:30,609 INFO L87 Difference]: Start difference. First operand 1048 states and 1105 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:32,083 INFO L93 Difference]: Finished difference Result 1224 states and 1291 transitions. [2024-11-19 09:07:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:07:32,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 09:07:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:32,088 INFO L225 Difference]: With dead ends: 1224 [2024-11-19 09:07:32,088 INFO L226 Difference]: Without dead ends: 1224 [2024-11-19 09:07:32,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:32,090 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 968 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:32,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 778 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:07:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-19 09:07:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1045. [2024-11-19 09:07:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 535 states have (on average 2.0504672897196263) internal successors, (1097), 1040 states have internal predecessors, (1097), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1103 transitions. [2024-11-19 09:07:32,114 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1103 transitions. Word has length 4 [2024-11-19 09:07:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:32,114 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1103 transitions. [2024-11-19 09:07:32,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1103 transitions. [2024-11-19 09:07:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 09:07:32,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:32,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 09:07:32,119 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:07:32,316 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:07:32,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:32,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-19 09:07:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875171140] [2024-11-19 09:07:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:32,318 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:07:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:32,325 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:07:32,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:07:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:32,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:07:32,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:32,442 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:07:32,458 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:07:32,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:32,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:32,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875171140] [2024-11-19 09:07:32,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875171140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:32,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:32,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:07:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625444813] [2024-11-19 09:07:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:32,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:07:32,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:07:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:32,461 INFO L87 Difference]: Start difference. First operand 1045 states and 1103 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:34,359 INFO L93 Difference]: Finished difference Result 1457 states and 1547 transitions. [2024-11-19 09:07:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:07:34,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 09:07:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:34,364 INFO L225 Difference]: With dead ends: 1457 [2024-11-19 09:07:34,364 INFO L226 Difference]: Without dead ends: 1457 [2024-11-19 09:07:34,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:34,365 INFO L432 NwaCegarLoop]: 904 mSDtfsCounter, 444 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:34,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1483 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:07:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-11-19 09:07:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1170. [2024-11-19 09:07:34,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 661 states have (on average 2.006051437216339) internal successors, (1326), 1165 states have internal predecessors, (1326), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1332 transitions. [2024-11-19 09:07:34,391 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1332 transitions. Word has length 4 [2024-11-19 09:07:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:34,391 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1332 transitions. [2024-11-19 09:07:34,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1332 transitions. [2024-11-19 09:07:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:07:34,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:34,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:34,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:34,593 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:07:34,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:34,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-19 09:07:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:34,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596512813] [2024-11-19 09:07:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:34,595 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:07:34,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:34,598 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:07:34,600 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:07:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:34,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:07:34,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:34,756 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:07:34,768 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:07:34,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:07:34,852 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:07:34,871 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:07:34,871 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:07:34,894 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:07:34,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:34,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596512813] [2024-11-19 09:07:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596512813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:34,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:34,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749959701] [2024-11-19 09:07:34,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:34,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:34,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:34,897 INFO L87 Difference]: Start difference. First operand 1170 states and 1332 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:37,036 INFO L93 Difference]: Finished difference Result 1338 states and 1508 transitions. [2024-11-19 09:07:37,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:37,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 09:07:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:37,041 INFO L225 Difference]: With dead ends: 1338 [2024-11-19 09:07:37,042 INFO L226 Difference]: Without dead ends: 1338 [2024-11-19 09:07:37,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:37,043 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 1252 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:37,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 451 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 09:07:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-19 09:07:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1033. [2024-11-19 09:07:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 535 states have (on average 2.0261682242990653) internal successors, (1084), 1028 states have internal predecessors, (1084), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1090 transitions. [2024-11-19 09:07:37,066 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1090 transitions. Word has length 8 [2024-11-19 09:07:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:37,066 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1090 transitions. [2024-11-19 09:07:37,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1090 transitions. [2024-11-19 09:07:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:07:37,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:37,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:37,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:37,271 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:07:37,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:37,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-19 09:07:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:37,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240534228] [2024-11-19 09:07:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:37,273 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:07:37,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:37,275 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:07:37,276 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:07:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:37,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:07:37,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:37,418 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:07:37,442 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:07:37,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:37,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240534228] [2024-11-19 09:07:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240534228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:37,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:07:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766474893] [2024-11-19 09:07:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:37,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:07:37,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:07:37,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:37,444 INFO L87 Difference]: Start difference. First operand 1033 states and 1090 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:38,682 INFO L93 Difference]: Finished difference Result 1198 states and 1276 transitions. [2024-11-19 09:07:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:07:38,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 09:07:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:38,686 INFO L225 Difference]: With dead ends: 1198 [2024-11-19 09:07:38,686 INFO L226 Difference]: Without dead ends: 1198 [2024-11-19 09:07:38,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:38,687 INFO L432 NwaCegarLoop]: 866 mSDtfsCounter, 749 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:38,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1117 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:07:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-19 09:07:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 986. [2024-11-19 09:07:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 535 states have (on average 1.9383177570093457) internal successors, (1037), 981 states have internal predecessors, (1037), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1043 transitions. [2024-11-19 09:07:38,706 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1043 transitions. Word has length 9 [2024-11-19 09:07:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:38,707 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1043 transitions. [2024-11-19 09:07:38,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1043 transitions. [2024-11-19 09:07:38,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:07:38,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:38,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:38,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:38,908 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:07:38,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:38,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:38,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-19 09:07:38,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211334080] [2024-11-19 09:07:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:38,911 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:07:38,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:38,912 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:07:38,914 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:07:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:39,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:07:39,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:39,024 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:07:39,049 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:07:39,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:39,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211334080] [2024-11-19 09:07:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211334080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:39,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:39,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:07:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033875999] [2024-11-19 09:07:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:07:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:07:39,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:39,051 INFO L87 Difference]: Start difference. First operand 986 states and 1043 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:40,531 INFO L93 Difference]: Finished difference Result 1274 states and 1355 transitions. [2024-11-19 09:07:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:07:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 09:07:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:40,535 INFO L225 Difference]: With dead ends: 1274 [2024-11-19 09:07:40,535 INFO L226 Difference]: Without dead ends: 1274 [2024-11-19 09:07:40,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:40,536 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 500 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:40,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1464 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:07:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-19 09:07:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1013. [2024-11-19 09:07:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 572 states have (on average 1.9248251748251748) internal successors, (1101), 1008 states have internal predecessors, (1101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1107 transitions. [2024-11-19 09:07:40,561 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1107 transitions. Word has length 9 [2024-11-19 09:07:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:40,562 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1107 transitions. [2024-11-19 09:07:40,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1107 transitions. [2024-11-19 09:07:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 09:07:40,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:40,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:40,568 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:07:40,763 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:07:40,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:40,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:40,765 INFO L85 PathProgramCache]: Analyzing trace with hash -153057981, now seen corresponding path program 1 times [2024-11-19 09:07:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056972316] [2024-11-19 09:07:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:40,769 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:07:40,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:40,772 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:07:40,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:07:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:40,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:07:40,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:40,966 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:07:40,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:40,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:40,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056972316] [2024-11-19 09:07:40,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056972316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:40,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:40,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:40,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004440840] [2024-11-19 09:07:40,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:40,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:07:40,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:40,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:07:40,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:40,968 INFO L87 Difference]: Start difference. First operand 1013 states and 1107 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:41,140 INFO L93 Difference]: Finished difference Result 1453 states and 1602 transitions. [2024-11-19 09:07:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:07:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 09:07:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:41,144 INFO L225 Difference]: With dead ends: 1453 [2024-11-19 09:07:41,144 INFO L226 Difference]: Without dead ends: 1453 [2024-11-19 09:07:41,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:41,145 INFO L432 NwaCegarLoop]: 1093 mSDtfsCounter, 466 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:41,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2033 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:07:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-19 09:07:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1187. [2024-11-19 09:07:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 746 states have (on average 1.8686327077747988) internal successors, (1394), 1182 states have internal predecessors, (1394), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1400 transitions. [2024-11-19 09:07:41,166 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1400 transitions. Word has length 12 [2024-11-19 09:07:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:41,166 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1400 transitions. [2024-11-19 09:07:41,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1400 transitions. [2024-11-19 09:07:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 09:07:41,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:41,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:41,171 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:07:41,370 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:07:41,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:41,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1410939272, now seen corresponding path program 1 times [2024-11-19 09:07:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732443781] [2024-11-19 09:07:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:41,372 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:07:41,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:41,375 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:07:41,376 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:07:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:41,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:07:41,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:41,513 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:07:41,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:41,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:41,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732443781] [2024-11-19 09:07:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732443781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:41,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:41,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751324899] [2024-11-19 09:07:41,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:41,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:07:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:41,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:07:41,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:41,516 INFO L87 Difference]: Start difference. First operand 1187 states and 1400 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:41,543 INFO L93 Difference]: Finished difference Result 1127 states and 1314 transitions. [2024-11-19 09:07:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:07:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 09:07:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:41,547 INFO L225 Difference]: With dead ends: 1127 [2024-11-19 09:07:41,548 INFO L226 Difference]: Without dead ends: 1127 [2024-11-19 09:07:41,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:41,550 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 71 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:41,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1877 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:07:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-11-19 09:07:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2024-11-19 09:07:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 710 states have (on average 1.8422535211267606) internal successors, (1308), 1122 states have internal predecessors, (1308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1314 transitions. [2024-11-19 09:07:41,571 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1314 transitions. Word has length 14 [2024-11-19 09:07:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:41,571 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1314 transitions. [2024-11-19 09:07:41,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1314 transitions. [2024-11-19 09:07:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 09:07:41,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:41,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:41,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:07:41,772 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:07:41,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1512080444, now seen corresponding path program 1 times [2024-11-19 09:07:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23759778] [2024-11-19 09:07:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:41,774 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:07:41,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:41,775 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:07:41,777 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:07:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:41,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:07:41,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:42,038 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-19 09:07:42,039 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:07:42,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:42,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23759778] [2024-11-19 09:07:42,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23759778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:42,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:42,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:42,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109802084] [2024-11-19 09:07:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:42,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:07:42,042 INFO L87 Difference]: Start difference. First operand 1127 states and 1314 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:43,137 INFO L93 Difference]: Finished difference Result 1402 states and 1609 transitions. [2024-11-19 09:07:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 09:07:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:43,141 INFO L225 Difference]: With dead ends: 1402 [2024-11-19 09:07:43,141 INFO L226 Difference]: Without dead ends: 1400 [2024-11-19 09:07:43,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-19 09:07:43,141 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 286 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1280 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:43,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1406 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 564 Invalid, 0 Unknown, 1280 Unchecked, 1.1s Time] [2024-11-19 09:07:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-11-19 09:07:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1198. [2024-11-19 09:07:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 781 states have (on average 1.8104993597951344) internal successors, (1414), 1193 states have internal predecessors, (1414), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1420 transitions. [2024-11-19 09:07:43,160 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1420 transitions. Word has length 15 [2024-11-19 09:07:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:43,160 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1420 transitions. [2024-11-19 09:07:43,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1420 transitions. [2024-11-19 09:07:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 09:07:43,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:43,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:43,169 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:07:43,362 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:07:43,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:43,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1512073534, now seen corresponding path program 1 times [2024-11-19 09:07:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066927960] [2024-11-19 09:07:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:43,363 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:07:43,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:43,364 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:07:43,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:07:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:43,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:07:43,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:43,574 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:07:43,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:43,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066927960] [2024-11-19 09:07:43,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066927960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:43,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:07:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030251442] [2024-11-19 09:07:43,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:43,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:43,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:43,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:43,576 INFO L87 Difference]: Start difference. First operand 1198 states and 1420 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:44,010 INFO L93 Difference]: Finished difference Result 1442 states and 1623 transitions. [2024-11-19 09:07:44,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:44,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 09:07:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:44,015 INFO L225 Difference]: With dead ends: 1442 [2024-11-19 09:07:44,015 INFO L226 Difference]: Without dead ends: 1438 [2024-11-19 09:07:44,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:44,016 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 425 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:44,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 2890 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:07:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-19 09:07:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1196. [2024-11-19 09:07:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 779 states have (on average 1.8112965340179719) internal successors, (1411), 1191 states have internal predecessors, (1411), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1417 transitions. [2024-11-19 09:07:44,034 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1417 transitions. Word has length 15 [2024-11-19 09:07:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:44,034 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1417 transitions. [2024-11-19 09:07:44,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1417 transitions. [2024-11-19 09:07:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 09:07:44,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:44,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:44,040 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:07:44,235 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:07:44,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1297050578, now seen corresponding path program 1 times [2024-11-19 09:07:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578053685] [2024-11-19 09:07:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:44,238 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:07:44,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:44,241 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:07:44,242 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:07:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:44,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:07:44,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:44,411 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:07:44,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:44,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578053685] [2024-11-19 09:07:44,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578053685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:44,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:44,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:07:44,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78568647] [2024-11-19 09:07:44,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:44,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:44,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:44,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:44,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:44,413 INFO L87 Difference]: Start difference. First operand 1196 states and 1417 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:44,500 INFO L93 Difference]: Finished difference Result 1158 states and 1330 transitions. [2024-11-19 09:07:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:07:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 09:07:44,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:44,505 INFO L225 Difference]: With dead ends: 1158 [2024-11-19 09:07:44,505 INFO L226 Difference]: Without dead ends: 1158 [2024-11-19 09:07:44,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:44,506 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 48 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:44,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2749 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:07:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-19 09:07:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-19 09:07:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 755 states have (on average 1.7536423841059603) internal successors, (1324), 1153 states have internal predecessors, (1324), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1330 transitions. [2024-11-19 09:07:44,522 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1330 transitions. Word has length 16 [2024-11-19 09:07:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:44,523 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1330 transitions. [2024-11-19 09:07:44,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1330 transitions. [2024-11-19 09:07:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 09:07:44,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:44,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:44,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:07:44,724 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:07:44,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:44,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:44,725 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-19 09:07:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277036753] [2024-11-19 09:07:44,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:44,726 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:07:44,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:44,727 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:07:44,728 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:07:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:44,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:07:44,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:44,876 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:07:44,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:44,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277036753] [2024-11-19 09:07:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277036753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:44,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668660869] [2024-11-19 09:07:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:44,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:07:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:07:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:44,878 INFO L87 Difference]: Start difference. First operand 1158 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:44,899 INFO L93 Difference]: Finished difference Result 1098 states and 1244 transitions. [2024-11-19 09:07:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:07:44,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 09:07:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:44,904 INFO L225 Difference]: With dead ends: 1098 [2024-11-19 09:07:44,904 INFO L226 Difference]: Without dead ends: 1098 [2024-11-19 09:07:44,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:07:44,906 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 71 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:44,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1721 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:07:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-19 09:07:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2024-11-19 09:07:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 719 states have (on average 1.721835883171071) internal successors, (1238), 1093 states have internal predecessors, (1238), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1244 transitions. [2024-11-19 09:07:44,923 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1244 transitions. Word has length 19 [2024-11-19 09:07:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:44,923 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1244 transitions. [2024-11-19 09:07:44,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1244 transitions. [2024-11-19 09:07:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 09:07:44,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:44,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:44,930 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:07:45,125 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:07:45,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash -774929132, now seen corresponding path program 1 times [2024-11-19 09:07:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257019371] [2024-11-19 09:07:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:45,127 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:07:45,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:45,130 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:07:45,131 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:07:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:45,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:07:45,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:45,318 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:07:45,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:45,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:45,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257019371] [2024-11-19 09:07:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257019371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:45,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:45,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:07:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211763155] [2024-11-19 09:07:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:45,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:45,320 INFO L87 Difference]: Start difference. First operand 1098 states and 1244 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:45,375 INFO L93 Difference]: Finished difference Result 1068 states and 1186 transitions. [2024-11-19 09:07:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:07:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 09:07:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:45,379 INFO L225 Difference]: With dead ends: 1068 [2024-11-19 09:07:45,379 INFO L226 Difference]: Without dead ends: 1068 [2024-11-19 09:07:45,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:45,380 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 48 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:45,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2515 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:07:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2024-11-19 09:07:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2024-11-19 09:07:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 703 states have (on average 1.678520625889047) internal successors, (1180), 1063 states have internal predecessors, (1180), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1186 transitions. [2024-11-19 09:07:45,396 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1186 transitions. Word has length 21 [2024-11-19 09:07:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:45,397 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1186 transitions. [2024-11-19 09:07:45,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1186 transitions. [2024-11-19 09:07:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 09:07:45,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:45,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:45,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:45,598 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:07:45,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:45,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash 727437120, now seen corresponding path program 1 times [2024-11-19 09:07:45,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:45,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901559914] [2024-11-19 09:07:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:45,600 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:07:45,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:45,603 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:07:45,604 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:07:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:45,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:07:45,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:45,758 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:07:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:07:45,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:45,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901559914] [2024-11-19 09:07:45,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901559914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:45,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:45,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:45,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123812936] [2024-11-19 09:07:45,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:45,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:45,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:45,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:45,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:45,825 INFO L87 Difference]: Start difference. First operand 1068 states and 1186 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:47,105 INFO L93 Difference]: Finished difference Result 1255 states and 1374 transitions. [2024-11-19 09:07:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 09:07:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:47,108 INFO L225 Difference]: With dead ends: 1255 [2024-11-19 09:07:47,108 INFO L226 Difference]: Without dead ends: 1255 [2024-11-19 09:07:47,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:47,109 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 774 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:47,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1122 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:07:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-19 09:07:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1064. [2024-11-19 09:07:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 703 states have (on average 1.6614509246088194) internal successors, (1168), 1059 states have internal predecessors, (1168), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1174 transitions. [2024-11-19 09:07:47,123 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1174 transitions. Word has length 30 [2024-11-19 09:07:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1174 transitions. [2024-11-19 09:07:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1174 transitions. [2024-11-19 09:07:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 09:07:47,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:47,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:47,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 09:07:47,329 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:07:47,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash 727437121, now seen corresponding path program 1 times [2024-11-19 09:07:47,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:47,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077864559] [2024-11-19 09:07:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:47,330 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:07:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:47,332 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:07:47,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:07:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:47,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:07:47,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:47,477 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:07:47,654 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:07:47,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:47,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077864559] [2024-11-19 09:07:47,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077864559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:47,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:47,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138850882] [2024-11-19 09:07:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:47,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:47,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:47,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:47,656 INFO L87 Difference]: Start difference. First operand 1064 states and 1174 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:49,077 INFO L93 Difference]: Finished difference Result 1071 states and 1176 transitions. [2024-11-19 09:07:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:49,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 09:07:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:49,081 INFO L225 Difference]: With dead ends: 1071 [2024-11-19 09:07:49,081 INFO L226 Difference]: Without dead ends: 1071 [2024-11-19 09:07:49,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:49,082 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 79 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:49,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1752 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:07:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-19 09:07:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1064. [2024-11-19 09:07:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 703 states have (on average 1.6557610241820768) internal successors, (1164), 1059 states have internal predecessors, (1164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1170 transitions. [2024-11-19 09:07:49,096 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1170 transitions. Word has length 30 [2024-11-19 09:07:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:49,097 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1170 transitions. [2024-11-19 09:07:49,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1170 transitions. [2024-11-19 09:07:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:07:49,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:49,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:49,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:49,299 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:07:49,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:49,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064798, now seen corresponding path program 1 times [2024-11-19 09:07:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:49,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364007623] [2024-11-19 09:07:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:49,302 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:07:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:49,305 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:07:49,306 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:07:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:49,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:07:49,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:49,470 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:07:49,538 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:07:49,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:49,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364007623] [2024-11-19 09:07:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364007623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:49,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660564866] [2024-11-19 09:07:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:49,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:49,540 INFO L87 Difference]: Start difference. First operand 1064 states and 1170 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:50,908 INFO L93 Difference]: Finished difference Result 1071 states and 1172 transitions. [2024-11-19 09:07:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:50,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 09:07:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:50,911 INFO L225 Difference]: With dead ends: 1071 [2024-11-19 09:07:50,911 INFO L226 Difference]: Without dead ends: 1071 [2024-11-19 09:07:50,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:50,912 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 600 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:50,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1231 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 09:07:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-19 09:07:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2024-11-19 09:07:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 703 states have (on average 1.6443812233285917) internal successors, (1156), 1055 states have internal predecessors, (1156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1162 transitions. [2024-11-19 09:07:50,928 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1162 transitions. Word has length 35 [2024-11-19 09:07:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:50,928 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1162 transitions. [2024-11-19 09:07:50,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1162 transitions. [2024-11-19 09:07:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:07:50,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:50,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:50,936 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 (17)] Ended with exit code 0 [2024-11-19 09:07:51,129 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:07:51,130 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:51,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:51,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064797, now seen corresponding path program 1 times [2024-11-19 09:07:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:51,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190158680] [2024-11-19 09:07:51,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:51,131 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:07:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:51,132 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:07:51,133 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:07:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:51,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:07:51,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:51,326 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:07:51,525 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:07:51,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:51,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190158680] [2024-11-19 09:07:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190158680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:51,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859754007] [2024-11-19 09:07:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:51,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:51,528 INFO L87 Difference]: Start difference. First operand 1060 states and 1162 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:53,300 INFO L93 Difference]: Finished difference Result 1317 states and 1404 transitions. [2024-11-19 09:07:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:53,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 09:07:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:53,306 INFO L225 Difference]: With dead ends: 1317 [2024-11-19 09:07:53,306 INFO L226 Difference]: Without dead ends: 1317 [2024-11-19 09:07:53,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:53,307 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 347 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:53,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1901 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:07:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-19 09:07:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1056. [2024-11-19 09:07:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 703 states have (on average 1.6330014224751066) internal successors, (1148), 1051 states have internal predecessors, (1148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1154 transitions. [2024-11-19 09:07:53,321 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1154 transitions. Word has length 35 [2024-11-19 09:07:53,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:53,322 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1154 transitions. [2024-11-19 09:07:53,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1154 transitions. [2024-11-19 09:07:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 09:07:53,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:53,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:53,330 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:07:53,524 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:07:53,525 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:53,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1556225793, now seen corresponding path program 1 times [2024-11-19 09:07:53,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:53,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101996588] [2024-11-19 09:07:53,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:53,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:07:53,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:53,529 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:07:53,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 (19)] Waiting until timeout for monitored process [2024-11-19 09:07:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:53,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:07:53,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:53,751 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:07:53,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:53,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101996588] [2024-11-19 09:07:53,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101996588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:53,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:53,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:07:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635098322] [2024-11-19 09:07:53,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:53,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:53,757 INFO L87 Difference]: Start difference. First operand 1056 states and 1154 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:53,823 INFO L93 Difference]: Finished difference Result 1038 states and 1124 transitions. [2024-11-19 09:07:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:07:53,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-19 09:07:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:53,827 INFO L225 Difference]: With dead ends: 1038 [2024-11-19 09:07:53,827 INFO L226 Difference]: Without dead ends: 1038 [2024-11-19 09:07:53,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:53,828 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 27 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:53,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2474 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:07:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-19 09:07:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-11-19 09:07:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 685 states have (on average 1.6321167883211678) internal successors, (1118), 1033 states have internal predecessors, (1118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1124 transitions. [2024-11-19 09:07:53,844 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1124 transitions. Word has length 50 [2024-11-19 09:07:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:53,844 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1124 transitions. [2024-11-19 09:07:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1124 transitions. [2024-11-19 09:07:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 09:07:53,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:53,846 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:07:53,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:54,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:07:54,047 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:54,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash -848059422, now seen corresponding path program 1 times [2024-11-19 09:07:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724332498] [2024-11-19 09:07:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:54,048 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:07:54,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:54,049 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:07:54,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 09:07:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:54,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:07:54,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:54,306 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:07:54,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:54,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724332498] [2024-11-19 09:07:54,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724332498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:54,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:54,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:07:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425365497] [2024-11-19 09:07:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:54,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:54,309 INFO L87 Difference]: Start difference. First operand 1038 states and 1124 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:54,353 INFO L93 Difference]: Finished difference Result 1026 states and 1104 transitions. [2024-11-19 09:07:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:07:54,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-19 09:07:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:54,356 INFO L225 Difference]: With dead ends: 1026 [2024-11-19 09:07:54,356 INFO L226 Difference]: Without dead ends: 1026 [2024-11-19 09:07:54,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:54,357 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 21 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:54,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2468 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:07:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-19 09:07:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2024-11-19 09:07:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 673 states have (on average 1.6315007429420505) internal successors, (1098), 1021 states have internal predecessors, (1098), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1104 transitions. [2024-11-19 09:07:54,369 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1104 transitions. Word has length 54 [2024-11-19 09:07:54,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:54,369 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1104 transitions. [2024-11-19 09:07:54,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1104 transitions. [2024-11-19 09:07:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 09:07:54,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:54,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:54,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:54,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:07:54,571 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:54,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash 619385421, now seen corresponding path program 1 times [2024-11-19 09:07:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795463621] [2024-11-19 09:07:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:54,572 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:07:54,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:54,574 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:07:54,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 09:07:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:54,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:07:54,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:54,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:07:54,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:07:54,785 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:07:54,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 09:07:54,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:07:54,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 09:07:54,864 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:07:54,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:54,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:54,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795463621] [2024-11-19 09:07:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795463621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:54,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:54,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:07:54,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413927319] [2024-11-19 09:07:54,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:54,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:07:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:54,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:07:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:07:54,867 INFO L87 Difference]: Start difference. First operand 1026 states and 1104 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:55,178 INFO L93 Difference]: Finished difference Result 1498 states and 1597 transitions. [2024-11-19 09:07:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:07:55,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-19 09:07:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:55,182 INFO L225 Difference]: With dead ends: 1498 [2024-11-19 09:07:55,183 INFO L226 Difference]: Without dead ends: 1495 [2024-11-19 09:07:55,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:07:55,183 INFO L432 NwaCegarLoop]: 827 mSDtfsCounter, 1769 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:55,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 2847 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:07:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-19 09:07:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 972. [2024-11-19 09:07:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 619 states have (on average 1.6833602584814216) internal successors, (1042), 967 states have internal predecessors, (1042), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1048 transitions. [2024-11-19 09:07:55,198 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1048 transitions. Word has length 58 [2024-11-19 09:07:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:55,198 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1048 transitions. [2024-11-19 09:07:55,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1048 transitions. [2024-11-19 09:07:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 09:07:55,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:55,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:07:55,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:55,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:07:55,400 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:55,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash 887665558, now seen corresponding path program 1 times [2024-11-19 09:07:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:55,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145411552] [2024-11-19 09:07:55,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:55,401 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:07:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:55,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:07:55,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 09:07:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:55,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:07:55,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:55,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:07:55,718 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:07:56,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:07:56,196 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:07:56,212 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:07:56,212 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:07:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:07:56,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:56,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145411552] [2024-11-19 09:07:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145411552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:56,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:07:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700354288] [2024-11-19 09:07:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:56,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:07:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:56,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:07:56,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:56,230 INFO L87 Difference]: Start difference. First operand 972 states and 1048 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:57,432 INFO L93 Difference]: Finished difference Result 934 states and 1010 transitions. [2024-11-19 09:07:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:07:57,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-19 09:07:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:57,436 INFO L225 Difference]: With dead ends: 934 [2024-11-19 09:07:57,436 INFO L226 Difference]: Without dead ends: 934 [2024-11-19 09:07:57,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:07:57,436 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1044 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:57,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 547 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:07:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-11-19 09:07:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 897. [2024-11-19 09:07:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 582 states have (on average 1.597938144329897) internal successors, (930), 892 states have internal predecessors, (930), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 936 transitions. [2024-11-19 09:07:57,445 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 936 transitions. Word has length 62 [2024-11-19 09:07:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:57,445 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 936 transitions. [2024-11-19 09:07:57,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 936 transitions. [2024-11-19 09:07:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 09:07:57,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:57,446 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:07:57,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:57,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:07:57,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:57,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash 512421051, now seen corresponding path program 1 times [2024-11-19 09:07:57,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:57,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004616748] [2024-11-19 09:07:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:57,648 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:07:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:57,649 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:07:57,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 09:07:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:57,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:07:57,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:57,910 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:07:57,926 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:07:57,944 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:07:57,950 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:07:57,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:57,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004616748] [2024-11-19 09:07:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004616748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:57,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:57,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:07:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186259048] [2024-11-19 09:07:57,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:57,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:07:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:57,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:07:57,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:57,952 INFO L87 Difference]: Start difference. First operand 897 states and 936 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:07:59,373 INFO L93 Difference]: Finished difference Result 896 states and 935 transitions. [2024-11-19 09:07:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:07:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-19 09:07:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:07:59,376 INFO L225 Difference]: With dead ends: 896 [2024-11-19 09:07:59,376 INFO L226 Difference]: Without dead ends: 896 [2024-11-19 09:07:59,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:07:59,380 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 2 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:07:59,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2079 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:07:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-19 09:07:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-11-19 09:07:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 582 states have (on average 1.5962199312714778) internal successors, (929), 891 states have internal predecessors, (929), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:07:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 935 transitions. [2024-11-19 09:07:59,395 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 935 transitions. Word has length 67 [2024-11-19 09:07:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:07:59,395 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 935 transitions. [2024-11-19 09:07:59,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:07:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 935 transitions. [2024-11-19 09:07:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 09:07:59,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:07:59,396 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:07:59,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-19 09:07:59,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:07:59,597 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:07:59,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:07:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 512421052, now seen corresponding path program 1 times [2024-11-19 09:07:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:07:59,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575401309] [2024-11-19 09:07:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:07:59,598 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:07:59,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:07:59,600 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:07:59,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-19 09:07:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:07:59,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:07:59,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:07:59,872 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:07:59,893 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:07:59,901 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:07:59,949 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:07:59,967 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:07:59,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:07:59,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:07:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575401309] [2024-11-19 09:07:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575401309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:07:59,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:07:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:07:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570103220] [2024-11-19 09:07:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:07:59,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:07:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:07:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:07:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:07:59,969 INFO L87 Difference]: Start difference. First operand 896 states and 935 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:08:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:01,934 INFO L93 Difference]: Finished difference Result 895 states and 934 transitions. [2024-11-19 09:08:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:08:01,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-19 09:08:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:01,937 INFO L225 Difference]: With dead ends: 895 [2024-11-19 09:08:01,937 INFO L226 Difference]: Without dead ends: 895 [2024-11-19 09:08:01,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:08:01,938 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 1 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:01,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2100 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:08:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-19 09:08:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2024-11-19 09:08:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 581 states have (on average 1.5972461273666092) internal successors, (928), 890 states have internal predecessors, (928), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 09:08:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 934 transitions. [2024-11-19 09:08:01,949 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 934 transitions. Word has length 67 [2024-11-19 09:08:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:01,950 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 934 transitions. [2024-11-19 09:08:01,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:08:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 934 transitions. [2024-11-19 09:08:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 09:08:01,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:01,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:01,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-19 09:08:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:08:02,151 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:08:02,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1994563710, now seen corresponding path program 1 times [2024-11-19 09:08:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:08:02,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144111490] [2024-11-19 09:08:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:02,153 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:08:02,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:08:02,156 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:08:02,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-19 09:08:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:02,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:08:02,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:08:02,492 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:08:02,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:08:02,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:08:02,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144111490] [2024-11-19 09:08:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144111490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:08:02,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:08:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:08:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597614530] [2024-11-19 09:08:02,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:08:02,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:08:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:08:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:08:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:08:02,496 INFO L87 Difference]: Start difference. First operand 895 states and 934 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:08:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:02,532 INFO L93 Difference]: Finished difference Result 898 states and 938 transitions. [2024-11-19 09:08:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:08:02,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-19 09:08:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:02,540 INFO L225 Difference]: With dead ends: 898 [2024-11-19 09:08:02,540 INFO L226 Difference]: Without dead ends: 898 [2024-11-19 09:08:02,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:08:02,541 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 0 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:02,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2413 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:08:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-19 09:08:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-11-19 09:08:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 583 states have (on average 1.5969125214408233) internal successors, (931), 893 states have internal predecessors, (931), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:08:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 938 transitions. [2024-11-19 09:08:02,578 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 938 transitions. Word has length 75 [2024-11-19 09:08:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:02,578 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 938 transitions. [2024-11-19 09:08:02,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:08:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 938 transitions. [2024-11-19 09:08:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 09:08:02,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:02,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:02,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-19 09:08:02,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:08:02,780 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:08:02,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash -709775317, now seen corresponding path program 1 times [2024-11-19 09:08:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:08:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893646912] [2024-11-19 09:08:02,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:08:02,782 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:08:02,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:08:02,785 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:08:02,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-19 09:08:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:08:03,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:08:03,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:08:03,098 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:08:03,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:08:03,156 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:08:03,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:08:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893646912] [2024-11-19 09:08:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893646912] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:08:03,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:08:03,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:08:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746209566] [2024-11-19 09:08:03,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:08:03,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:08:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:08:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:08:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:08:03,159 INFO L87 Difference]: Start difference. First operand 898 states and 938 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:03,281 INFO L93 Difference]: Finished difference Result 910 states and 955 transitions. [2024-11-19 09:08:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:08:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2024-11-19 09:08:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:03,284 INFO L225 Difference]: With dead ends: 910 [2024-11-19 09:08:03,285 INFO L226 Difference]: Without dead ends: 910 [2024-11-19 09:08:03,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:08:03,285 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 8 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:03,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2416 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:08:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-19 09:08:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 908. [2024-11-19 09:08:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 592 states have (on average 1.597972972972973) internal successors, (946), 902 states have internal predecessors, (946), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:08:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 953 transitions. [2024-11-19 09:08:03,302 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 953 transitions. Word has length 76 [2024-11-19 09:08:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:03,303 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 953 transitions. [2024-11-19 09:08:03,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 953 transitions. [2024-11-19 09:08:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 09:08:03,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:03,304 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:03,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-19 09:08:03,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:08:03,505 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:08:03,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 872464834, now seen corresponding path program 2 times [2024-11-19 09:08:03,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:08:03,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643223806] [2024-11-19 09:08:03,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:08:03,506 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:08:03,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:08:03,508 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:08:03,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-19 09:08:03,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:08:03,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:08:03,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:08:04,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:08:04,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:08:04,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:08:04,213 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:08:04,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:08:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643223806] [2024-11-19 09:08:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643223806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:08:04,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:08:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 09:08:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914540285] [2024-11-19 09:08:04,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:08:04,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:08:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:08:04,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:08:04,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:08:04,217 INFO L87 Difference]: Start difference. First operand 908 states and 953 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:04,664 INFO L93 Difference]: Finished difference Result 923 states and 975 transitions. [2024-11-19 09:08:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:08:04,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2024-11-19 09:08:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:04,672 INFO L225 Difference]: With dead ends: 923 [2024-11-19 09:08:04,672 INFO L226 Difference]: Without dead ends: 919 [2024-11-19 09:08:04,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 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:08:04,673 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 14 mSDsluCounter, 5621 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6427 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:04,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6427 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:08:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-19 09:08:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 917. [2024-11-19 09:08:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 601 states have (on average 1.5940099833610648) internal successors, (958), 911 states have internal predecessors, (958), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:08:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 965 transitions. [2024-11-19 09:08:04,695 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 965 transitions. Word has length 79 [2024-11-19 09:08:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:04,698 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 965 transitions. [2024-11-19 09:08:04,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 965 transitions. [2024-11-19 09:08:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 09:08:04,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:04,699 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:04,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-19 09:08:04,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:08:04,900 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:08:04,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1407452894, now seen corresponding path program 3 times [2024-11-19 09:08:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:08:04,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860716460] [2024-11-19 09:08:04,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:08:04,901 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:08:04,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:08:04,902 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:08:04,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-19 09:08:05,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:08:05,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:08:05,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:08:05,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:08:05,741 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:08:05,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:08:06,190 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:08:06,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:08:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860716460] [2024-11-19 09:08:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860716460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:08:06,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:08:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 09:08:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709106688] [2024-11-19 09:08:06,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:08:06,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:08:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:08:06,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:08:06,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:08:06,192 INFO L87 Difference]: Start difference. First operand 917 states and 965 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:07,669 INFO L93 Difference]: Finished difference Result 941 states and 1004 transitions. [2024-11-19 09:08:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 09:08:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-19 09:08:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:07,675 INFO L225 Difference]: With dead ends: 941 [2024-11-19 09:08:07,676 INFO L226 Difference]: Without dead ends: 935 [2024-11-19 09:08:07,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 09:08:07,677 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 18 mSDsluCounter, 8845 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 9652 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:07,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 9652 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:08:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-19 09:08:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2024-11-19 09:08:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 619 states have (on average 1.5848142164781907) internal successors, (981), 929 states have internal predecessors, (981), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:08:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 988 transitions. [2024-11-19 09:08:07,688 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 988 transitions. Word has length 85 [2024-11-19 09:08:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:07,689 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 988 transitions. [2024-11-19 09:08:07,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 988 transitions. [2024-11-19 09:08:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 09:08:07,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:07,690 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:07,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-19 09:08:07,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:08:07,891 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:08:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1881886690, now seen corresponding path program 4 times [2024-11-19 09:08:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:08:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274328082] [2024-11-19 09:08:07,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:08:07,892 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:08:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:08:07,893 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:08:07,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-19 09:08:08,405 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:08:08,405 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:08:08,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 09:08:08,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:08:08,752 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:08:08,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:08:09,884 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:08:09,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:08:09,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274328082] [2024-11-19 09:08:09,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274328082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:08:09,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:08:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 09:08:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599106159] [2024-11-19 09:08:09,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:08:09,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 09:08:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:08:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 09:08:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 09:08:09,888 INFO L87 Difference]: Start difference. First operand 935 states and 988 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:08:14,498 INFO L93 Difference]: Finished difference Result 975 states and 1060 transitions. [2024-11-19 09:08:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:08:14,500 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-11-19 09:08:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:08:14,502 INFO L225 Difference]: With dead ends: 975 [2024-11-19 09:08:14,502 INFO L226 Difference]: Without dead ends: 971 [2024-11-19 09:08:14,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 09:08:14,504 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 49 mSDsluCounter, 20074 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:08:14,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 20880 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:08:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-19 09:08:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2024-11-19 09:08:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 653 states have (on average 1.5727411944869831) internal successors, (1027), 963 states have internal predecessors, (1027), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 09:08:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1034 transitions. [2024-11-19 09:08:14,515 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1034 transitions. Word has length 97 [2024-11-19 09:08:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:08:14,516 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1034 transitions. [2024-11-19 09:08:14,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:08:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1034 transitions. [2024-11-19 09:08:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 09:08:14,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:08:14,517 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:08:14,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-19 09:08:14,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:08:14,719 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-19 09:08:14,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:08:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 834582594, now seen corresponding path program 5 times [2024-11-19 09:08:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:08:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944640094] [2024-11-19 09:08:14,720 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:08:14,720 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:08:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:08:14,724 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:08:14,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 (30)] Waiting until timeout for monitored process [2024-11-19 09:08:15,968 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:08:15,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:08:15,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 09:08:16,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:08:16,014 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:08:16,163 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:08:16,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:08:16,191 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:08:16,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 09:08:17,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:08:17,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 09:08:17,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-19 09:08:17,372 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:08:17,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:08:17,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:08:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944640094] [2024-11-19 09:08:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944640094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:08:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [651465840] [2024-11-19 09:08:17,702 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:08:17,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:08:17,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:08:17,703 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 09:08:17,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process