./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:14:54,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:14:54,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:14:54,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:14:54,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:14:54,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:14:54,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:14:54,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:14:54,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:14:54,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:14:54,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:14:54,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:14:54,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:14:54,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:14:54,304 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:14:54,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:14:54,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:14:54,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:14:54,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:14:54,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:14:54,306 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:14:54,310 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:14:54,312 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:14:54,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:14:54,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:14:54,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:14:54,313 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:14:54,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:14:54,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:14:54,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:14:54,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:14:54,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:14:54,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:14:54,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:14:54,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:14:54,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:14:54,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:14:54,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:14:54,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:14:54,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:14:54,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:14:54,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:14:54,317 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 -> 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed [2024-11-19 09:14:54,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:14:54,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:14:54,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:14:54,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:14:54,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:14:54,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 09:14:55,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:14:56,135 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:14:56,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 09:14:56,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcead5e8d/7698dbbe87f74d22bde8e5133c71f5ca/FLAG0d4cbe802 [2024-11-19 09:14:56,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcead5e8d/7698dbbe87f74d22bde8e5133c71f5ca [2024-11-19 09:14:56,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:14:56,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:14:56,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:14:56,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:14:56,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:14:56,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:14:56" (1/1) ... [2024-11-19 09:14:56,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4286d8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:56, skipping insertion in model container [2024-11-19 09:14:56,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:14:56" (1/1) ... [2024-11-19 09:14:56,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:14:56,521 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,553 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,560 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,566 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,573 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,589 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,590 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,593 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,596 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,597 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,598 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,605 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:14:56,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:14:56,625 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 09:14:56,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@648dc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:56, skipping insertion in model container [2024-11-19 09:14:56,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:14:56,626 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:14:56,628 INFO L158 Benchmark]: Toolchain (without parser) took 459.34ms. Allocated memory is still 161.5MB. Free memory was 85.5MB in the beginning and 64.8MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 09:14:56,628 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:14:56,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.68ms. Allocated memory is still 161.5MB. Free memory was 85.3MB in the beginning and 64.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 09:14:56,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.68ms. Allocated memory is still 161.5MB. Free memory was 85.3MB in the beginning and 64.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 764]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:14:58,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:14:58,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:14:58,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:14:58,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:14:58,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:14:58,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:14:58,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:14:58,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:14:58,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:14:58,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:14:58,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:14:58,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:14:58,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:14:58,439 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:14:58,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:14:58,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:14:58,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:14:58,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:14:58,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:14:58,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:14:58,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:14:58,443 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:14:58,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:14:58,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:14:58,443 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:14:58,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:14:58,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:14:58,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:14:58,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:14:58,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:14:58,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:14:58,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:14:58,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:14:58,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:14:58,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:14:58,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:14:58,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:14:58,446 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:14:58,446 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:14:58,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:14:58,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:14:58,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:14:58,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:14:58,447 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 -> 1447114af8a4b489e3ec713f117f7a92d9cc93e5175903910b61bfe512c41aed [2024-11-19 09:14:58,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:14:58,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:14:58,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:14:58,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:14:58,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:14:58,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 09:15:00,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:15:00,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:15:00,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-2.i [2024-11-19 09:15:00,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ff5cec/54235a4649204924bcf66bdecb1d7509/FLAG3e22ba83a [2024-11-19 09:15:00,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47ff5cec/54235a4649204924bcf66bdecb1d7509 [2024-11-19 09:15:00,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:15:00,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:15:00,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:15:00,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:15:00,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:15:00,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:00" (1/1) ... [2024-11-19 09:15:00,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef6d0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:00, skipping insertion in model container [2024-11-19 09:15:00,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:00" (1/1) ... [2024-11-19 09:15:00,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:15:01,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-19 09:15:01,136 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,141 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,148 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,157 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,172 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,173 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,176 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,181 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:15:01,231 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:15:01,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:15:01,273 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,308 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,312 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,314 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,331 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,332 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,337 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,339 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,339 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,341 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,343 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:15:01,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:15:01,355 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:15:01,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:15:01,451 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:15:01,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01 WrapperNode [2024-11-19 09:15:01,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:15:01,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:15:01,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:15:01,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:15:01,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,551 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 807 [2024-11-19 09:15:01,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:15:01,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:15:01,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:15:01,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:15:01,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,627 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-19 09:15:01,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:15:01,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:15:01,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:15:01,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:15:01,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (1/1) ... [2024-11-19 09:15:01,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:15:01,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:15:01,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:15:01,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:15:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:15:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:15:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:15:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:15:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:15:01,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:15:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:15:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:15:01,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:15:01,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:15:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:15:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:15:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:15:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:15:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:15:01,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:15:01,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:15:01,960 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:01,996 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:04,082 INFO L? ?]: Removed 907 outVars from TransFormulas that were not future-live. [2024-11-19 09:15:04,083 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:15:04,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:15:04,114 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-19 09:15:04,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:04 BoogieIcfgContainer [2024-11-19 09:15:04,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:15:04,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:15:04,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:15:04,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:15:04,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:15:00" (1/3) ... [2024-11-19 09:15:04,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b83540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:04, skipping insertion in model container [2024-11-19 09:15:04,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:01" (2/3) ... [2024-11-19 09:15:04,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b83540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:04, skipping insertion in model container [2024-11-19 09:15:04,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:04" (3/3) ... [2024-11-19 09:15:04,123 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-2.i [2024-11-19 09:15:04,135 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:15:04,135 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-11-19 09:15:04,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:15:04,183 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;@36f2091e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:15:04,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-11-19 09:15:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 09:15:04,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:04,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:15:04,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:04,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-19 09:15:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548242732] [2024-11-19 09:15:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:04,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:04,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:15:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:04,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:04,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:04,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:15:04,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-19 09:15:04,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:04,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:04,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548242732] [2024-11-19 09:15:04,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548242732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:04,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:04,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503496798] [2024-11-19 09:15:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:04,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:04,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:04,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:04,389 INFO L87 Difference]: Start difference. First operand has 858 states, 420 states have (on average 2.2261904761904763) internal successors, (935), 852 states have internal predecessors, (935), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:05,503 INFO L93 Difference]: Finished difference Result 801 states and 859 transitions. [2024-11-19 09:15:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:05,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 09:15:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:05,519 INFO L225 Difference]: With dead ends: 801 [2024-11-19 09:15:05,519 INFO L226 Difference]: Without dead ends: 799 [2024-11-19 09:15:05,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:05,522 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 535 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:05,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 663 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 09:15:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-19 09:15:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 797. [2024-11-19 09:15:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 414 states have (on average 2.0) internal successors, (828), 791 states have internal predecessors, (828), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 854 transitions. [2024-11-19 09:15:05,576 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 854 transitions. Word has length 5 [2024-11-19 09:15:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:05,577 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 854 transitions. [2024-11-19 09:15:05,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 854 transitions. [2024-11-19 09:15:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 09:15:05,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:05,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:15:05,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:15:05,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:05,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:05,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-19 09:15:05,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:05,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712587500] [2024-11-19 09:15:05,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:05,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:05,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:15:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:05,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:15:05,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:05,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:15:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:05,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:05,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712587500] [2024-11-19 09:15:05,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712587500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:05,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:05,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576954043] [2024-11-19 09:15:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:05,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:05,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:05,939 INFO L87 Difference]: Start difference. First operand 797 states and 854 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:07,150 INFO L93 Difference]: Finished difference Result 872 states and 933 transitions. [2024-11-19 09:15:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-19 09:15:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:07,154 INFO L225 Difference]: With dead ends: 872 [2024-11-19 09:15:07,154 INFO L226 Difference]: Without dead ends: 872 [2024-11-19 09:15:07,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:07,155 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 263 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:07,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1050 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:15:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-19 09:15:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 824. [2024-11-19 09:15:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 451 states have (on average 1.9778270509977827) internal successors, (892), 818 states have internal predecessors, (892), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 918 transitions. [2024-11-19 09:15:07,193 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 918 transitions. Word has length 5 [2024-11-19 09:15:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:07,193 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 918 transitions. [2024-11-19 09:15:07,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 918 transitions. [2024-11-19 09:15:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 09:15:07,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:07,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:15:07,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:15:07,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:07,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:07,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1422972308, now seen corresponding path program 1 times [2024-11-19 09:15:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:07,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126502629] [2024-11-19 09:15:07,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:07,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:07,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:07,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:07,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:15:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:07,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:15:07,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:07,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:07,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126502629] [2024-11-19 09:15:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126502629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:07,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015930460] [2024-11-19 09:15:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:07,588 INFO L87 Difference]: Start difference. First operand 824 states and 918 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:07,699 INFO L93 Difference]: Finished difference Result 1397 states and 1554 transitions. [2024-11-19 09:15:07,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:07,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 09:15:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:07,706 INFO L225 Difference]: With dead ends: 1397 [2024-11-19 09:15:07,706 INFO L226 Difference]: Without dead ends: 1397 [2024-11-19 09:15:07,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:07,709 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 555 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:07,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1893 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:15:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-19 09:15:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 825. [2024-11-19 09:15:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 452 states have (on average 1.9756637168141593) internal successors, (893), 819 states have internal predecessors, (893), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 919 transitions. [2024-11-19 09:15:07,734 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 919 transitions. Word has length 6 [2024-11-19 09:15:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:07,734 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 919 transitions. [2024-11-19 09:15:07,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 919 transitions. [2024-11-19 09:15:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:15:07,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:07,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:07,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:15:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:07,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-19 09:15:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051127325] [2024-11-19 09:15:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:07,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:07,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:07,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:07,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:15:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:08,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:15:08,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:08,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:08,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051127325] [2024-11-19 09:15:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051127325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32257724] [2024-11-19 09:15:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:08,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:08,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:08,054 INFO L87 Difference]: Start difference. First operand 825 states and 919 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:08,104 INFO L93 Difference]: Finished difference Result 783 states and 876 transitions. [2024-11-19 09:15:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:08,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 09:15:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:08,106 INFO L225 Difference]: With dead ends: 783 [2024-11-19 09:15:08,107 INFO L226 Difference]: Without dead ends: 783 [2024-11-19 09:15:08,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:08,108 INFO L432 NwaCegarLoop]: 789 mSDtfsCounter, 71 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:08,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1515 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-19 09:15:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-11-19 09:15:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 434 states have (on average 1.9585253456221199) internal successors, (850), 777 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 876 transitions. [2024-11-19 09:15:08,120 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 876 transitions. Word has length 11 [2024-11-19 09:15:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:08,120 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 876 transitions. [2024-11-19 09:15:08,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 876 transitions. [2024-11-19 09:15:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:15:08,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:08,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:08,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:15:08,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:08,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:08,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash 614317568, now seen corresponding path program 1 times [2024-11-19 09:15:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:08,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471489383] [2024-11-19 09:15:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:08,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:08,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:08,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:08,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:15:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:08,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:08,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:08,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:08,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471489383] [2024-11-19 09:15:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471489383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670328214] [2024-11-19 09:15:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:08,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:08,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:08,439 INFO L87 Difference]: Start difference. First operand 783 states and 876 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:08,505 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions. [2024-11-19 09:15:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:15:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 09:15:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:08,508 INFO L225 Difference]: With dead ends: 761 [2024-11-19 09:15:08,508 INFO L226 Difference]: Without dead ends: 761 [2024-11-19 09:15:08,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:08,509 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 48 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:08,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2206 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-19 09:15:08,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2024-11-19 09:15:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 426 states have (on average 1.9272300469483568) internal successors, (821), 755 states have internal predecessors, (821), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 847 transitions. [2024-11-19 09:15:08,521 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 847 transitions. Word has length 13 [2024-11-19 09:15:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:08,521 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 847 transitions. [2024-11-19 09:15:08,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 847 transitions. [2024-11-19 09:15:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:15:08,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:08,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:08,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:15:08,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:08,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:08,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:08,724 INFO L85 PathProgramCache]: Analyzing trace with hash -957630610, now seen corresponding path program 1 times [2024-11-19 09:15:08,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:08,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520735890] [2024-11-19 09:15:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:08,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:08,730 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:08,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:15:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:08,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:15:08,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:08,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:15:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:08,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:08,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520735890] [2024-11-19 09:15:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520735890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000448408] [2024-11-19 09:15:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:08,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:08,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:08,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:08,913 INFO L87 Difference]: Start difference. First operand 761 states and 847 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:10,326 INFO L93 Difference]: Finished difference Result 761 states and 847 transitions. [2024-11-19 09:15:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 09:15:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:10,330 INFO L225 Difference]: With dead ends: 761 [2024-11-19 09:15:10,330 INFO L226 Difference]: Without dead ends: 761 [2024-11-19 09:15:10,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:10,331 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 472 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:10,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 944 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:15:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-19 09:15:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 757. [2024-11-19 09:15:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 426 states have (on average 1.9178403755868545) internal successors, (817), 751 states have internal predecessors, (817), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 843 transitions. [2024-11-19 09:15:10,345 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 843 transitions. Word has length 27 [2024-11-19 09:15:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:10,345 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 843 transitions. [2024-11-19 09:15:10,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 843 transitions. [2024-11-19 09:15:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:15:10,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:10,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:10,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:15:10,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:10,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:10,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash -957630609, now seen corresponding path program 1 times [2024-11-19 09:15:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:10,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058433930] [2024-11-19 09:15:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:10,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:10,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:10,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:10,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:15:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:10,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:15:10,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:10,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:15:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:10,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:10,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:10,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058433930] [2024-11-19 09:15:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058433930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681140312] [2024-11-19 09:15:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:10,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:10,885 INFO L87 Difference]: Start difference. First operand 757 states and 843 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:12,383 INFO L93 Difference]: Finished difference Result 805 states and 858 transitions. [2024-11-19 09:15:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:12,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 09:15:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:12,385 INFO L225 Difference]: With dead ends: 805 [2024-11-19 09:15:12,385 INFO L226 Difference]: Without dead ends: 805 [2024-11-19 09:15:12,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:12,386 INFO L432 NwaCegarLoop]: 680 mSDtfsCounter, 196 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:12,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1371 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:15:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-19 09:15:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 753. [2024-11-19 09:15:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 426 states have (on average 1.908450704225352) internal successors, (813), 747 states have internal predecessors, (813), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 839 transitions. [2024-11-19 09:15:12,411 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 839 transitions. Word has length 27 [2024-11-19 09:15:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:12,411 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 839 transitions. [2024-11-19 09:15:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 839 transitions. [2024-11-19 09:15:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 09:15:12,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:12,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:12,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:15:12,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:12,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:12,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash -3860248, now seen corresponding path program 1 times [2024-11-19 09:15:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116515384] [2024-11-19 09:15:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:12,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:12,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:12,623 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:12,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 (9)] Waiting until timeout for monitored process [2024-11-19 09:15:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:12,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:12,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:12,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:12,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116515384] [2024-11-19 09:15:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116515384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:12,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245693998] [2024-11-19 09:15:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:12,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:12,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:12,828 INFO L87 Difference]: Start difference. First operand 753 states and 839 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:12,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:12,888 INFO L93 Difference]: Finished difference Result 747 states and 829 transitions. [2024-11-19 09:15:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:15:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-19 09:15:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:12,891 INFO L225 Difference]: With dead ends: 747 [2024-11-19 09:15:12,892 INFO L226 Difference]: Without dead ends: 747 [2024-11-19 09:15:12,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:12,893 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 21 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:12,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-11-19 09:15:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-11-19 09:15:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 420 states have (on average 1.911904761904762) internal successors, (803), 741 states have internal predecessors, (803), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 829 transitions. [2024-11-19 09:15:12,905 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 829 transitions. Word has length 43 [2024-11-19 09:15:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:12,906 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 829 transitions. [2024-11-19 09:15:12,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 829 transitions. [2024-11-19 09:15:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 09:15:12,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:12,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:12,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:15:13,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:13,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:13,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash 168131124, now seen corresponding path program 1 times [2024-11-19 09:15:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:13,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105622530] [2024-11-19 09:15:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:13,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:13,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:13,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:13,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:15:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:13,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:13,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:13,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:13,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:13,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105622530] [2024-11-19 09:15:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105622530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:13,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822419362] [2024-11-19 09:15:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:13,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:13,671 INFO L87 Difference]: Start difference. First operand 747 states and 829 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:13,875 INFO L93 Difference]: Finished difference Result 965 states and 1076 transitions. [2024-11-19 09:15:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-19 09:15:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:13,881 INFO L225 Difference]: With dead ends: 965 [2024-11-19 09:15:13,881 INFO L226 Difference]: Without dead ends: 965 [2024-11-19 09:15:13,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:13,882 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 178 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:13,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1512 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:15:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-19 09:15:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 794. [2024-11-19 09:15:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 467 states have (on average 1.8201284796573876) internal successors, (850), 788 states have internal predecessors, (850), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 876 transitions. [2024-11-19 09:15:13,909 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 876 transitions. Word has length 51 [2024-11-19 09:15:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:13,909 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 876 transitions. [2024-11-19 09:15:13,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 876 transitions. [2024-11-19 09:15:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 09:15:13,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:13,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:13,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 09:15:14,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:14,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:14,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:14,116 INFO L85 PathProgramCache]: Analyzing trace with hash 754975115, now seen corresponding path program 1 times [2024-11-19 09:15:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716431823] [2024-11-19 09:15:14,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:14,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:14,120 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:14,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:15:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:14,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:15:14,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:14,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:15:14,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:15:14,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:15:14,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:15:14,791 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:15:14,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:15:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:14,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:14,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716431823] [2024-11-19 09:15:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716431823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:14,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264596016] [2024-11-19 09:15:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:14,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:14,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:14,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:14,813 INFO L87 Difference]: Start difference. First operand 794 states and 876 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:15,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:15,873 INFO L93 Difference]: Finished difference Result 756 states and 838 transitions. [2024-11-19 09:15:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-19 09:15:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:15,877 INFO L225 Difference]: With dead ends: 756 [2024-11-19 09:15:15,880 INFO L226 Difference]: Without dead ends: 756 [2024-11-19 09:15:15,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:15,881 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 374 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:15,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 682 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 09:15:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-11-19 09:15:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 719. [2024-11-19 09:15:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 430 states have (on average 1.716279069767442) internal successors, (738), 713 states have internal predecessors, (738), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 764 transitions. [2024-11-19 09:15:15,895 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 764 transitions. Word has length 54 [2024-11-19 09:15:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:15,896 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 764 transitions. [2024-11-19 09:15:15,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 764 transitions. [2024-11-19 09:15:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 09:15:15,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:15,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:15,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:16,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:16,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:16,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100217, now seen corresponding path program 1 times [2024-11-19 09:15:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:16,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156532603] [2024-11-19 09:15:16,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:16,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:16,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:16,105 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:16,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:15:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:16,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:15:16,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:16,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:15:16,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:15:16,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 09:15:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:16,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:16,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156532603] [2024-11-19 09:15:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156532603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592971682] [2024-11-19 09:15:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:16,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:15:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:15:16,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:16,379 INFO L87 Difference]: Start difference. First operand 719 states and 764 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:17,653 INFO L93 Difference]: Finished difference Result 718 states and 763 transitions. [2024-11-19 09:15:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:15:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-19 09:15:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:17,655 INFO L225 Difference]: With dead ends: 718 [2024-11-19 09:15:17,655 INFO L226 Difference]: Without dead ends: 718 [2024-11-19 09:15:17,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:15:17,656 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 2 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:17,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1842 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:15:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-19 09:15:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-11-19 09:15:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 430 states have (on average 1.713953488372093) internal successors, (737), 712 states have internal predecessors, (737), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 763 transitions. [2024-11-19 09:15:17,663 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 763 transitions. Word has length 59 [2024-11-19 09:15:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:17,664 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 763 transitions. [2024-11-19 09:15:17,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 763 transitions. [2024-11-19 09:15:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-19 09:15:17,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:17,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:17,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:15:17,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:17,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1572100216, now seen corresponding path program 1 times [2024-11-19 09:15:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643072253] [2024-11-19 09:15:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:17,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:17,869 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:17,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:15:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:18,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:15:18,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:18,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:15:18,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:15:18,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:15:18,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 09:15:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:18,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:18,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643072253] [2024-11-19 09:15:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643072253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:18,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719665956] [2024-11-19 09:15:18,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:18,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:15:18,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:15:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:18,187 INFO L87 Difference]: Start difference. First operand 718 states and 763 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:19,862 INFO L93 Difference]: Finished difference Result 717 states and 762 transitions. [2024-11-19 09:15:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:15:19,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-19 09:15:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:19,864 INFO L225 Difference]: With dead ends: 717 [2024-11-19 09:15:19,864 INFO L226 Difference]: Without dead ends: 717 [2024-11-19 09:15:19,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:15:19,865 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:19,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1865 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:15:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-19 09:15:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-11-19 09:15:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 429 states have (on average 1.7156177156177157) internal successors, (736), 711 states have internal predecessors, (736), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:15:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 762 transitions. [2024-11-19 09:15:19,884 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 762 transitions. Word has length 59 [2024-11-19 09:15:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:19,884 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 762 transitions. [2024-11-19 09:15:19,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:15:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 762 transitions. [2024-11-19 09:15:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 09:15:19,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:19,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:19,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 09:15:20,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:20,092 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:20,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:20,093 INFO L85 PathProgramCache]: Analyzing trace with hash 216241902, now seen corresponding path program 1 times [2024-11-19 09:15:20,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663294234] [2024-11-19 09:15:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:20,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:20,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:20,100 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:20,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:15:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:20,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:15:20,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:20,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:15:20,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:20,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663294234] [2024-11-19 09:15:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663294234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:20,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:20,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:20,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312601562] [2024-11-19 09:15:20,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:20,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:20,303 INFO L87 Difference]: Start difference. First operand 717 states and 762 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:15:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:20,345 INFO L93 Difference]: Finished difference Result 720 states and 766 transitions. [2024-11-19 09:15:20,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:20,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2024-11-19 09:15:20,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:20,351 INFO L225 Difference]: With dead ends: 720 [2024-11-19 09:15:20,351 INFO L226 Difference]: Without dead ends: 720 [2024-11-19 09:15:20,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:20,352 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 0 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:20,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2128 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-19 09:15:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-19 09:15:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 431 states have (on average 1.71461716937355) internal successors, (739), 714 states have internal predecessors, (739), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:15:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 766 transitions. [2024-11-19 09:15:20,368 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 766 transitions. Word has length 67 [2024-11-19 09:15:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 766 transitions. [2024-11-19 09:15:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:15:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 766 transitions. [2024-11-19 09:15:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 09:15:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:20,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:20,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 09:15:20,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:20,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:20,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:20,570 INFO L85 PathProgramCache]: Analyzing trace with hash -572148029, now seen corresponding path program 1 times [2024-11-19 09:15:20,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:20,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818873101] [2024-11-19 09:15:20,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:20,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:20,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:20,572 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:20,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 09:15:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:20,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:15:20,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:20,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:20,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818873101] [2024-11-19 09:15:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818873101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:15:20,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:15:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739981206] [2024-11-19 09:15:20,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:15:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:15:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:15:20,914 INFO L87 Difference]: Start difference. First operand 720 states and 766 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:21,020 INFO L93 Difference]: Finished difference Result 732 states and 783 transitions. [2024-11-19 09:15:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:15:21,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-11-19 09:15:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:21,024 INFO L225 Difference]: With dead ends: 732 [2024-11-19 09:15:21,024 INFO L226 Difference]: Without dead ends: 732 [2024-11-19 09:15:21,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:15:21,025 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 5 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:21,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2835 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:15:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-19 09:15:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 730. [2024-11-19 09:15:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 440 states have (on average 1.7136363636363636) internal successors, (754), 723 states have internal predecessors, (754), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:15:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 781 transitions. [2024-11-19 09:15:21,039 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 781 transitions. Word has length 68 [2024-11-19 09:15:21,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:21,040 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 781 transitions. [2024-11-19 09:15:21,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:21,040 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 781 transitions. [2024-11-19 09:15:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 09:15:21,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:21,040 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:21,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 09:15:21,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:21,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:21,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1280795694, now seen corresponding path program 2 times [2024-11-19 09:15:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:21,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315219867] [2024-11-19 09:15:21,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:15:21,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:21,245 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:21,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:15:21,542 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:15:21,542 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:15:21,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:15:21,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:21,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:21,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:21,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315219867] [2024-11-19 09:15:21,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315219867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:15:21,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:21,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 09:15:21,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750681913] [2024-11-19 09:15:21,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:21,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:15:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:21,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:15:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:15:21,726 INFO L87 Difference]: Start difference. First operand 730 states and 781 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:22,054 INFO L93 Difference]: Finished difference Result 745 states and 802 transitions. [2024-11-19 09:15:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:15:22,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-19 09:15:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:22,057 INFO L225 Difference]: With dead ends: 745 [2024-11-19 09:15:22,057 INFO L226 Difference]: Without dead ends: 739 [2024-11-19 09:15:22,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:15:22,058 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 14 mSDsluCounter, 4253 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:22,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4965 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:15:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-19 09:15:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2024-11-19 09:15:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 449 states have (on average 1.7037861915367483) internal successors, (765), 732 states have internal predecessors, (765), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:15:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 792 transitions. [2024-11-19 09:15:22,066 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 792 transitions. Word has length 71 [2024-11-19 09:15:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:22,066 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 792 transitions. [2024-11-19 09:15:22,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 792 transitions. [2024-11-19 09:15:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 09:15:22,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:22,067 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:22,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:22,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:22,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:22,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1827542002, now seen corresponding path program 3 times [2024-11-19 09:15:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:22,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058144605] [2024-11-19 09:15:22,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:15:22,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:22,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:22,274 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:22,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 (17)] Waiting until timeout for monitored process [2024-11-19 09:15:22,774 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:15:22,774 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:15:22,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:15:22,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:22,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:23,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058144605] [2024-11-19 09:15:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058144605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:15:23,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 09:15:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250774395] [2024-11-19 09:15:23,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 09:15:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 09:15:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 09:15:23,350 INFO L87 Difference]: Start difference. First operand 739 states and 792 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:24,716 INFO L93 Difference]: Finished difference Result 763 states and 831 transitions. [2024-11-19 09:15:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 09:15:24,716 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2024-11-19 09:15:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:24,721 INFO L225 Difference]: With dead ends: 763 [2024-11-19 09:15:24,721 INFO L226 Difference]: Without dead ends: 757 [2024-11-19 09:15:24,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 09:15:24,723 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 23 mSDsluCounter, 8507 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9219 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:24,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9219 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:15:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-11-19 09:15:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2024-11-19 09:15:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 467 states have (on average 1.6873661670235547) internal successors, (788), 750 states have internal predecessors, (788), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:15:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 815 transitions. [2024-11-19 09:15:24,748 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 815 transitions. Word has length 77 [2024-11-19 09:15:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:24,748 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 815 transitions. [2024-11-19 09:15:24,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 815 transitions. [2024-11-19 09:15:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:15:24,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:24,749 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:24,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 09:15:24,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:24,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:24,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:24,950 INFO L85 PathProgramCache]: Analyzing trace with hash -473119794, now seen corresponding path program 4 times [2024-11-19 09:15:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:24,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317752585] [2024-11-19 09:15:24,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:15:24,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:24,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:24,952 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:24,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 09:15:25,331 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:15:25,331 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:15:25,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 09:15:25,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:25,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:26,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:26,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317752585] [2024-11-19 09:15:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317752585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:15:26,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 09:15:26,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053441457] [2024-11-19 09:15:26,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:26,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 09:15:26,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:15:26,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 09:15:26,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 09:15:26,964 INFO L87 Difference]: Start difference. First operand 757 states and 815 transitions. Second operand has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:31,464 INFO L93 Difference]: Finished difference Result 797 states and 887 transitions. [2024-11-19 09:15:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 09:15:31,469 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-19 09:15:31,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:31,472 INFO L225 Difference]: With dead ends: 797 [2024-11-19 09:15:31,472 INFO L226 Difference]: Without dead ends: 793 [2024-11-19 09:15:31,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 09:15:31,480 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 34 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16998 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:31,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16998 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:15:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-11-19 09:15:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2024-11-19 09:15:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 501 states have (on average 1.6646706586826348) internal successors, (834), 784 states have internal predecessors, (834), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 09:15:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 861 transitions. [2024-11-19 09:15:31,497 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 861 transitions. Word has length 89 [2024-11-19 09:15:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:31,497 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 861 transitions. [2024-11-19 09:15:31,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.24) internal successors, (112), 50 states have internal predecessors, (112), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 861 transitions. [2024-11-19 09:15:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 09:15:31,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:31,502 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:31,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 09:15:31,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:31,702 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-11-19 09:15:31,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 666044590, now seen corresponding path program 5 times [2024-11-19 09:15:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:15:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406387247] [2024-11-19 09:15:31,703 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:15:31,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:15:31,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:15:31,706 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:15:31,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 09:15:32,828 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:15:32,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:15:32,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 09:15:32,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:32,868 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 09:15:32,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-19 09:15:33,150 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-19 09:15:33,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-19 09:15:33,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:15:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-11-19 09:15:35,080 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:15:35,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-11-19 09:15:35,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-19 09:15:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 09:15:35,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:35,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-19 09:15:35,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:15:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406387247] [2024-11-19 09:15:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406387247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:35,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1814224424] [2024-11-19 09:15:35,541 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:15:35,542 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:15:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:15:35,544 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 09:15:35,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process