./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_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-803cd42-m [2024-11-22 20:54:53,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:54:53,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 20:54:53,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:54:53,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:54:53,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:54:53,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:54:53,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:54:53,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:54:53,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:54:53,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:54:53,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:54:53,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:54:53,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:54:53,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:54:53,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:54:53,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:54:53,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:54:53,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:54:53,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:54:53,399 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:54:53,401 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:54:53,401 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:54:53,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:54:53,401 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:54:53,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:54:53,402 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:54:53,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:54:53,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:54:53,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:54:53,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:54:53,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:54:53,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:54:53,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:54:53,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:54:53,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:54:53,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 20:54:53,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 20:54:53,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:54:53,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:54:53,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:54:53,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:54:53,406 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-22 20:54:53,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:54:53,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:54:53,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:54:53,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:54:53,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:54:53,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-22 20:54:55,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:54:55,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:54:55,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-22 20:54:55,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c17b81713/4bc8fb927cbc440ab0ff2b7fb23abf74/FLAG27a40dec9 [2024-11-22 20:54:55,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c17b81713/4bc8fb927cbc440ab0ff2b7fb23abf74 [2024-11-22 20:54:55,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:54:55,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:54:55,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:54:55,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:54:55,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:54:55,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:54:55" (1/1) ... [2024-11-22 20:54:55,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a535396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:54:55, skipping insertion in model container [2024-11-22 20:54:55,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:54:55" (1/1) ... [2024-11-22 20:54:55,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:54:56,016 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,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-22 20:54:56,058 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,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-22 20:54:56,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-22 20:54:56,106 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,107 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,115 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,121 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,123 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,127 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,129 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,133 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,140 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:54:56,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:54:56,172 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-22 20:54:56,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7a565eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:54:56, skipping insertion in model container [2024-11-22 20:54:56,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:54:56,174 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 20:54:56,176 INFO L158 Benchmark]: Toolchain (without parser) took 668.76ms. Allocated memory is still 174.1MB. Free memory was 101.5MB in the beginning and 78.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 20:54:56,177 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 74.5MB in the beginning and 74.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 20:54:56,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.51ms. Allocated memory is still 174.1MB. Free memory was 101.3MB in the beginning and 78.0MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 20:54:56,179 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 113.2MB. Free memory was 74.5MB in the beginning and 74.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 665.51ms. Allocated memory is still 174.1MB. Free memory was 101.3MB in the beginning and 78.0MB in the end (delta: 23.3MB). 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_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-803cd42-m [2024-11-22 20:54:58,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:54:58,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 20:54:58,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:54:58,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:54:58,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:54:58,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:54:58,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:54:58,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:54:58,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:54:58,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:54:58,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:54:58,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:54:58,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:54:58,454 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:54:58,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:54:58,454 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:54:58,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:54:58,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:54:58,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:54:58,456 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:54:58,459 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:54:58,460 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:54:58,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:54:58,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:54:58,460 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 20:54:58,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:54:58,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 20:54:58,461 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:54:58,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:54:58,462 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:54:58,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:54:58,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:54:58,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:54:58,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:54:58,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:54:58,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:54:58,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:54:58,467 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 20:54:58,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 20:54:58,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:54:58,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:54:58,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:54:58,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:54:58,469 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-22 20:54:58,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:54:58,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:54:58,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:54:58,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:54:58,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:54:58,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-22 20:55:00,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:55:00,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:55:00,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2024-11-22 20:55:00,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4929de444/75f80f981cf14732ab676747c16ff33c/FLAG4b4826bd1 [2024-11-22 20:55:01,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4929de444/75f80f981cf14732ab676747c16ff33c [2024-11-22 20:55:01,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:55:01,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:55:01,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:55:01,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:55:01,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:55:01,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:55:01" (1/1) ... [2024-11-22 20:55:01,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a89bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:01, skipping insertion in model container [2024-11-22 20:55:01,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:55:01" (1/1) ... [2024-11-22 20:55:01,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:55:01,667 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,709 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,713 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,726 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,760 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,760 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,764 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,766 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,769 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,771 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,775 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,776 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,784 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:55:01,808 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 20:55:01,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:55:01,878 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,900 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,903 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,905 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,910 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,938 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,940 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,941 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,942 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,943 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,951 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:55:01,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:55:01,964 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 20:55:02,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:55:02,173 INFO L204 MainTranslator]: Completed translation [2024-11-22 20:55:02,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02 WrapperNode [2024-11-22 20:55:02,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:55:02,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 20:55:02,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 20:55:02,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 20:55:02,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,302 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1059 [2024-11-22 20:55:02,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 20:55:02,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 20:55:02,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 20:55:02,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 20:55:02,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,431 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-22 20:55:02,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 20:55:02,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 20:55:02,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 20:55:02,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 20:55:02,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (1/1) ... [2024-11-22 20:55:02,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:55:02,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:55:02,589 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-22 20:55:02,592 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-22 20:55:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 20:55:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 20:55:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 20:55:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 20:55:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 20:55:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 20:55:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 20:55:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 20:55:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 20:55:02,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 20:55:02,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 20:55:02,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 20:55:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 20:55:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 20:55:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 20:55:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 20:55:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 20:55:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 20:55:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 20:55:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 20:55:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 20:55:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 20:55:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 20:55:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 20:55:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 20:55:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 20:55:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 20:55:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 20:55:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 20:55:02,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 20:55:02,847 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 20:55:02,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 20:55:02,851 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:55:02,926 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:55:02,949 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:55:06,668 INFO L? ?]: Removed 1087 outVars from TransFormulas that were not future-live. [2024-11-22 20:55:06,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 20:55:06,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 20:55:06,711 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-22 20:55:06,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:55:06 BoogieIcfgContainer [2024-11-22 20:55:06,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 20:55:06,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 20:55:06,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 20:55:06,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 20:55:06,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:55:01" (1/3) ... [2024-11-22 20:55:06,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59de4ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:55:06, skipping insertion in model container [2024-11-22 20:55:06,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:55:02" (2/3) ... [2024-11-22 20:55:06,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59de4ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:55:06, skipping insertion in model container [2024-11-22 20:55:06,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:55:06" (3/3) ... [2024-11-22 20:55:06,719 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-2.i [2024-11-22 20:55:06,748 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 20:55:06,749 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-22 20:55:06,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 20:55:06,835 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;@46c127c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 20:55:06,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-22 20:55:06,844 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-22 20:55:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 20:55:06,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:06,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 20:55:06,851 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-22 20:55:06,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1758428, now seen corresponding path program 1 times [2024-11-22 20:55:06,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:06,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191860743] [2024-11-22 20:55:06,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:06,869 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-22 20:55:06,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:06,872 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-22 20:55:06,890 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-22 20:55:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:07,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:55:07,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:07,125 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-22 20:55:07,127 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-22 20:55:07,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:07,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:07,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191860743] [2024-11-22 20:55:07,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191860743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:07,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:07,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:07,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79185714] [2024-11-22 20:55:07,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:07,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:07,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:07,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-22 20:55:07,204 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-22 20:55:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:09,240 INFO L93 Difference]: Finished difference Result 1448 states and 1549 transitions. [2024-11-22 20:55:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:09,243 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-22 20:55:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:09,265 INFO L225 Difference]: With dead ends: 1448 [2024-11-22 20:55:09,265 INFO L226 Difference]: Without dead ends: 1445 [2024-11-22 20:55:09,266 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-22 20:55:09,269 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 426 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:09,270 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.9s Time] [2024-11-22 20:55:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-22 20:55:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1048. [2024-11-22 20:55:09,375 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-22 20:55:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1105 transitions. [2024-11-22 20:55:09,383 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1105 transitions. Word has length 4 [2024-11-22 20:55:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:09,383 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1105 transitions. [2024-11-22 20:55:09,384 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-22 20:55:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1105 transitions. [2024-11-22 20:55:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 20:55:09,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:09,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 20:55:09,389 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 (2)] Forceful destruction successful, exit code 0 [2024-11-22 20:55:09,585 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-22 20:55:09,585 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-22 20:55:09,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-22 20:55:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144677019] [2024-11-22 20:55:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:09,587 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-22 20:55:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:09,589 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-22 20:55:09,590 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-22 20:55:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:09,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:09,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:09,708 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-22 20:55:09,724 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-22 20:55:09,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:09,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:09,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144677019] [2024-11-22 20:55:09,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144677019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:09,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:09,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:55:09,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935893593] [2024-11-22 20:55:09,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:09,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:55:09,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:09,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:55:09,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:55:09,727 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-22 20:55:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:11,227 INFO L93 Difference]: Finished difference Result 1224 states and 1291 transitions. [2024-11-22 20:55:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:55:11,228 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-22 20:55:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:11,232 INFO L225 Difference]: With dead ends: 1224 [2024-11-22 20:55:11,232 INFO L226 Difference]: Without dead ends: 1224 [2024-11-22 20:55:11,232 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-22 20:55:11,233 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-22 20:55:11,234 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-22 20:55:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-22 20:55:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1045. [2024-11-22 20:55:11,267 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-22 20:55:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1103 transitions. [2024-11-22 20:55:11,272 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1103 transitions. Word has length 4 [2024-11-22 20:55:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:11,272 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1103 transitions. [2024-11-22 20:55:11,272 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-22 20:55:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1103 transitions. [2024-11-22 20:55:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 20:55:11,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:11,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 20:55:11,277 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-22 20:55:11,475 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-22 20:55:11,476 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-22 20:55:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-22 20:55:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:11,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759660045] [2024-11-22 20:55:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:11,477 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-22 20:55:11,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:11,480 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-22 20:55:11,481 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-22 20:55:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:11,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:55:11,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:11,590 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-22 20:55:11,615 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-22 20:55:11,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:11,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759660045] [2024-11-22 20:55:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759660045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:55:11,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914158121] [2024-11-22 20:55:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:11,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:55:11,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:11,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:55:11,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:55:11,617 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-22 20:55:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:13,733 INFO L93 Difference]: Finished difference Result 1457 states and 1547 transitions. [2024-11-22 20:55:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:55:13,734 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-22 20:55:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:13,738 INFO L225 Difference]: With dead ends: 1457 [2024-11-22 20:55:13,739 INFO L226 Difference]: Without dead ends: 1457 [2024-11-22 20:55:13,739 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-22 20:55:13,742 INFO L432 NwaCegarLoop]: 904 mSDtfsCounter, 444 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:13,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1483 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 20:55:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2024-11-22 20:55:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1170. [2024-11-22 20:55:13,766 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-22 20:55:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1332 transitions. [2024-11-22 20:55:13,772 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1332 transitions. Word has length 4 [2024-11-22 20:55:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:13,772 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1332 transitions. [2024-11-22 20:55:13,772 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-22 20:55:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1332 transitions. [2024-11-22 20:55:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 20:55:13,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:13,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:13,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 20:55:13,973 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-22 20:55:13,974 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-22 20:55:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-22 20:55:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311332101] [2024-11-22 20:55:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:13,975 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-22 20:55:13,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:13,979 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-22 20:55:13,980 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-22 20:55:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:14,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 20:55:14,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:14,115 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-22 20:55:14,124 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-22 20:55:14,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:55:14,210 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-22 20:55:14,228 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 20:55:14,228 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-22 20:55:14,251 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-22 20:55:14,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:14,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311332101] [2024-11-22 20:55:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311332101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044110128] [2024-11-22 20:55:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:14,253 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-22 20:55:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:16,475 INFO L93 Difference]: Finished difference Result 1338 states and 1508 transitions. [2024-11-22 20:55:16,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:16,476 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-22 20:55:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:16,480 INFO L225 Difference]: With dead ends: 1338 [2024-11-22 20:55:16,480 INFO L226 Difference]: Without dead ends: 1338 [2024-11-22 20:55:16,481 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-22 20:55:16,482 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.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:16,482 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.2s Time] [2024-11-22 20:55:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-11-22 20:55:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1033. [2024-11-22 20:55:16,501 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-22 20:55:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1090 transitions. [2024-11-22 20:55:16,505 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1090 transitions. Word has length 8 [2024-11-22 20:55:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:16,505 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1090 transitions. [2024-11-22 20:55:16,506 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-22 20:55:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1090 transitions. [2024-11-22 20:55:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 20:55:16,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:16,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:16,512 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-22 20:55:16,707 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-22 20:55:16,707 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-22 20:55:16,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-22 20:55:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496799521] [2024-11-22 20:55:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:16,710 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-22 20:55:16,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:16,713 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-22 20:55:16,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 20:55:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:16,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:16,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:16,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 20:55:16,845 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-22 20:55:16,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:16,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496799521] [2024-11-22 20:55:16,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496799521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:16,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:16,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:55:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825607672] [2024-11-22 20:55:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:16,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:55:16,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:55:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:55:16,847 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-22 20:55:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:18,051 INFO L93 Difference]: Finished difference Result 1198 states and 1276 transitions. [2024-11-22 20:55:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:55:18,051 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-22 20:55:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:18,054 INFO L225 Difference]: With dead ends: 1198 [2024-11-22 20:55:18,054 INFO L226 Difference]: Without dead ends: 1198 [2024-11-22 20:55:18,055 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-22 20:55:18,055 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-22 20:55:18,055 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-22 20:55:18,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-22 20:55:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 986. [2024-11-22 20:55:18,070 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-22 20:55:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1043 transitions. [2024-11-22 20:55:18,073 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1043 transitions. Word has length 9 [2024-11-22 20:55:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:18,074 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1043 transitions. [2024-11-22 20:55:18,074 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-22 20:55:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1043 transitions. [2024-11-22 20:55:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 20:55:18,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:18,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:18,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 20:55:18,275 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-22 20:55:18,276 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-22 20:55:18,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:18,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-22 20:55:18,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:18,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688496816] [2024-11-22 20:55:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:18,277 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-22 20:55:18,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:18,278 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-22 20:55:18,279 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-22 20:55:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:18,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:55:18,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:18,404 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-22 20:55:18,429 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-22 20:55:18,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:18,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:18,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688496816] [2024-11-22 20:55:18,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688496816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:18,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:18,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:55:18,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566841632] [2024-11-22 20:55:18,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:18,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:55:18,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:18,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:55:18,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:55:18,431 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-22 20:55:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:19,954 INFO L93 Difference]: Finished difference Result 1274 states and 1355 transitions. [2024-11-22 20:55:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:55:19,955 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-22 20:55:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:19,958 INFO L225 Difference]: With dead ends: 1274 [2024-11-22 20:55:19,958 INFO L226 Difference]: Without dead ends: 1274 [2024-11-22 20:55:19,959 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-22 20:55:19,959 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-22 20:55:19,959 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-22 20:55:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-22 20:55:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1013. [2024-11-22 20:55:19,974 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-22 20:55:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1107 transitions. [2024-11-22 20:55:19,977 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1107 transitions. Word has length 9 [2024-11-22 20:55:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:19,977 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1107 transitions. [2024-11-22 20:55:19,977 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-22 20:55:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1107 transitions. [2024-11-22 20:55:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 20:55:19,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:19,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:19,984 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-22 20:55:20,184 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-22 20:55:20,185 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-22 20:55:20,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash -153057981, now seen corresponding path program 1 times [2024-11-22 20:55:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389256770] [2024-11-22 20:55:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:20,186 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-22 20:55:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:20,189 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-22 20:55:20,190 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-22 20:55:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:20,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:20,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:55:20,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:20,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389256770] [2024-11-22 20:55:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389256770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:20,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:20,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700240629] [2024-11-22 20:55:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:20,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:55:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:20,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:55:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:55:20,360 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-22 20:55:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:20,558 INFO L93 Difference]: Finished difference Result 1453 states and 1602 transitions. [2024-11-22 20:55:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:55:20,558 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-22 20:55:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:20,562 INFO L225 Difference]: With dead ends: 1453 [2024-11-22 20:55:20,562 INFO L226 Difference]: Without dead ends: 1453 [2024-11-22 20:55:20,562 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-22 20:55:20,563 INFO L432 NwaCegarLoop]: 1093 mSDtfsCounter, 466 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 20:55:20,563 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-22 20:55:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-22 20:55:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1187. [2024-11-22 20:55:20,578 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-22 20:55:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1400 transitions. [2024-11-22 20:55:20,581 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1400 transitions. Word has length 12 [2024-11-22 20:55:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:20,581 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1400 transitions. [2024-11-22 20:55:20,582 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-22 20:55:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1400 transitions. [2024-11-22 20:55:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 20:55:20,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:20,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:20,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 20:55:20,783 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-22 20:55:20,783 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-22 20:55:20,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1410939272, now seen corresponding path program 1 times [2024-11-22 20:55:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:20,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136471548] [2024-11-22 20:55:20,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:20,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:55:20,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:20,786 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-22 20:55:20,786 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-22 20:55:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:20,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:55:20,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:20,904 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-22 20:55:20,904 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:20,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136471548] [2024-11-22 20:55:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136471548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694400059] [2024-11-22 20:55:20,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:20,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:55:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:55:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:55:20,905 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-22 20:55:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:20,936 INFO L93 Difference]: Finished difference Result 1127 states and 1314 transitions. [2024-11-22 20:55:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:55:20,937 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-22 20:55:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:20,940 INFO L225 Difference]: With dead ends: 1127 [2024-11-22 20:55:20,941 INFO L226 Difference]: Without dead ends: 1127 [2024-11-22 20:55:20,941 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-22 20:55:20,942 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-22 20:55:20,943 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-22 20:55:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-11-22 20:55:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2024-11-22 20:55:20,958 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-22 20:55:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1314 transitions. [2024-11-22 20:55:20,961 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1314 transitions. Word has length 14 [2024-11-22 20:55:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1314 transitions. [2024-11-22 20:55:20,961 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-22 20:55:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1314 transitions. [2024-11-22 20:55:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 20:55:20,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:20,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:20,969 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-22 20:55:21,163 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-22 20:55:21,164 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-22 20:55:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1512080444, now seen corresponding path program 1 times [2024-11-22 20:55:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:21,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9903874] [2024-11-22 20:55:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:21,165 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-22 20:55:21,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:21,166 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-22 20:55:21,167 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-22 20:55:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:21,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:55:21,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:21,421 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-22 20:55:21,422 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-22 20:55:21,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:21,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9903874] [2024-11-22 20:55:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9903874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:21,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:21,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179412391] [2024-11-22 20:55:21,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:21,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-22 20:55:21,424 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-22 20:55:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:22,684 INFO L93 Difference]: Finished difference Result 1402 states and 1609 transitions. [2024-11-22 20:55:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:22,685 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-22 20:55:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:22,689 INFO L225 Difference]: With dead ends: 1402 [2024-11-22 20:55:22,689 INFO L226 Difference]: Without dead ends: 1400 [2024-11-22 20:55:22,689 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-22 20:55:22,690 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 286 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1280 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:22,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1406 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 564 Invalid, 0 Unknown, 1280 Unchecked, 1.2s Time] [2024-11-22 20:55:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2024-11-22 20:55:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1198. [2024-11-22 20:55:22,705 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-22 20:55:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1420 transitions. [2024-11-22 20:55:22,708 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1420 transitions. Word has length 15 [2024-11-22 20:55:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:22,708 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1420 transitions. [2024-11-22 20:55:22,708 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-22 20:55:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1420 transitions. [2024-11-22 20:55:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 20:55:22,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:22,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:22,716 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-22 20:55:22,909 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-22 20:55:22,910 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-22 20:55:22,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1512073534, now seen corresponding path program 1 times [2024-11-22 20:55:22,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:22,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969459136] [2024-11-22 20:55:22,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:22,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-22 20:55:22,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:22,914 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-22 20:55:22,915 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-22 20:55:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:23,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 20:55:23,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:23,092 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-22 20:55:23,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:23,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969459136] [2024-11-22 20:55:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969459136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:23,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675254599] [2024-11-22 20:55:23,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:23,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:23,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:23,094 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-22 20:55:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:23,586 INFO L93 Difference]: Finished difference Result 1442 states and 1623 transitions. [2024-11-22 20:55:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:23,587 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-22 20:55:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:23,591 INFO L225 Difference]: With dead ends: 1442 [2024-11-22 20:55:23,591 INFO L226 Difference]: Without dead ends: 1438 [2024-11-22 20:55:23,592 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-22 20:55:23,592 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 425 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:23,593 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.5s Time] [2024-11-22 20:55:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-22 20:55:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1196. [2024-11-22 20:55:23,606 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-22 20:55:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1417 transitions. [2024-11-22 20:55:23,610 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1417 transitions. Word has length 15 [2024-11-22 20:55:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:23,610 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1417 transitions. [2024-11-22 20:55:23,610 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-22 20:55:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1417 transitions. [2024-11-22 20:55:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 20:55:23,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:23,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:55:23,617 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-22 20:55:23,813 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-22 20:55:23,813 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-22 20:55:23,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1297050578, now seen corresponding path program 1 times [2024-11-22 20:55:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789814345] [2024-11-22 20:55:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:23,814 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-22 20:55:23,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:23,818 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-22 20:55:23,819 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-22 20:55:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:23,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:23,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:23,970 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-22 20:55:23,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:23,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:23,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789814345] [2024-11-22 20:55:23,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789814345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:23,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:23,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:23,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152036463] [2024-11-22 20:55:23,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:23,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:23,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:23,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:23,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:23,972 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-22 20:55:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:24,045 INFO L93 Difference]: Finished difference Result 1158 states and 1330 transitions. [2024-11-22 20:55:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:55:24,046 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-22 20:55:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:24,049 INFO L225 Difference]: With dead ends: 1158 [2024-11-22 20:55:24,049 INFO L226 Difference]: Without dead ends: 1158 [2024-11-22 20:55:24,049 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-22 20:55:24,050 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-22 20:55:24,050 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-22 20:55:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-22 20:55:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-22 20:55:24,064 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-22 20:55:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1330 transitions. [2024-11-22 20:55:24,067 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1330 transitions. Word has length 16 [2024-11-22 20:55:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:24,067 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1330 transitions. [2024-11-22 20:55:24,067 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-22 20:55:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1330 transitions. [2024-11-22 20:55:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 20:55:24,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:24,068 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-22 20:55:24,073 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-22 20:55:24,271 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-22 20:55:24,272 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-22 20:55:24,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-22 20:55:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:24,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328180942] [2024-11-22 20:55:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:24,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-22 20:55:24,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:24,274 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-22 20:55:24,275 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-22 20:55:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:24,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:55:24,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:24,440 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-22 20:55:24,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:24,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:24,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328180942] [2024-11-22 20:55:24,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328180942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:24,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:24,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:24,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114968322] [2024-11-22 20:55:24,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:24,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:55:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:24,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:55:24,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:55:24,442 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-22 20:55:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:24,468 INFO L93 Difference]: Finished difference Result 1098 states and 1244 transitions. [2024-11-22 20:55:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:55:24,468 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-22 20:55:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:24,471 INFO L225 Difference]: With dead ends: 1098 [2024-11-22 20:55:24,472 INFO L226 Difference]: Without dead ends: 1098 [2024-11-22 20:55:24,472 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-22 20:55:24,472 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-22 20:55:24,473 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-22 20:55:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-22 20:55:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2024-11-22 20:55:24,484 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-22 20:55:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1244 transitions. [2024-11-22 20:55:24,488 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1244 transitions. Word has length 19 [2024-11-22 20:55:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:24,488 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1244 transitions. [2024-11-22 20:55:24,488 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-22 20:55:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1244 transitions. [2024-11-22 20:55:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 20:55:24,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:24,493 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-22 20:55:24,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-22 20:55:24,693 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-22 20:55:24,693 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-22 20:55:24,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -774929132, now seen corresponding path program 1 times [2024-11-22 20:55:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798420297] [2024-11-22 20:55:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:24,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:55:24,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:24,696 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-22 20:55:24,697 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-22 20:55:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:24,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:24,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:24,887 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-22 20:55:24,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:24,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798420297] [2024-11-22 20:55:24,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798420297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:24,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:24,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:24,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922621995] [2024-11-22 20:55:24,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:24,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:24,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:24,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:24,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:24,889 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-22 20:55:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:24,979 INFO L93 Difference]: Finished difference Result 1068 states and 1186 transitions. [2024-11-22 20:55:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:55:24,980 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-22 20:55:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:24,983 INFO L225 Difference]: With dead ends: 1068 [2024-11-22 20:55:24,983 INFO L226 Difference]: Without dead ends: 1068 [2024-11-22 20:55:24,983 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-22 20:55:24,984 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:24,984 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.1s Time] [2024-11-22 20:55:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2024-11-22 20:55:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2024-11-22 20:55:24,994 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-22 20:55:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1186 transitions. [2024-11-22 20:55:24,997 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1186 transitions. Word has length 21 [2024-11-22 20:55:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:24,997 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1186 transitions. [2024-11-22 20:55:24,998 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-22 20:55:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1186 transitions. [2024-11-22 20:55:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 20:55:24,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:24,998 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-22 20:55:25,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-22 20:55:25,199 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-22 20:55:25,199 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-22 20:55:25,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash 727437120, now seen corresponding path program 1 times [2024-11-22 20:55:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037273773] [2024-11-22 20:55:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:25,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:55:25,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:25,203 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-22 20:55:25,205 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-22 20:55:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:25,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:55:25,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:25,359 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-22 20:55:25,430 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-22 20:55:25,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:25,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037273773] [2024-11-22 20:55:25,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037273773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:25,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:25,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:25,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439877255] [2024-11-22 20:55:25,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:25,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:25,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:25,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:25,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:25,433 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-22 20:55:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:26,677 INFO L93 Difference]: Finished difference Result 1255 states and 1374 transitions. [2024-11-22 20:55:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:26,678 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-22 20:55:26,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:26,680 INFO L225 Difference]: With dead ends: 1255 [2024-11-22 20:55:26,681 INFO L226 Difference]: Without dead ends: 1255 [2024-11-22 20:55:26,681 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-22 20:55:26,681 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 774 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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-22 20:55:26,681 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-22 20:55:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-22 20:55:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1064. [2024-11-22 20:55:26,691 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-22 20:55:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1174 transitions. [2024-11-22 20:55:26,692 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1174 transitions. Word has length 30 [2024-11-22 20:55:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:26,693 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1174 transitions. [2024-11-22 20:55:26,693 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-22 20:55:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1174 transitions. [2024-11-22 20:55:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 20:55:26,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:26,695 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-22 20:55:26,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-22 20:55:26,895 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-22 20:55:26,896 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-22 20:55:26,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 727437121, now seen corresponding path program 1 times [2024-11-22 20:55:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788302835] [2024-11-22 20:55:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:26,897 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-22 20:55:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:26,898 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-22 20:55:26,899 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-22 20:55:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:27,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:55:27,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:27,025 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-22 20:55:27,174 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-22 20:55:27,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:27,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:27,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788302835] [2024-11-22 20:55:27,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788302835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:27,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:27,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385123943] [2024-11-22 20:55:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:27,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:27,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:27,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:27,176 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-22 20:55:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:28,519 INFO L93 Difference]: Finished difference Result 1071 states and 1176 transitions. [2024-11-22 20:55:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:28,520 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-22 20:55:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:28,522 INFO L225 Difference]: With dead ends: 1071 [2024-11-22 20:55:28,522 INFO L226 Difference]: Without dead ends: 1071 [2024-11-22 20:55:28,523 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-22 20:55:28,523 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 79 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:28,523 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.3s Time] [2024-11-22 20:55:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-22 20:55:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1064. [2024-11-22 20:55:28,534 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-22 20:55:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1170 transitions. [2024-11-22 20:55:28,535 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1170 transitions. Word has length 30 [2024-11-22 20:55:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:28,536 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1170 transitions. [2024-11-22 20:55:28,536 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-22 20:55:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1170 transitions. [2024-11-22 20:55:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 20:55:28,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:28,537 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-22 20:55:28,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-22 20:55:28,737 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-22 20:55:28,737 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-22 20:55:28,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064798, now seen corresponding path program 1 times [2024-11-22 20:55:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:28,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560644537] [2024-11-22 20:55:28,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:28,739 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-22 20:55:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:28,742 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-22 20:55:28,743 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-22 20:55:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:28,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:55:28,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:28,908 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-22 20:55:28,982 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-22 20:55:28,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:28,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560644537] [2024-11-22 20:55:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560644537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:28,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:28,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057322957] [2024-11-22 20:55:28,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:28,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:28,984 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-22 20:55:30,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:30,119 INFO L93 Difference]: Finished difference Result 1071 states and 1172 transitions. [2024-11-22 20:55:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:30,120 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-22 20:55:30,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:30,122 INFO L225 Difference]: With dead ends: 1071 [2024-11-22 20:55:30,122 INFO L226 Difference]: Without dead ends: 1071 [2024-11-22 20:55:30,122 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-22 20:55:30,123 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 600 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:30,123 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.1s Time] [2024-11-22 20:55:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-22 20:55:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2024-11-22 20:55:30,130 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-22 20:55:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1162 transitions. [2024-11-22 20:55:30,132 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1162 transitions. Word has length 35 [2024-11-22 20:55:30,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:30,132 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1162 transitions. [2024-11-22 20:55:30,132 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-22 20:55:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1162 transitions. [2024-11-22 20:55:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 20:55:30,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:30,133 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-22 20:55:30,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-22 20:55:30,333 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-22 20:55:30,334 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-22 20:55:30,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064797, now seen corresponding path program 1 times [2024-11-22 20:55:30,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:30,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132336693] [2024-11-22 20:55:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:30,335 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-22 20:55:30,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:30,336 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-22 20:55:30,337 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-22 20:55:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:30,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:55:30,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:30,510 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-22 20:55:30,684 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-22 20:55:30,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:30,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:30,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132336693] [2024-11-22 20:55:30,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132336693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:30,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243083197] [2024-11-22 20:55:30,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:30,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:30,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:30,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:30,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:30,686 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-22 20:55:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:32,271 INFO L93 Difference]: Finished difference Result 1317 states and 1404 transitions. [2024-11-22 20:55:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:32,271 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-22 20:55:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:32,275 INFO L225 Difference]: With dead ends: 1317 [2024-11-22 20:55:32,275 INFO L226 Difference]: Without dead ends: 1317 [2024-11-22 20:55:32,275 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-22 20:55:32,275 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 347 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:32,275 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.6s Time] [2024-11-22 20:55:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-11-22 20:55:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1056. [2024-11-22 20:55:32,284 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-22 20:55:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1154 transitions. [2024-11-22 20:55:32,286 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1154 transitions. Word has length 35 [2024-11-22 20:55:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:32,286 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1154 transitions. [2024-11-22 20:55:32,286 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-22 20:55:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1154 transitions. [2024-11-22 20:55:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-22 20:55:32,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:32,287 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-22 20:55:32,291 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-22 20:55:32,487 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-22 20:55:32,488 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-22 20:55:32,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1556225793, now seen corresponding path program 1 times [2024-11-22 20:55:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61414386] [2024-11-22 20:55:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:32,489 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-22 20:55:32,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:32,492 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-22 20:55:32,493 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-22 20:55:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:32,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:32,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:55:32,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:32,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:32,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61414386] [2024-11-22 20:55:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61414386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:32,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207480104] [2024-11-22 20:55:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:32,700 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-22 20:55:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:32,757 INFO L93 Difference]: Finished difference Result 1038 states and 1124 transitions. [2024-11-22 20:55:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:55:32,758 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-22 20:55:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:32,760 INFO L225 Difference]: With dead ends: 1038 [2024-11-22 20:55:32,760 INFO L226 Difference]: Without dead ends: 1038 [2024-11-22 20:55:32,761 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-22 20:55:32,761 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-22 20:55:32,762 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-22 20:55:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-22 20:55:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-11-22 20:55:32,772 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-22 20:55:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1124 transitions. [2024-11-22 20:55:32,774 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1124 transitions. Word has length 50 [2024-11-22 20:55:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:32,774 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1124 transitions. [2024-11-22 20:55:32,774 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-22 20:55:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1124 transitions. [2024-11-22 20:55:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 20:55:32,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:32,776 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-22 20:55:32,782 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-22 20:55:32,979 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-22 20:55:32,980 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-22 20:55:32,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash -848059422, now seen corresponding path program 1 times [2024-11-22 20:55:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242761141] [2024-11-22 20:55:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:32,981 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-22 20:55:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:32,982 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-22 20:55:32,983 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-22 20:55:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:33,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:33,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:33,223 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-22 20:55:33,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:33,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:33,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242761141] [2024-11-22 20:55:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242761141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:33,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:33,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:33,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807780009] [2024-11-22 20:55:33,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:33,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:33,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:33,225 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-22 20:55:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:33,282 INFO L93 Difference]: Finished difference Result 1026 states and 1104 transitions. [2024-11-22 20:55:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:55:33,283 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-22 20:55:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:33,287 INFO L225 Difference]: With dead ends: 1026 [2024-11-22 20:55:33,287 INFO L226 Difference]: Without dead ends: 1026 [2024-11-22 20:55:33,287 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-22 20:55:33,288 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-22 20:55:33,288 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-22 20:55:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-22 20:55:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2024-11-22 20:55:33,297 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-22 20:55:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1104 transitions. [2024-11-22 20:55:33,299 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1104 transitions. Word has length 54 [2024-11-22 20:55:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:33,299 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1104 transitions. [2024-11-22 20:55:33,299 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-22 20:55:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1104 transitions. [2024-11-22 20:55:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-22 20:55:33,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:33,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 20:55:33,308 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-22 20:55:33,501 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-22 20:55:33,501 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-22 20:55:33,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash 619385421, now seen corresponding path program 1 times [2024-11-22 20:55:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319548148] [2024-11-22 20:55:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:33,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:55:33,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:33,504 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-22 20:55:33,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-22 20:55:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:33,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 20:55:33,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:33,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:55:33,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:55:33,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:55:33,763 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-22 20:55:33,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 20:55:33,815 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-22 20:55:33,858 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-22 20:55:33,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:33,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319548148] [2024-11-22 20:55:33,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319548148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:33,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:33,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 20:55:33,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277894276] [2024-11-22 20:55:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:33,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 20:55:33,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:33,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 20:55:33,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:55:33,863 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-22 20:55:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:34,143 INFO L93 Difference]: Finished difference Result 1498 states and 1597 transitions. [2024-11-22 20:55:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:55:34,144 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-22 20:55:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:34,148 INFO L225 Difference]: With dead ends: 1498 [2024-11-22 20:55:34,149 INFO L226 Difference]: Without dead ends: 1495 [2024-11-22 20:55:34,149 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-22 20:55:34,150 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-22 20:55:34,150 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-22 20:55:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-22 20:55:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 972. [2024-11-22 20:55:34,163 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-22 20:55:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1048 transitions. [2024-11-22 20:55:34,164 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1048 transitions. Word has length 58 [2024-11-22 20:55:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:34,165 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1048 transitions. [2024-11-22 20:55:34,165 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-22 20:55:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1048 transitions. [2024-11-22 20:55:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 20:55:34,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:34,169 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-22 20:55:34,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-22 20:55:34,369 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-22 20:55:34,370 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-22 20:55:34,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:34,370 INFO L85 PathProgramCache]: Analyzing trace with hash 887665558, now seen corresponding path program 1 times [2024-11-22 20:55:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:34,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883382719] [2024-11-22 20:55:34,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:34,371 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-22 20:55:34,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:34,375 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-22 20:55:34,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 (22)] Waiting until timeout for monitored process [2024-11-22 20:55:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:34,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 20:55:34,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:34,665 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-22 20:55:34,673 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-22 20:55:35,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:55:35,130 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-22 20:55:35,143 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 20:55:35,144 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-22 20:55:35,155 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-22 20:55:35,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:35,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883382719] [2024-11-22 20:55:35,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883382719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:35,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:35,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:55:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149346319] [2024-11-22 20:55:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:35,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:35,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:35,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:35,157 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-22 20:55:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:36,285 INFO L93 Difference]: Finished difference Result 934 states and 1010 transitions. [2024-11-22 20:55:36,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:36,285 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-22 20:55:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:36,288 INFO L225 Difference]: With dead ends: 934 [2024-11-22 20:55:36,288 INFO L226 Difference]: Without dead ends: 934 [2024-11-22 20:55:36,288 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-22 20:55:36,288 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 1044 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:36,289 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.1s Time] [2024-11-22 20:55:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-11-22 20:55:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 897. [2024-11-22 20:55:36,296 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-22 20:55:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 936 transitions. [2024-11-22 20:55:36,297 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 936 transitions. Word has length 62 [2024-11-22 20:55:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:36,297 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 936 transitions. [2024-11-22 20:55:36,297 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-22 20:55:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 936 transitions. [2024-11-22 20:55:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 20:55:36,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:36,298 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-22 20:55:36,305 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-22 20:55:36,498 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-22 20:55:36,498 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-22 20:55:36,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:36,499 INFO L85 PathProgramCache]: Analyzing trace with hash 512421051, now seen corresponding path program 1 times [2024-11-22 20:55:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:36,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648357393] [2024-11-22 20:55:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:36,499 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-22 20:55:36,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:36,500 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-22 20:55:36,502 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-22 20:55:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:36,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 20:55:36,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:36,726 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-22 20:55:36,742 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-22 20:55:36,757 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-22 20:55:36,763 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-22 20:55:36,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:36,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:36,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648357393] [2024-11-22 20:55:36,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648357393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:36,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:36,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:36,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151080268] [2024-11-22 20:55:36,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:36,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:55:36,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:36,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:55:36,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:55:36,765 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-22 20:55:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:38,132 INFO L93 Difference]: Finished difference Result 896 states and 935 transitions. [2024-11-22 20:55:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:55:38,133 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-22 20:55:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:38,136 INFO L225 Difference]: With dead ends: 896 [2024-11-22 20:55:38,136 INFO L226 Difference]: Without dead ends: 896 [2024-11-22 20:55:38,136 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-22 20:55:38,136 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 2 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:38,137 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.3s Time] [2024-11-22 20:55:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-11-22 20:55:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2024-11-22 20:55:38,143 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-22 20:55:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 935 transitions. [2024-11-22 20:55:38,144 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 935 transitions. Word has length 67 [2024-11-22 20:55:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:38,144 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 935 transitions. [2024-11-22 20:55:38,145 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-22 20:55:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 935 transitions. [2024-11-22 20:55:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 20:55:38,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:38,145 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-22 20:55:38,151 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-22 20:55:38,345 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-22 20:55:38,346 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-22 20:55:38,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:38,346 INFO L85 PathProgramCache]: Analyzing trace with hash 512421052, now seen corresponding path program 1 times [2024-11-22 20:55:38,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613344074] [2024-11-22 20:55:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:38,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:55:38,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:38,348 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-22 20:55:38,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-22 20:55:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:38,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 20:55:38,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:38,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 20:55:38,622 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-22 20:55:38,629 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-22 20:55:38,664 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-22 20:55:38,682 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-22 20:55:38,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:38,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:38,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613344074] [2024-11-22 20:55:38,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613344074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:38,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:38,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:38,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843476668] [2024-11-22 20:55:38,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:38,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:55:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:55:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:55:38,684 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-22 20:55:40,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:40,404 INFO L93 Difference]: Finished difference Result 895 states and 934 transitions. [2024-11-22 20:55:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:55:40,405 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-22 20:55:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:40,407 INFO L225 Difference]: With dead ends: 895 [2024-11-22 20:55:40,407 INFO L226 Difference]: Without dead ends: 895 [2024-11-22 20:55:40,407 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-22 20:55:40,408 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 1 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2024-11-22 20:55:40,408 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.7s Time] [2024-11-22 20:55:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-22 20:55:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2024-11-22 20:55:40,417 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-22 20:55:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 934 transitions. [2024-11-22 20:55:40,419 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 934 transitions. Word has length 67 [2024-11-22 20:55:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:40,419 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 934 transitions. [2024-11-22 20:55:40,419 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-22 20:55:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 934 transitions. [2024-11-22 20:55:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 20:55:40,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:40,420 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-22 20:55:40,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-22 20:55:40,621 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-22 20:55:40,621 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-22 20:55:40,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1667443458, now seen corresponding path program 1 times [2024-11-22 20:55:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:40,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980582435] [2024-11-22 20:55:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:40,622 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-22 20:55:40,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:40,623 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-22 20:55:40,624 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-22 20:55:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:40,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:55:40,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:40,890 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-22 20:55:40,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:55:40,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980582435] [2024-11-22 20:55:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980582435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:55:40,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:55:40,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:55:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77531408] [2024-11-22 20:55:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:55:40,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:55:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:40,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:55:40,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:55:40,893 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-22 20:55:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:40,928 INFO L93 Difference]: Finished difference Result 898 states and 938 transitions. [2024-11-22 20:55:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:55:40,929 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-22 20:55:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:40,933 INFO L225 Difference]: With dead ends: 898 [2024-11-22 20:55:40,933 INFO L226 Difference]: Without dead ends: 898 [2024-11-22 20:55:40,934 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-22 20:55:40,934 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-22 20:55:40,935 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-22 20:55:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-22 20:55:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 898. [2024-11-22 20:55:40,947 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-22 20:55:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 938 transitions. [2024-11-22 20:55:40,949 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 938 transitions. Word has length 75 [2024-11-22 20:55:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:40,949 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 938 transitions. [2024-11-22 20:55:40,949 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-22 20:55:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 938 transitions. [2024-11-22 20:55:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-22 20:55:40,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:40,950 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-22 20:55:40,959 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-22 20:55:41,153 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-22 20:55:41,154 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-22 20:55:41,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:41,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1126673817, now seen corresponding path program 1 times [2024-11-22 20:55:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666502931] [2024-11-22 20:55:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:55:41,155 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-22 20:55:41,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:41,158 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-22 20:55:41,160 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-22 20:55:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:55:41,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:55:41,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:41,437 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-22 20:55:41,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:55:41,483 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-22 20:55:41,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666502931] [2024-11-22 20:55:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666502931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:55:41,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:55:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 20:55:41,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747611276] [2024-11-22 20:55:41,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:55:41,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 20:55:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:41,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 20:55:41,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 20:55:41,485 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-22 20:55:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:41,587 INFO L93 Difference]: Finished difference Result 910 states and 955 transitions. [2024-11-22 20:55:41,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 20:55:41,589 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-22 20:55:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:41,592 INFO L225 Difference]: With dead ends: 910 [2024-11-22 20:55:41,592 INFO L226 Difference]: Without dead ends: 910 [2024-11-22 20:55:41,592 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-22 20:55:41,593 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-22 20:55:41,593 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-22 20:55:41,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-22 20:55:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 908. [2024-11-22 20:55:41,605 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-22 20:55:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 953 transitions. [2024-11-22 20:55:41,607 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 953 transitions. Word has length 76 [2024-11-22 20:55:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:41,607 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 953 transitions. [2024-11-22 20:55:41,607 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-22 20:55:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 953 transitions. [2024-11-22 20:55:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-22 20:55:41,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:41,608 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-22 20:55:41,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-22 20:55:41,808 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-22 20:55:41,809 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-22 20:55:41,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1908054210, now seen corresponding path program 2 times [2024-11-22 20:55:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:41,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278748187] [2024-11-22 20:55:41,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 20:55:41,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 20:55:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:41,814 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-22 20:55:41,816 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-22 20:55:42,248 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 20:55:42,248 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:55:42,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 20:55:42,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:42,300 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-22 20:55:42,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:55:42,459 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-22 20:55:42,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:42,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278748187] [2024-11-22 20:55:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278748187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:55:42,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:55:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 20:55:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097930959] [2024-11-22 20:55:42,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:55:42,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 20:55:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:42,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 20:55:42,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 20:55:42,463 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-22 20:55:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:42,849 INFO L93 Difference]: Finished difference Result 923 states and 975 transitions. [2024-11-22 20:55:42,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 20:55:42,850 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-22 20:55:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:42,852 INFO L225 Difference]: With dead ends: 923 [2024-11-22 20:55:42,852 INFO L226 Difference]: Without dead ends: 919 [2024-11-22 20:55:42,853 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-22 20:55:42,853 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-22 20:55:42,853 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-22 20:55:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-22 20:55:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 917. [2024-11-22 20:55:42,864 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-22 20:55:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 965 transitions. [2024-11-22 20:55:42,866 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 965 transitions. Word has length 79 [2024-11-22 20:55:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:42,866 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 965 transitions. [2024-11-22 20:55:42,866 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-22 20:55:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 965 transitions. [2024-11-22 20:55:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 20:55:42,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:42,867 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-22 20:55:42,878 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-22 20:55:43,071 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-22 20:55:43,072 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-22 20:55:43,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1759209118, now seen corresponding path program 3 times [2024-11-22 20:55:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660741136] [2024-11-22 20:55:43,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 20:55:43,073 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-22 20:55:43,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:43,074 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-22 20:55:43,075 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-22 20:55:43,701 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 20:55:43,701 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:55:43,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 20:55:43,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:43,834 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-22 20:55:43,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:55:44,315 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-22 20:55:44,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:44,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660741136] [2024-11-22 20:55:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660741136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:55:44,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:55:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 20:55:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232226176] [2024-11-22 20:55:44,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:55:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 20:55:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 20:55:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 20:55:44,317 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-22 20:55:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:45,741 INFO L93 Difference]: Finished difference Result 941 states and 1004 transitions. [2024-11-22 20:55:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 20:55:45,742 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-22 20:55:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:45,744 INFO L225 Difference]: With dead ends: 941 [2024-11-22 20:55:45,744 INFO L226 Difference]: Without dead ends: 935 [2024-11-22 20:55:45,745 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-22 20:55:45,745 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-22 20:55:45,746 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-22 20:55:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-22 20:55:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2024-11-22 20:55:45,755 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-22 20:55:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 988 transitions. [2024-11-22 20:55:45,757 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 988 transitions. Word has length 85 [2024-11-22 20:55:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:45,757 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 988 transitions. [2024-11-22 20:55:45,758 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-22 20:55:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 988 transitions. [2024-11-22 20:55:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 20:55:45,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:45,759 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-22 20:55:45,771 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-22 20:55:45,959 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-22 20:55:45,959 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-22 20:55:45,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash -46026078, now seen corresponding path program 4 times [2024-11-22 20:55:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:45,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364829524] [2024-11-22 20:55:45,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 20:55:45,961 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-22 20:55:45,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:45,962 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-22 20:55:45,962 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-22 20:55:46,388 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 20:55:46,388 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:55:46,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 20:55:46,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:46,749 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-22 20:55:46,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:55:47,889 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-22 20:55:47,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:47,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364829524] [2024-11-22 20:55:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364829524] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:55:47,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:55:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 20:55:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601314551] [2024-11-22 20:55:47,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:55:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 20:55:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:55:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 20:55:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 20:55:47,891 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-22 20:55:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:55:52,174 INFO L93 Difference]: Finished difference Result 975 states and 1060 transitions. [2024-11-22 20:55:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 20:55:52,175 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-22 20:55:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:55:52,177 INFO L225 Difference]: With dead ends: 975 [2024-11-22 20:55:52,177 INFO L226 Difference]: Without dead ends: 971 [2024-11-22 20:55:52,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 20:55:52,180 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 49 mSDsluCounter, 20074 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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-22 20:55:52,180 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-22 20:55:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-22 20:55:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2024-11-22 20:55:52,202 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-22 20:55:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1034 transitions. [2024-11-22 20:55:52,204 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1034 transitions. Word has length 97 [2024-11-22 20:55:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:55:52,204 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1034 transitions. [2024-11-22 20:55:52,204 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-22 20:55:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1034 transitions. [2024-11-22 20:55:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-22 20:55:52,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:55:52,206 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-22 20:55:52,219 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-22 20:55:52,407 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-22 20:55:52,407 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-22 20:55:52,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:55:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1131463234, now seen corresponding path program 5 times [2024-11-22 20:55:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:55:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443056939] [2024-11-22 20:55:52,409 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:55:52,409 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-22 20:55:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:55:52,410 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-22 20:55:52,411 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-22 20:55:53,534 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-22 20:55:53,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:55:53,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-22 20:55:53,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:55:53,571 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-22 20:55:53,688 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-22 20:55:53,689 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-22 20:55:53,716 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-22 20:55:53,826 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-22 20:55:54,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:55:54,644 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-22 20:55:54,698 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-22 20:55:54,739 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-22 20:55:54,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:55:55,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2197) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-22 20:55:55,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:55:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443056939] [2024-11-22 20:55:55,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443056939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:55:55,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1964880377] [2024-11-22 20:55:55,107 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:55:55,107 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 20:55:55,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 20:55:55,110 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-22 20:55:55,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process