./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_SAX_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:12:57,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:12:57,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:12:57,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:12:57,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:12:57,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:12:57,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:12:57,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:12:57,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:12:57,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:12:57,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:12:57,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:12:57,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:12:57,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:12:57,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:12:57,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:12:57,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:12:57,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:12:57,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:12:57,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:12:57,465 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:12:57,466 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:12:57,466 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:12:57,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:12:57,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:12:57,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:12:57,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:12:57,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:12:57,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:12:57,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:12:57,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:12:57,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:12:57,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:12:57,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:57,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:12:57,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:12:57,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:12:57,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:12:57,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:12:57,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:12:57,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:12:57,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:12:57,476 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-09 10:12:57,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:12:57,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:12:57,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:12:57,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:12:57,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:12:57,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-09 10:12:59,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:12:59,403 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:12:59,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-09 10:12:59,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f152ecc/2adf88463778432697735f65d5061d13/FLAGb8b8d1a87 [2024-11-09 10:12:59,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9f152ecc/2adf88463778432697735f65d5061d13 [2024-11-09 10:12:59,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:12:59,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:12:59,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:59,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:12:59,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:12:59,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:59" (1/1) ... [2024-11-09 10:12:59,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347ec4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:59, skipping insertion in model container [2024-11-09 10:12:59,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:59" (1/1) ... [2024-11-09 10:12:59,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:13:00,133 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:00,187 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-09 10:13:00,195 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-09 10:13:00,204 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-09 10:13:00,213 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-09 10:13:00,274 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-09 10:13:00,286 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-09 10:13:00,293 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-09 10:13:00,304 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-09 10:13:00,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-09 10:13:00,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-09 10:13:00,342 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-09 10:13:00,344 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:00,348 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:00,353 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-09 10:13:00,356 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-09 10:13:00,365 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-09 10:13:00,366 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-09 10:13:00,367 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-09 10:13:00,373 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-09 10:13:00,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:13:00,420 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-09 10:13:00,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c588880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:00, skipping insertion in model container [2024-11-09 10:13:00,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:13:00,424 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:13:00,431 INFO L158 Benchmark]: Toolchain (without parser) took 988.61ms. Allocated memory is still 188.7MB. Free memory was 157.3MB in the beginning and 131.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:13:00,432 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:13:00,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 986.92ms. Allocated memory is still 188.7MB. Free memory was 157.3MB in the beginning and 131.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:13:00,433 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.13ms. Allocated memory is still 134.2MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 986.92ms. Allocated memory is still 188.7MB. Free memory was 157.3MB in the beginning and 131.8MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: 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_SAX_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:13:02,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:13:02,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:13:02,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:13:02,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:13:02,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:13:02,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:13:02,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:13:02,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:13:02,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:13:02,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:13:02,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:13:02,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:13:02,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:13:02,390 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:13:02,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:13:02,393 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:13:02,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:13:02,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:13:02,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:13:02,394 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:13:02,394 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:13:02,395 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:13:02,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:13:02,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:13:02,395 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:13:02,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:13:02,395 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:13:02,396 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:13:02,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:13:02,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:13:02,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:13:02,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:13:02,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:13:02,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:13:02,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:13:02,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:13:02,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:13:02,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:13:02,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:13:02,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:13:02,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:13:02,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:13:02,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:13:02,399 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-09 10:13:02,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:13:02,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:13:02,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:13:02,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:13:02,750 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:13:02,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-09 10:13:04,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:13:04,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:13:04,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2024-11-09 10:13:04,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c84691a3/5e77e970650249daa63e594e1512093a/FLAG3170b4794 [2024-11-09 10:13:04,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c84691a3/5e77e970650249daa63e594e1512093a [2024-11-09 10:13:04,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:13:04,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:13:04,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:13:04,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:13:04,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:13:04,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:13:04" (1/1) ... [2024-11-09 10:13:04,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b12f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:04, skipping insertion in model container [2024-11-09 10:13:04,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:13:04" (1/1) ... [2024-11-09 10:13:05,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:13:05,373 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-09 10:13:05,401 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-09 10:13:05,404 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-09 10:13:05,406 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-09 10:13:05,411 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-09 10:13:05,444 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-09 10:13:05,447 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-09 10:13:05,451 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-09 10:13:05,457 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-09 10:13:05,467 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-09 10:13:05,472 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-09 10:13:05,473 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-09 10:13:05,474 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-09 10:13:05,475 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:05,478 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:05,486 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:05,486 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:05,487 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-09 10:13:05,492 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-09 10:13:05,494 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-09 10:13:05,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:13:05,524 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:13:05,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:13:05,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-09 10:13:05,570 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-09 10:13:05,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:13:05,577 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-09 10:13:05,579 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-09 10:13:05,600 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-09 10:13:05,601 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-09 10:13:05,604 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-09 10:13:05,607 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-09 10:13:05,612 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-09 10:13:05,615 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-09 10:13:05,618 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-09 10:13:05,619 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-09 10:13:05,619 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-09 10:13:05,619 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-09 10:13:05,624 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-09 10:13:05,625 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-09 10:13:05,625 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-09 10:13:05,625 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-09 10:13:05,627 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-09 10:13:05,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:13:05,659 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:13:05,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:13:05,789 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:13:05,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05 WrapperNode [2024-11-09 10:13:05,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:13:05,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:13:05,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:13:05,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:13:05,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:05,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:05,899 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1458 [2024-11-09 10:13:05,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:13:05,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:13:05,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:13:05,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:13:05,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:05,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:05,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,050 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-09 10:13:06,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:13:06,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:13:06,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:13:06,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:13:06,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (1/1) ... [2024-11-09 10:13:06,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:13:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:13:06,152 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-09 10:13:06,154 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-09 10:13:06,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:13:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:13:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:13:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:13:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:13:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:13:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:13:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:13:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:13:06,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:13:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:13:06,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:13:06,357 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:13:06,359 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:13:06,361 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:13:06,401 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:13:10,367 INFO L? ?]: Removed 1740 outVars from TransFormulas that were not future-live. [2024-11-09 10:13:10,368 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:13:10,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:13:10,402 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-09 10:13:10,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:13:10 BoogieIcfgContainer [2024-11-09 10:13:10,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:13:10,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:13:10,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:13:10,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:13:10,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:13:04" (1/3) ... [2024-11-09 10:13:10,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32753f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:13:10, skipping insertion in model container [2024-11-09 10:13:10,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:13:05" (2/3) ... [2024-11-09 10:13:10,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32753f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:13:10, skipping insertion in model container [2024-11-09 10:13:10,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:13:10" (3/3) ... [2024-11-09 10:13:10,409 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-3.i [2024-11-09 10:13:10,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:13:10,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 831 error locations. [2024-11-09 10:13:10,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:13:10,484 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;@a5386d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:13:10,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 831 error locations. [2024-11-09 10:13:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 1611 states, 778 states have (on average 2.2609254498714653) internal successors, (1759), 1603 states have internal predecessors, (1759), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:13:10,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:10,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:13:10,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr830ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1482066, now seen corresponding path program 1 times [2024-11-09 10:13:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:10,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666752796] [2024-11-09 10:13:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:10,510 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-09 10:13:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:10,513 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-09 10:13:10,514 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-09 10:13:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:10,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:13:10,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:10,678 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-09 10:13:10,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:10,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:10,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666752796] [2024-11-09 10:13:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666752796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:10,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:13:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067401278] [2024-11-09 10:13:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:10,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:10,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:10,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:10,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:10,747 INFO L87 Difference]: Start difference. First operand has 1611 states, 778 states have (on average 2.2609254498714653) internal successors, (1759), 1603 states have internal predecessors, (1759), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:12,952 INFO L93 Difference]: Finished difference Result 1972 states and 2067 transitions. [2024-11-09 10:13:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:12,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 10:13:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:12,968 INFO L225 Difference]: With dead ends: 1972 [2024-11-09 10:13:12,968 INFO L226 Difference]: Without dead ends: 1968 [2024-11-09 10:13:12,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:12,972 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 397 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:12,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2503 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:13:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-09 10:13:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1609. [2024-11-09 10:13:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 787 states have (on average 2.1385006353240152) internal successors, (1683), 1601 states have internal predecessors, (1683), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1695 transitions. [2024-11-09 10:13:13,081 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1695 transitions. Word has length 4 [2024-11-09 10:13:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:13,081 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 1695 transitions. [2024-11-09 10:13:13,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1695 transitions. [2024-11-09 10:13:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:13:13,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:13,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:13:13,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:13,283 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-09 10:13:13,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:13,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076526, now seen corresponding path program 1 times [2024-11-09 10:13:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:13,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228978353] [2024-11-09 10:13:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:13,286 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-09 10:13:13,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:13,287 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-09 10:13:13,289 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-09 10:13:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:13,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:13,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:13,431 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-09 10:13:13,439 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-09 10:13:13,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:13,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228978353] [2024-11-09 10:13:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228978353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:13:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554883571] [2024-11-09 10:13:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:13,442 INFO L87 Difference]: Start difference. First operand 1609 states and 1695 transitions. Second operand has 3 states, 2 states have (on average 3.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-09 10:13:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:15,204 INFO L93 Difference]: Finished difference Result 1515 states and 1599 transitions. [2024-11-09 10:13:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:15,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-09 10:13:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:15,208 INFO L225 Difference]: With dead ends: 1515 [2024-11-09 10:13:15,209 INFO L226 Difference]: Without dead ends: 1515 [2024-11-09 10:13:15,209 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-09 10:13:15,210 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 1029 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:15,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1160 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:13:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-09 10:13:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2024-11-09 10:13:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 787 states have (on average 2.016518424396442) internal successors, (1587), 1507 states have internal predecessors, (1587), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1599 transitions. [2024-11-09 10:13:15,231 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1599 transitions. Word has length 6 [2024-11-09 10:13:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:15,232 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1599 transitions. [2024-11-09 10:13:15,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-09 10:13:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1599 transitions. [2024-11-09 10:13:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:13:15,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:15,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:13:15,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:15,433 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-09 10:13:15,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:15,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076527, now seen corresponding path program 1 times [2024-11-09 10:13:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338545788] [2024-11-09 10:13:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:15,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:15,437 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-09 10:13:15,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:13:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:15,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:15,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:15,575 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-09 10:13:15,598 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-09 10:13:15,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:15,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:15,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338545788] [2024-11-09 10:13:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338545788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:15,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:15,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:13:15,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418515999] [2024-11-09 10:13:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:15,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:15,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:15,602 INFO L87 Difference]: Start difference. First operand 1515 states and 1599 transitions. Second operand has 3 states, 2 states have (on average 3.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-09 10:13:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:18,385 INFO L93 Difference]: Finished difference Result 1835 states and 1939 transitions. [2024-11-09 10:13:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:18,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-09 10:13:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:18,390 INFO L225 Difference]: With dead ends: 1835 [2024-11-09 10:13:18,390 INFO L226 Difference]: Without dead ends: 1835 [2024-11-09 10:13:18,390 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-09 10:13:18,391 INFO L432 NwaCegarLoop]: 1324 mSDtfsCounter, 522 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:18,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1968 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 10:13:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-09 10:13:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1682. [2024-11-09 10:13:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 964 states have (on average 1.9782157676348548) internal successors, (1907), 1674 states have internal predecessors, (1907), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 1919 transitions. [2024-11-09 10:13:18,414 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 1919 transitions. Word has length 6 [2024-11-09 10:13:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:18,414 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 1919 transitions. [2024-11-09 10:13:18,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-09 10:13:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1919 transitions. [2024-11-09 10:13:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 10:13:18,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:18,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:18,418 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-09 10:13:18,617 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-09 10:13:18,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:18,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:18,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1136358850, now seen corresponding path program 1 times [2024-11-09 10:13:18,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:18,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314220262] [2024-11-09 10:13:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:18,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-09 10:13:18,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:18,624 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-09 10:13:18,625 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-09 10:13:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:18,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:13:18,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:18,840 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-09 10:13:18,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:18,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:18,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314220262] [2024-11-09 10:13:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314220262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:18,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:18,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442271255] [2024-11-09 10:13:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:18,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:18,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:18,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:18,842 INFO L87 Difference]: Start difference. First operand 1682 states and 1919 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-09 10:13:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:19,445 INFO L93 Difference]: Finished difference Result 2451 states and 2814 transitions. [2024-11-09 10:13:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-09 10:13:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:19,457 INFO L225 Difference]: With dead ends: 2451 [2024-11-09 10:13:19,458 INFO L226 Difference]: Without dead ends: 2451 [2024-11-09 10:13:19,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-09 10:13:19,459 INFO L432 NwaCegarLoop]: 1556 mSDtfsCounter, 691 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 4421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:19,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 4421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:13:19,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2024-11-09 10:13:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2152. [2024-11-09 10:13:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 1434 states have (on average 1.9497907949790796) internal successors, (2796), 2141 states have internal predecessors, (2796), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2814 transitions. [2024-11-09 10:13:19,504 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2814 transitions. Word has length 7 [2024-11-09 10:13:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:19,505 INFO L471 AbstractCegarLoop]: Abstraction has 2152 states and 2814 transitions. [2024-11-09 10:13:19,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-09 10:13:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2814 transitions. [2024-11-09 10:13:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:13:19,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:19,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:19,513 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-09 10:13:19,708 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-09 10:13:19,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:19,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1119196844, now seen corresponding path program 1 times [2024-11-09 10:13:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966714216] [2024-11-09 10:13:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:19,711 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-09 10:13:19,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:19,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:19,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:13:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:19,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:19,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:19,893 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-09 10:13:19,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:19,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966714216] [2024-11-09 10:13:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966714216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:19,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:19,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49482660] [2024-11-09 10:13:19,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:19,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:19,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:19,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:19,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:19,895 INFO L87 Difference]: Start difference. First operand 2152 states and 2814 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:20,085 INFO L93 Difference]: Finished difference Result 2409 states and 2943 transitions. [2024-11-09 10:13:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:20,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:13:20,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:20,092 INFO L225 Difference]: With dead ends: 2409 [2024-11-09 10:13:20,092 INFO L226 Difference]: Without dead ends: 2409 [2024-11-09 10:13:20,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:20,093 INFO L432 NwaCegarLoop]: 1627 mSDtfsCounter, 504 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:20,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3118 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:13:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2024-11-09 10:13:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2012. [2024-11-09 10:13:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1294 states have (on average 1.9605873261205564) internal successors, (2537), 2001 states have internal predecessors, (2537), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2555 transitions. [2024-11-09 10:13:20,129 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2555 transitions. Word has length 9 [2024-11-09 10:13:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:20,129 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 2555 transitions. [2024-11-09 10:13:20,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:20,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2555 transitions. [2024-11-09 10:13:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 10:13:20,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:20,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:20,133 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-09 10:13:20,330 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-09 10:13:20,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 242137368, now seen corresponding path program 1 times [2024-11-09 10:13:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686220987] [2024-11-09 10:13:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:20,332 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-09 10:13:20,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:20,334 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-09 10:13:20,335 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-09 10:13:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:20,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:13:20,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:20,479 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-09 10:13:20,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:20,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:20,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686220987] [2024-11-09 10:13:20,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686220987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:20,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:20,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497222736] [2024-11-09 10:13:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:20,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:20,482 INFO L87 Difference]: Start difference. First operand 2012 states and 2555 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:20,511 INFO L93 Difference]: Finished difference Result 1952 states and 2469 transitions. [2024-11-09 10:13:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:20,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 10:13:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:20,516 INFO L225 Difference]: With dead ends: 1952 [2024-11-09 10:13:20,516 INFO L226 Difference]: Without dead ends: 1952 [2024-11-09 10:13:20,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:20,517 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 71 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2945 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-09 10:13:20,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2945 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:13:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2024-11-09 10:13:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2024-11-09 10:13:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1258 states have (on average 1.9483306836248013) internal successors, (2451), 1941 states have internal predecessors, (2451), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2469 transitions. [2024-11-09 10:13:20,541 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2469 transitions. Word has length 12 [2024-11-09 10:13:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:20,541 INFO L471 AbstractCegarLoop]: Abstraction has 1952 states and 2469 transitions. [2024-11-09 10:13:20,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2469 transitions. [2024-11-09 10:13:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 10:13:20,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:20,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:20,553 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-09 10:13:20,745 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-09 10:13:20,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr629REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:20,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash 169603906, now seen corresponding path program 1 times [2024-11-09 10:13:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822680905] [2024-11-09 10:13:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:20,748 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-09 10:13:20,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:20,749 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-09 10:13:20,753 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-09 10:13:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:20,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:13:20,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:20,907 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-09 10:13:20,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:20,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822680905] [2024-11-09 10:13:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822680905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960400797] [2024-11-09 10:13:20,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:20,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:20,909 INFO L87 Difference]: Start difference. First operand 1952 states and 2469 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:21,772 INFO L93 Difference]: Finished difference Result 2325 states and 2856 transitions. [2024-11-09 10:13:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 10:13:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:21,779 INFO L225 Difference]: With dead ends: 2325 [2024-11-09 10:13:21,779 INFO L226 Difference]: Without dead ends: 2319 [2024-11-09 10:13:21,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-09 10:13:21,779 INFO L432 NwaCegarLoop]: 1584 mSDtfsCounter, 463 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 4398 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:21,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 4398 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:13:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-09 10:13:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1946. [2024-11-09 10:13:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1252 states have (on average 1.9520766773162939) internal successors, (2444), 1935 states have internal predecessors, (2444), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2462 transitions. [2024-11-09 10:13:21,821 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2462 transitions. Word has length 12 [2024-11-09 10:13:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:21,822 INFO L471 AbstractCegarLoop]: Abstraction has 1946 states and 2462 transitions. [2024-11-09 10:13:21,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2462 transitions. [2024-11-09 10:13:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:13:21,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:21,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:21,826 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-09 10:13:22,023 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-09 10:13:22,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:22,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash 765772946, now seen corresponding path program 1 times [2024-11-09 10:13:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:22,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053590567] [2024-11-09 10:13:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:22,026 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-09 10:13:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:22,028 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-09 10:13:22,030 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-09 10:13:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:22,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:22,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:22,186 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-09 10:13:22,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:22,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:22,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053590567] [2024-11-09 10:13:22,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053590567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:22,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:22,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480517917] [2024-11-09 10:13:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:22,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:22,187 INFO L87 Difference]: Start difference. First operand 1946 states and 2462 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:22,267 INFO L93 Difference]: Finished difference Result 1916 states and 2404 transitions. [2024-11-09 10:13:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:13:22,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 10:13:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:22,272 INFO L225 Difference]: With dead ends: 1916 [2024-11-09 10:13:22,273 INFO L226 Difference]: Without dead ends: 1916 [2024-11-09 10:13:22,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-09 10:13:22,273 INFO L432 NwaCegarLoop]: 1459 mSDtfsCounter, 48 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:22,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4351 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:13:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-11-09 10:13:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1916. [2024-11-09 10:13:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1236 states have (on average 1.9304207119741101) internal successors, (2386), 1905 states have internal predecessors, (2386), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2404 transitions. [2024-11-09 10:13:22,298 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2404 transitions. Word has length 14 [2024-11-09 10:13:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:22,299 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2404 transitions. [2024-11-09 10:13:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2404 transitions. [2024-11-09 10:13:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 10:13:22,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:22,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:22,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:22,500 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-09 10:13:22,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:22,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1067586272, now seen corresponding path program 1 times [2024-11-09 10:13:22,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:22,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363067797] [2024-11-09 10:13:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:22,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:22,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:22,503 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-09 10:13:22,506 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-09 10:13:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:22,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:22,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:22,634 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-09 10:13:22,675 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-09 10:13:22,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:22,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363067797] [2024-11-09 10:13:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363067797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:22,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120692830] [2024-11-09 10:13:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:22,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:22,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:22,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:22,677 INFO L87 Difference]: Start difference. First operand 1916 states and 2404 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 10:13:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:25,014 INFO L93 Difference]: Finished difference Result 1920 states and 2404 transitions. [2024-11-09 10:13:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 10:13:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:25,019 INFO L225 Difference]: With dead ends: 1920 [2024-11-09 10:13:25,019 INFO L226 Difference]: Without dead ends: 1920 [2024-11-09 10:13:25,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-09 10:13:25,020 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 966 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:25,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 1773 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:13:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2024-11-09 10:13:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1912. [2024-11-09 10:13:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1236 states have (on average 1.9239482200647249) internal successors, (2378), 1901 states have internal predecessors, (2378), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2396 transitions. [2024-11-09 10:13:25,040 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2396 transitions. Word has length 28 [2024-11-09 10:13:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:25,040 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 2396 transitions. [2024-11-09 10:13:25,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 10:13:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2396 transitions. [2024-11-09 10:13:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 10:13:25,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:25,041 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] [2024-11-09 10:13:25,051 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-09 10:13:25,241 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-09 10:13:25,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:25,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1067586273, now seen corresponding path program 1 times [2024-11-09 10:13:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:25,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430151213] [2024-11-09 10:13:25,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:25,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:25,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:25,246 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-09 10:13:25,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 (11)] Waiting until timeout for monitored process [2024-11-09 10:13:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:25,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:13:25,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:25,394 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-09 10:13:25,570 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-09 10:13:25,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:25,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:25,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430151213] [2024-11-09 10:13:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430151213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3066851] [2024-11-09 10:13:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:25,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:25,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:25,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:25,571 INFO L87 Difference]: Start difference. First operand 1912 states and 2396 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 10:13:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:28,780 INFO L93 Difference]: Finished difference Result 2069 states and 2416 transitions. [2024-11-09 10:13:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:28,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-09 10:13:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:28,785 INFO L225 Difference]: With dead ends: 2069 [2024-11-09 10:13:28,785 INFO L226 Difference]: Without dead ends: 2069 [2024-11-09 10:13:28,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-09 10:13:28,786 INFO L432 NwaCegarLoop]: 1588 mSDtfsCounter, 455 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:28,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 3097 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 10:13:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2024-11-09 10:13:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1908. [2024-11-09 10:13:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1236 states have (on average 1.9174757281553398) internal successors, (2370), 1897 states have internal predecessors, (2370), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2388 transitions. [2024-11-09 10:13:28,806 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2388 transitions. Word has length 28 [2024-11-09 10:13:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:28,806 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2388 transitions. [2024-11-09 10:13:28,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-09 10:13:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2388 transitions. [2024-11-09 10:13:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 10:13:28,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:28,807 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] [2024-11-09 10:13:28,817 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-09 10:13:29,007 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-09 10:13:29,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:29,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:29,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1271201802, now seen corresponding path program 1 times [2024-11-09 10:13:29,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:29,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768244412] [2024-11-09 10:13:29,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:29,009 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-09 10:13:29,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:29,012 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-09 10:13:29,013 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-09 10:13:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:29,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:29,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:13:29,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:29,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768244412] [2024-11-09 10:13:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768244412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:29,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:29,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201328479] [2024-11-09 10:13:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:29,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:29,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:29,326 INFO L87 Difference]: Start difference. First operand 1908 states and 2388 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-09 10:13:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:29,403 INFO L93 Difference]: Finished difference Result 1896 states and 2368 transitions. [2024-11-09 10:13:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:13:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-09 10:13:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:29,407 INFO L225 Difference]: With dead ends: 1896 [2024-11-09 10:13:29,407 INFO L226 Difference]: Without dead ends: 1896 [2024-11-09 10:13:29,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-09 10:13:29,408 INFO L432 NwaCegarLoop]: 1453 mSDtfsCounter, 21 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4328 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-09 10:13:29,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4328 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:13:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2024-11-09 10:13:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2024-11-09 10:13:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1224 states have (on average 1.9199346405228759) internal successors, (2350), 1885 states have internal predecessors, (2350), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2368 transitions. [2024-11-09 10:13:29,427 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2368 transitions. Word has length 47 [2024-11-09 10:13:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:29,427 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2368 transitions. [2024-11-09 10:13:29,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-09 10:13:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2368 transitions. [2024-11-09 10:13:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 10:13:29,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:29,431 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] [2024-11-09 10:13:29,440 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-09 10:13:29,635 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-09 10:13:29,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:29,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2058762942, now seen corresponding path program 1 times [2024-11-09 10:13:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948284603] [2024-11-09 10:13:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:29,637 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-09 10:13:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:29,640 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-09 10:13:29,645 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-09 10:13:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:29,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:13:29,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:29,925 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-09 10:13:29,931 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-09 10:13:30,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:13:30,287 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-09 10:13:30,303 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:13:30,304 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-09 10:13:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:13:30,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:30,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:30,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948284603] [2024-11-09 10:13:30,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948284603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:30,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724757303] [2024-11-09 10:13:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:30,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:30,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:30,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:30,321 INFO L87 Difference]: Start difference. First operand 1896 states and 2368 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-09 10:13:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:32,449 INFO L93 Difference]: Finished difference Result 1812 states and 2243 transitions. [2024-11-09 10:13:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:32,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-09 10:13:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:32,454 INFO L225 Difference]: With dead ends: 1812 [2024-11-09 10:13:32,454 INFO L226 Difference]: Without dead ends: 1812 [2024-11-09 10:13:32,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-09 10:13:32,455 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 1764 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:32,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 939 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:13:32,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-09 10:13:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1635. [2024-11-09 10:13:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1047 states have (on average 1.8099331423113658) internal successors, (1895), 1624 states have internal predecessors, (1895), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1913 transitions. [2024-11-09 10:13:32,478 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1913 transitions. Word has length 55 [2024-11-09 10:13:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:32,478 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 1913 transitions. [2024-11-09 10:13:32,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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-09 10:13:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1913 transitions. [2024-11-09 10:13:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 10:13:32,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:32,480 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] [2024-11-09 10:13:32,496 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-09 10:13:32,683 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-09 10:13:32,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash 299959545, now seen corresponding path program 1 times [2024-11-09 10:13:32,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730584529] [2024-11-09 10:13:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:32,685 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-09 10:13:32,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:32,687 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-09 10:13:32,690 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-09 10:13:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:32,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:13:32,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:32,905 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-09 10:13:32,920 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-09 10:13:32,937 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-09 10:13:32,945 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-09 10:13:32,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:32,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730584529] [2024-11-09 10:13:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730584529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:32,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:32,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:32,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041049239] [2024-11-09 10:13:32,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:32,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:13:32,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:32,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:13:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:32,948 INFO L87 Difference]: Start difference. First operand 1635 states and 1913 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-09 10:13:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:35,496 INFO L93 Difference]: Finished difference Result 1634 states and 1911 transitions. [2024-11-09 10:13:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:13:35,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-09 10:13:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:35,500 INFO L225 Difference]: With dead ends: 1634 [2024-11-09 10:13:35,500 INFO L226 Difference]: Without dead ends: 1634 [2024-11-09 10:13:35,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-09 10:13:35,501 INFO L432 NwaCegarLoop]: 1380 mSDtfsCounter, 2 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:35,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3457 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:13:35,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-09 10:13:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-11-09 10:13:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1047 states have (on average 1.808022922636103) internal successors, (1893), 1623 states have internal predecessors, (1893), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1911 transitions. [2024-11-09 10:13:35,515 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1911 transitions. Word has length 60 [2024-11-09 10:13:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:35,515 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 1911 transitions. [2024-11-09 10:13:35,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-09 10:13:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1911 transitions. [2024-11-09 10:13:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 10:13:35,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:35,516 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] [2024-11-09 10:13:35,521 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-09 10:13:35,716 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-09 10:13:35,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:35,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:35,717 INFO L85 PathProgramCache]: Analyzing trace with hash 299959546, now seen corresponding path program 1 times [2024-11-09 10:13:35,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:35,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847070089] [2024-11-09 10:13:35,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:35,718 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-09 10:13:35,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:35,722 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-09 10:13:35,727 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-09 10:13:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:35,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:13:35,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:35,934 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-09 10:13:35,945 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-09 10:13:35,949 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-09 10:13:35,979 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-09 10:13:35,991 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-09 10:13:35,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:35,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847070089] [2024-11-09 10:13:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847070089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:35,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:35,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723086656] [2024-11-09 10:13:35,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:35,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:13:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:13:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:35,993 INFO L87 Difference]: Start difference. First operand 1634 states and 1911 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-09 10:13:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:39,117 INFO L93 Difference]: Finished difference Result 1633 states and 1909 transitions. [2024-11-09 10:13:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:13:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-09 10:13:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:39,120 INFO L225 Difference]: With dead ends: 1633 [2024-11-09 10:13:39,123 INFO L226 Difference]: Without dead ends: 1633 [2024-11-09 10:13:39,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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-09 10:13:39,124 INFO L432 NwaCegarLoop]: 1380 mSDtfsCounter, 1 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3500 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:39,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3500 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 10:13:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-09 10:13:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2024-11-09 10:13:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1045 states have (on average 1.8095693779904307) internal successors, (1891), 1622 states have internal predecessors, (1891), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1909 transitions. [2024-11-09 10:13:39,148 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1909 transitions. Word has length 60 [2024-11-09 10:13:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:39,149 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 1909 transitions. [2024-11-09 10:13:39,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-09 10:13:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1909 transitions. [2024-11-09 10:13:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 10:13:39,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:39,149 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-09 10:13:39,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:39,350 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-09 10:13:39,350 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1090818464, now seen corresponding path program 1 times [2024-11-09 10:13:39,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:39,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728463211] [2024-11-09 10:13:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:39,351 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-09 10:13:39,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:39,357 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-09 10:13:39,366 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-09 10:13:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:39,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:39,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:13:39,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:39,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728463211] [2024-11-09 10:13:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728463211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:39,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:39,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:39,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070877435] [2024-11-09 10:13:39,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:39,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:39,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:39,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:39,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:39,610 INFO L87 Difference]: Start difference. First operand 1633 states and 1909 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-09 10:13:39,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:39,654 INFO L93 Difference]: Finished difference Result 1636 states and 1915 transitions. [2024-11-09 10:13:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:39,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2024-11-09 10:13:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:39,666 INFO L225 Difference]: With dead ends: 1636 [2024-11-09 10:13:39,669 INFO L226 Difference]: Without dead ends: 1636 [2024-11-09 10:13:39,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-09 10:13:39,670 INFO L432 NwaCegarLoop]: 1379 mSDtfsCounter, 0 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:39,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:13:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2024-11-09 10:13:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2024-11-09 10:13:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1047 states have (on average 1.8089780324737346) internal successors, (1894), 1625 states have internal predecessors, (1894), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 10:13:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 1915 transitions. [2024-11-09 10:13:39,714 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 1915 transitions. Word has length 68 [2024-11-09 10:13:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:39,715 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 1915 transitions. [2024-11-09 10:13:39,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-09 10:13:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1915 transitions. [2024-11-09 10:13:39,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:13:39,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:39,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:39,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 10:13:39,920 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-09 10:13:39,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:39,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash 908469645, now seen corresponding path program 1 times [2024-11-09 10:13:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325166155] [2024-11-09 10:13:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:39,922 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-09 10:13:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:39,924 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-09 10:13:39,925 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-09 10:13:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:40,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:40,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:40,206 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-09 10:13:40,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:40,283 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-09 10:13:40,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325166155] [2024-11-09 10:13:40,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325166155] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:40,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:40,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:13:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521397619] [2024-11-09 10:13:40,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:40,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:13:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:13:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:13:40,288 INFO L87 Difference]: Start difference. First operand 1636 states and 1915 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-09 10:13:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:40,417 INFO L93 Difference]: Finished difference Result 1648 states and 1934 transitions. [2024-11-09 10:13:40,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:13:40,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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 69 [2024-11-09 10:13:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:40,422 INFO L225 Difference]: With dead ends: 1648 [2024-11-09 10:13:40,422 INFO L226 Difference]: Without dead ends: 1648 [2024-11-09 10:13:40,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 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-09 10:13:40,423 INFO L432 NwaCegarLoop]: 1378 mSDtfsCounter, 8 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5501 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:40,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5501 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:13:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-09 10:13:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1646. [2024-11-09 10:13:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1056 states have (on average 1.8077651515151516) internal successors, (1909), 1634 states have internal predecessors, (1909), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 10:13:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1930 transitions. [2024-11-09 10:13:40,441 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1930 transitions. Word has length 69 [2024-11-09 10:13:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:40,442 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 1930 transitions. [2024-11-09 10:13:40,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-09 10:13:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1930 transitions. [2024-11-09 10:13:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 10:13:40,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:40,442 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:40,455 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-09 10:13:40,646 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-09 10:13:40,647 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:40,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:40,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1887022688, now seen corresponding path program 2 times [2024-11-09 10:13:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:40,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031511424] [2024-11-09 10:13:40,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:13:40,647 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-09 10:13:40,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:40,650 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-09 10:13:40,651 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-09 10:13:41,033 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:13:41,033 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:41,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:13:41,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:41,102 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-09 10:13:41,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:41,285 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-09 10:13:41,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031511424] [2024-11-09 10:13:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031511424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:41,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:13:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507183911] [2024-11-09 10:13:41,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:41,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:13:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:13:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:13:41,288 INFO L87 Difference]: Start difference. First operand 1646 states and 1930 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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-09 10:13:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:41,758 INFO L93 Difference]: Finished difference Result 1661 states and 1951 transitions. [2024-11-09 10:13:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:13:41,759 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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 72 [2024-11-09 10:13:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:41,767 INFO L225 Difference]: With dead ends: 1661 [2024-11-09 10:13:41,767 INFO L226 Difference]: Without dead ends: 1655 [2024-11-09 10:13:41,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 10:13:41,767 INFO L432 NwaCegarLoop]: 1379 mSDtfsCounter, 12 mSDsluCounter, 8239 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9618 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:41,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9618 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 10:13:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-11-09 10:13:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2024-11-09 10:13:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1065 states have (on average 1.8028169014084507) internal successors, (1920), 1643 states have internal predecessors, (1920), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 10:13:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 1941 transitions. [2024-11-09 10:13:41,795 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 1941 transitions. Word has length 72 [2024-11-09 10:13:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:41,795 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 1941 transitions. [2024-11-09 10:13:41,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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-09 10:13:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 1941 transitions. [2024-11-09 10:13:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 10:13:41,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:41,796 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:41,805 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-09 10:13:41,996 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-09 10:13:41,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:41,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1630217600, now seen corresponding path program 3 times [2024-11-09 10:13:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163496254] [2024-11-09 10:13:41,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:13:41,998 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-09 10:13:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:41,999 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-09 10:13:42,001 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-09 10:13:42,583 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:13:42,584 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:42,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:13:42,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:42,717 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-09 10:13:42,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:43,133 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-09 10:13:43,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:43,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163496254] [2024-11-09 10:13:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163496254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:43,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:13:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874715657] [2024-11-09 10:13:43,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:13:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:43,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:13:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:13:43,135 INFO L87 Difference]: Start difference. First operand 1655 states and 1941 transitions. Second operand has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-09 10:13:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:44,547 INFO L93 Difference]: Finished difference Result 1679 states and 1980 transitions. [2024-11-09 10:13:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:13:44,547 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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 78 [2024-11-09 10:13:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:44,550 INFO L225 Difference]: With dead ends: 1679 [2024-11-09 10:13:44,550 INFO L226 Difference]: Without dead ends: 1673 [2024-11-09 10:13:44,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 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-09 10:13:44,552 INFO L432 NwaCegarLoop]: 1379 mSDtfsCounter, 22 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17875 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:44,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17875 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:13:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2024-11-09 10:13:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2024-11-09 10:13:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1083 states have (on average 1.794090489381348) internal successors, (1943), 1661 states have internal predecessors, (1943), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 10:13:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1964 transitions. [2024-11-09 10:13:44,576 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1964 transitions. Word has length 78 [2024-11-09 10:13:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:44,576 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 1964 transitions. [2024-11-09 10:13:44,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.423076923076923) internal successors, (89), 26 states have internal predecessors, (89), 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-09 10:13:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1964 transitions. [2024-11-09 10:13:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 10:13:44,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:44,577 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:44,594 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 (19)] Ended with exit code 0 [2024-11-09 10:13:44,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:44,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:44,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash -319196096, now seen corresponding path program 4 times [2024-11-09 10:13:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550672480] [2024-11-09 10:13:44,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:13:44,785 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-09 10:13:44,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:44,789 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:44,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 10:13:45,212 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:13:45,212 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:45,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:13:45,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:45,563 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-09 10:13:45,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:46,694 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-09 10:13:46,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550672480] [2024-11-09 10:13:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550672480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:46,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:13:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52192744] [2024-11-09 10:13:46,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:46,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:13:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:13:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:13:46,697 INFO L87 Difference]: Start difference. First operand 1673 states and 1964 transitions. Second operand has 50 states, 50 states have (on average 2.26) internal successors, (113), 50 states have internal predecessors, (113), 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-09 10:13:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:51,467 INFO L93 Difference]: Finished difference Result 1713 states and 2038 transitions. [2024-11-09 10:13:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:13:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.26) internal successors, (113), 50 states have internal predecessors, (113), 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 90 [2024-11-09 10:13:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:51,476 INFO L225 Difference]: With dead ends: 1713 [2024-11-09 10:13:51,476 INFO L226 Difference]: Without dead ends: 1709 [2024-11-09 10:13:51,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:13:51,483 INFO L432 NwaCegarLoop]: 1378 mSDtfsCounter, 48 mSDsluCounter, 32977 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34355 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:51,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 34355 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:13:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2024-11-09 10:13:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1707. [2024-11-09 10:13:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1117 states have (on average 1.7806624888093106) internal successors, (1989), 1695 states have internal predecessors, (1989), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 10:13:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2010 transitions. [2024-11-09 10:13:51,526 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2010 transitions. Word has length 90 [2024-11-09 10:13:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:51,527 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2010 transitions. [2024-11-09 10:13:51,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.26) internal successors, (113), 50 states have internal predecessors, (113), 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-09 10:13:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2010 transitions. [2024-11-09 10:13:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 10:13:51,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:51,532 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:51,544 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 (20)] Ended with exit code 0 [2024-11-09 10:13:51,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:51,733 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-11-09 10:13:51,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1272697376, now seen corresponding path program 5 times [2024-11-09 10:13:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894747181] [2024-11-09 10:13:51,734 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:13:51,734 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-09 10:13:51,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:51,737 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:51,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 10:13:53,000 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:13:53,001 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:53,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 10:13:53,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:53,068 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 10:13:53,069 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-09 10:13:53,546 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-09 10:13:53,546 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-09 10:13:53,645 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-09 10:13:53,829 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-09 10:13:55,704 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:55,705 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-09 10:13:55,766 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-09 10:13:55,811 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-09 10:13:55,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:56,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (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_1592) |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-09 10:13:56,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894747181] [2024-11-09 10:13:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894747181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [709753072] [2024-11-09 10:13:56,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:13:56,059 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:13:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:13:56,061 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:13:56,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process