./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.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_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:12:48,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:12:48,893 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:48,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:12:48,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:12:48,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:12:48,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:12:48,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:12:48,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:12:48,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:12:48,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:12:48,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:12:48,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:12:48,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:12:48,933 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:12:48,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:12:48,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:12:48,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:12:48,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:12:48,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:12:48,938 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:12:48,938 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:12:48,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:12:48,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:12:48,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:12:48,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:12:48,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:12:48,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:12:48,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:12:48,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:12:48,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:12:48,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:12:48,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:12:48,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:48,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:12:48,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:12:48,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:12:48,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:12:48,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:12:48,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:12:48,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:12:48,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:12:48,944 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-09 10:12:49,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:12:49,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:12:49,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:12:49,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:12:49,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:12:49,184 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_test3-2.i [2024-11-09 10:12:50,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:12:50,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:12:50,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i [2024-11-09 10:12:50,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71611a6f9/ed15932397e64b8b877902ffa1ed532f/FLAG8dd9107ef [2024-11-09 10:12:50,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71611a6f9/ed15932397e64b8b877902ffa1ed532f [2024-11-09 10:12:50,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:12:50,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:12:50,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:50,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:12:50,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:12:50,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:50" (1/1) ... [2024-11-09 10:12:50,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4c176d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:50, skipping insertion in model container [2024-11-09 10:12:50,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:50" (1/1) ... [2024-11-09 10:12:50,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:12:51,349 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:12:51,392 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:12:51,399 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:12:51,402 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:12:51,407 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:12:51,432 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:51,433 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:12:51,435 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:12:51,435 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:12:51,438 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:12:51,439 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:12:51,440 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:12:51,441 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:12:51,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:12:51,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:12:51,449 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:51,454 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:12:51,455 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:12:51,456 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:12:51,463 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:12:51,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:51,488 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:12:51,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@555ca32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:51, skipping insertion in model container [2024-11-09 10:12:51,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:51,489 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:12:51,491 INFO L158 Benchmark]: Toolchain (without parser) took 591.60ms. Allocated memory was 117.4MB in the beginning and 155.2MB in the end (delta: 37.7MB). Free memory was 45.5MB in the beginning and 108.4MB in the end (delta: -62.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-09 10:12:51,491 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:12:51,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.43ms. Allocated memory was 117.4MB in the beginning and 155.2MB in the end (delta: 37.7MB). Free memory was 45.3MB in the beginning and 108.4MB in the end (delta: -63.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-09 10:12:51,494 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.17ms. Allocated memory is still 117.4MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.43ms. Allocated memory was 117.4MB in the beginning and 155.2MB in the end (delta: 37.7MB). Free memory was 45.3MB in the beginning and 108.4MB in the end (delta: -63.2MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:12:53,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:12:53,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:12:53,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:12:53,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:12:53,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:12:53,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:12:53,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:12:53,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:12:53,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:12:53,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:12:53,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:12:53,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:12:53,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:12:53,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:12:53,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:12:53,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:12:53,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:12:53,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:12:53,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:12:53,584 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:12:53,584 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:12:53,584 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:12:53,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:12:53,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:12:53,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:12:53,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:12:53,585 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:12:53,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:12:53,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:12:53,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:12:53,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:12:53,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:12:53,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:12:53,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:12:53,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:53,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:12:53,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:12:53,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:12:53,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:12:53,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:12:53,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:12:53,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:12:53,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:12:53,591 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-09 10:12:53,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:12:53,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:12:53,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:12:53,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:12:53,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:12:53,910 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_test3-2.i [2024-11-09 10:12:55,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:12:55,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:12:55,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test3-2.i [2024-11-09 10:12:55,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886d66f35/f7ba525323e84cc49274520624280303/FLAGad778e9db [2024-11-09 10:12:55,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886d66f35/f7ba525323e84cc49274520624280303 [2024-11-09 10:12:55,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:12:55,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:12:55,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:55,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:12:55,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:12:55,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:55" (1/1) ... [2024-11-09 10:12:55,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b36ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:55, skipping insertion in model container [2024-11-09 10:12:55,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:55" (1/1) ... [2024-11-09 10:12:55,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:12:56,402 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:12:56,443 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:12:56,450 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:56,458 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:56,469 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:12:56,510 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:12:56,514 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:12:56,517 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:12:56,520 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:12:56,523 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:12:56,527 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:12:56,530 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:12:56,531 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:12:56,535 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:12:56,536 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:12:56,537 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:12:56,538 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:12:56,539 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:12:56,539 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:12:56,542 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:12:56,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:56,573 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:12:56,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:12:56,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:12:56,639 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:56,641 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:12:56,643 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:12:56,649 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:12:56,683 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:12:56,683 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:12:56,685 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:12:56,685 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:12:56,687 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:12:56,688 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:12:56,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:56,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:56,692 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:56,692 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:12:56,694 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:12:56,694 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:12:56,695 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:12:56,696 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:12:56,698 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:12:56,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:56,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:12:56,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:56,856 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:12:56,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56 WrapperNode [2024-11-09 10:12:56,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:56,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:12:56,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:12:56,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:12:56,866 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:12:56" (1/1) ... [2024-11-09 10:12:56,902 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:12:56" (1/1) ... [2024-11-09 10:12:56,993 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1217 [2024-11-09 10:12:56,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:12:56,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:12:56,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:12:56,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:12:57,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,128 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 266, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-09 10:12:57,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:12:57,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:12:57,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:12:57,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:12:57,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (1/1) ... [2024-11-09 10:12:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:57,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:57,297 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:12:57,300 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:12:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:12:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:12:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:12:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:12:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:12:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:12:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:12:57,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:12:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:12:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:12:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:12:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:12:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:12:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:12:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:12:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:12:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:12:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:12:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:12:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:12:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:12:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:12:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:12:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:12:57,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:12:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:12:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:12:57,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:12:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:12:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:12:57,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:12:57,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:12:57,606 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:12:57,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:12:57,633 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:57,689 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:57,725 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:13:01,535 INFO L? ?]: Removed 1301 outVars from TransFormulas that were not future-live. [2024-11-09 10:13:01,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:13:01,566 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:13:01,567 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-09 10:13:01,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:13:01 BoogieIcfgContainer [2024-11-09 10:13:01,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:13:01,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:13:01,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:13:01,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:13:01,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:12:55" (1/3) ... [2024-11-09 10:13:01,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c528c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:13:01, skipping insertion in model container [2024-11-09 10:13:01,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:56" (2/3) ... [2024-11-09 10:13:01,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c528c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:13:01, skipping insertion in model container [2024-11-09 10:13:01,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:13:01" (3/3) ... [2024-11-09 10:13:01,578 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test3-2.i [2024-11-09 10:13:01,595 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:13:01,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 630 error locations. [2024-11-09 10:13:01,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:13:01,711 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;@7489f47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:13:01,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 630 error locations. [2024-11-09 10:13:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 1260 states, 625 states have (on average 2.2352) internal successors, (1397), 1253 states have internal predecessors, (1397), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:13:01,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:01,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:13:01,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:01,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1758702, now seen corresponding path program 1 times [2024-11-09 10:13:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:01,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257879968] [2024-11-09 10:13:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:01,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:01,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:01,752 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:01,754 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:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:01,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:13:01,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:01,990 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-09 10:13:01,992 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:01,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:01,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257879968] [2024-11-09 10:13:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257879968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:01,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539233492] [2024-11-09 10:13:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:02,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:02,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:13:02,075 INFO L87 Difference]: Start difference. First operand has 1260 states, 625 states have (on average 2.2352) internal successors, (1397), 1253 states have internal predecessors, (1397), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:04,713 INFO L93 Difference]: Finished difference Result 1832 states and 1956 transitions. [2024-11-09 10:13:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:04,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 10:13:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:04,742 INFO L225 Difference]: With dead ends: 1832 [2024-11-09 10:13:04,743 INFO L226 Difference]: Without dead ends: 1829 [2024-11-09 10:13:04,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:13:04,747 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 616 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1957 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:04,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1718 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 946 Invalid, 0 Unknown, 1957 Unchecked, 2.5s Time] [2024-11-09 10:13:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-09 10:13:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1248. [2024-11-09 10:13:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 619 states have (on average 2.109854604200323) internal successors, (1306), 1241 states have internal predecessors, (1306), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1316 transitions. [2024-11-09 10:13:04,854 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1316 transitions. Word has length 4 [2024-11-09 10:13:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:04,855 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1316 transitions. [2024-11-09 10:13:04,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1316 transitions. [2024-11-09 10:13:04,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:13:04,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:04,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:13:04,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:13:05,059 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:05,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:05,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-09 10:13:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998700241] [2024-11-09 10:13:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:05,062 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:05,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:05,065 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:05,066 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:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:05,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:05,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:05,212 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:05,224 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:05,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:05,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998700241] [2024-11-09 10:13:05,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998700241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:05,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:13:05,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183649849] [2024-11-09 10:13:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:05,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:05,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:05,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:05,229 INFO L87 Difference]: Start difference. First operand 1248 states and 1316 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:06,956 INFO L93 Difference]: Finished difference Result 1434 states and 1513 transitions. [2024-11-09 10:13:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:06,956 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:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:06,962 INFO L225 Difference]: With dead ends: 1434 [2024-11-09 10:13:06,962 INFO L226 Difference]: Without dead ends: 1434 [2024-11-09 10:13:06,963 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:06,964 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 1157 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:06,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 919 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:13:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-11-09 10:13:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1247. [2024-11-09 10:13:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 628 states have (on average 2.0812101910828025) internal successors, (1307), 1239 states have internal predecessors, (1307), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1317 transitions. [2024-11-09 10:13:06,993 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1317 transitions. Word has length 4 [2024-11-09 10:13:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:06,993 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1317 transitions. [2024-11-09 10:13:06,993 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:06,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1317 transitions. [2024-11-09 10:13:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:13:06,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:06,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:13:06,998 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:07,194 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:07,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-09 10:13:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780284638] [2024-11-09 10:13:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:07,196 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:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:07,200 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:07,201 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:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:07,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:07,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:07,335 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:07,357 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:07,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:07,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780284638] [2024-11-09 10:13:07,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780284638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:07,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:07,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:13:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128784140] [2024-11-09 10:13:07,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:07,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:07,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:07,362 INFO L87 Difference]: Start difference. First operand 1247 states and 1317 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:09,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:09,639 INFO L93 Difference]: Finished difference Result 1853 states and 1968 transitions. [2024-11-09 10:13:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:09,639 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:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:09,646 INFO L225 Difference]: With dead ends: 1853 [2024-11-09 10:13:09,646 INFO L226 Difference]: Without dead ends: 1853 [2024-11-09 10:13:09,647 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:09,650 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 645 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:09,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1712 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:13:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-11-09 10:13:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1457. [2024-11-09 10:13:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 838 states have (on average 2.064439140811456) internal successors, (1730), 1448 states have internal predecessors, (1730), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1742 transitions. [2024-11-09 10:13:09,687 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1742 transitions. Word has length 4 [2024-11-09 10:13:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:09,688 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 1742 transitions. [2024-11-09 10:13:09,688 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:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1742 transitions. [2024-11-09 10:13:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:13:09,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:09,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:09,693 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:09,889 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:09,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:09,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:09,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-09 10:13:09,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:09,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635611296] [2024-11-09 10:13:09,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:09,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:09,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:09,896 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:09,898 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:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:10,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:13:10,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:10,081 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:10,091 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:10,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:13:10,177 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:10,195 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:13:10,196 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:10,220 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,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:10,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:10,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635611296] [2024-11-09 10:13:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635611296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:10,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:10,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:10,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280857461] [2024-11-09 10:13:10,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:10,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:10,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:10,222 INFO L87 Difference]: Start difference. First operand 1457 states and 1742 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:12,535 INFO L93 Difference]: Finished difference Result 1638 states and 1933 transitions. [2024-11-09 10:13:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 10:13:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:12,541 INFO L225 Difference]: With dead ends: 1638 [2024-11-09 10:13:12,541 INFO L226 Difference]: Without dead ends: 1638 [2024-11-09 10:13:12,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:12,543 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1459 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:12,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 545 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:13:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2024-11-09 10:13:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1235. [2024-11-09 10:13:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 628 states have (on average 2.0589171974522293) internal successors, (1293), 1227 states have internal predecessors, (1293), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1303 transitions. [2024-11-09 10:13:12,564 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1303 transitions. Word has length 8 [2024-11-09 10:13:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:12,565 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1303 transitions. [2024-11-09 10:13:12,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1303 transitions. [2024-11-09 10:13:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:13:12,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:12,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:12,570 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:12,766 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:12,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-09 10:13:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446691723] [2024-11-09 10:13:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:12,768 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:12,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:12,772 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:12,773 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:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:12,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:12,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:12,897 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:12,908 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:12,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:12,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:12,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446691723] [2024-11-09 10:13:12,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446691723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:12,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:12,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:13:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394754324] [2024-11-09 10:13:12,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:12,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:12,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:12,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:12,910 INFO L87 Difference]: Start difference. First operand 1235 states and 1303 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:14,241 INFO L93 Difference]: Finished difference Result 1572 states and 1671 transitions. [2024-11-09 10:13:14,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:14,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:13:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:14,247 INFO L225 Difference]: With dead ends: 1572 [2024-11-09 10:13:14,247 INFO L226 Difference]: Without dead ends: 1572 [2024-11-09 10:13:14,248 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:14,249 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 929 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:14,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1515 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:13:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-09 10:13:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1187. [2024-11-09 10:13:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 628 states have (on average 1.982484076433121) internal successors, (1245), 1179 states have internal predecessors, (1245), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1255 transitions. [2024-11-09 10:13:14,269 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1255 transitions. Word has length 9 [2024-11-09 10:13:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:14,269 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1255 transitions. [2024-11-09 10:13:14,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1255 transitions. [2024-11-09 10:13:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:13:14,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:14,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:14,275 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:14,470 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:14,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:14,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-09 10:13:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:14,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045202145] [2024-11-09 10:13:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:14,472 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:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:14,473 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:14,474 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:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:14,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:14,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:14,601 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:14,621 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:14,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:14,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:14,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045202145] [2024-11-09 10:13:14,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045202145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:14,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:14,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:13:14,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781592788] [2024-11-09 10:13:14,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:14,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:14,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:14,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:14,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:14,623 INFO L87 Difference]: Start difference. First operand 1187 states and 1255 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:16,608 INFO L93 Difference]: Finished difference Result 1659 states and 1761 transitions. [2024-11-09 10:13:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:13:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:16,613 INFO L225 Difference]: With dead ends: 1659 [2024-11-09 10:13:16,614 INFO L226 Difference]: Without dead ends: 1659 [2024-11-09 10:13:16,615 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:16,616 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 691 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:16,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1886 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:13:16,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-11-09 10:13:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1214. [2024-11-09 10:13:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 665 states have (on average 1.9684210526315788) internal successors, (1309), 1206 states have internal predecessors, (1309), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1319 transitions. [2024-11-09 10:13:16,644 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1319 transitions. Word has length 9 [2024-11-09 10:13:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:16,646 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1319 transitions. [2024-11-09 10:13:16,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1319 transitions. [2024-11-09 10:13:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 10:13:16,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:16,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:16,652 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:16,848 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:16,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:16,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash -152807585, now seen corresponding path program 1 times [2024-11-09 10:13:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:16,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431276005] [2024-11-09 10:13:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:16,850 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:16,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:16,855 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:16,856 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:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:16,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:13:16,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:17,058 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:17,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:17,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:17,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431276005] [2024-11-09 10:13:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431276005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:17,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:17,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341923074] [2024-11-09 10:13:17,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:17,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:17,061 INFO L87 Difference]: Start difference. First operand 1214 states and 1319 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:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:17,606 INFO L93 Difference]: Finished difference Result 1815 states and 2005 transitions. [2024-11-09 10:13:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:17,607 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:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:17,611 INFO L225 Difference]: With dead ends: 1815 [2024-11-09 10:13:17,611 INFO L226 Difference]: Without dead ends: 1815 [2024-11-09 10:13:17,611 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:17,611 INFO L432 NwaCegarLoop]: 1373 mSDtfsCounter, 635 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 3751 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:17,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 3751 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:13:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2024-11-09 10:13:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1465. [2024-11-09 10:13:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 915 states have (on average 1.9387978142076503) internal successors, (1774), 1456 states have internal predecessors, (1774), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1786 transitions. [2024-11-09 10:13:17,640 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1786 transitions. Word has length 12 [2024-11-09 10:13:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:17,640 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 1786 transitions. [2024-11-09 10:13:17,640 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:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1786 transitions. [2024-11-09 10:13:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:13:17,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:17,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:17,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:17,842 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:17,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:17,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:17,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1410939272, now seen corresponding path program 1 times [2024-11-09 10:13:17,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:17,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009507319] [2024-11-09 10:13:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:17,844 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:17,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:17,845 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:17,846 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:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:17,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:13:17,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:17,984 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:17,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:17,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:17,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009507319] [2024-11-09 10:13:17,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009507319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:17,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:17,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57418829] [2024-11-09 10:13:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:17,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:17,986 INFO L87 Difference]: Start difference. First operand 1465 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:18,013 INFO L93 Difference]: Finished difference Result 1405 states and 1700 transitions. [2024-11-09 10:13:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:18,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 10:13:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:18,017 INFO L225 Difference]: With dead ends: 1405 [2024-11-09 10:13:18,017 INFO L226 Difference]: Without dead ends: 1405 [2024-11-09 10:13:18,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:18,018 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 71 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2299 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:18,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2299 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:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-09 10:13:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-09 10:13:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 879 states have (on average 1.9203640500568828) internal successors, (1688), 1396 states have internal predecessors, (1688), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1700 transitions. [2024-11-09 10:13:18,037 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1700 transitions. Word has length 14 [2024-11-09 10:13:18,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:18,038 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1700 transitions. [2024-11-09 10:13:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1700 transitions. [2024-11-09 10:13:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:13:18,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:18,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:18,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:13:18,244 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:18,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:18,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1297050578, now seen corresponding path program 1 times [2024-11-09 10:13:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992148974] [2024-11-09 10:13:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:18,246 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,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:18,249 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:18,252 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:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:18,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:18,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:18,405 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,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:18,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992148974] [2024-11-09 10:13:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992148974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:18,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:18,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094207234] [2024-11-09 10:13:18,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:18,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:18,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:18,407 INFO L87 Difference]: Start difference. First operand 1405 states and 1700 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:18,461 INFO L93 Difference]: Finished difference Result 1375 states and 1642 transitions. [2024-11-09 10:13:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:13:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 10:13:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:18,465 INFO L225 Difference]: With dead ends: 1375 [2024-11-09 10:13:18,465 INFO L226 Difference]: Without dead ends: 1375 [2024-11-09 10:13:18,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:18,466 INFO L432 NwaCegarLoop]: 1136 mSDtfsCounter, 48 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:18,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3382 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:13:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-09 10:13:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2024-11-09 10:13:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 863 states have (on average 1.888760139049826) internal successors, (1630), 1366 states have internal predecessors, (1630), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1642 transitions. [2024-11-09 10:13:18,487 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1642 transitions. Word has length 16 [2024-11-09 10:13:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:18,488 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1642 transitions. [2024-11-09 10:13:18,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1642 transitions. [2024-11-09 10:13:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 10:13:18,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:18,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:18,493 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:18,689 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:18,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -653157182, now seen corresponding path program 1 times [2024-11-09 10:13:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947362194] [2024-11-09 10:13:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:18,690 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,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:18,693 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:18,694 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:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:18,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:13:18,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:18,981 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-09 10:13:18,981 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,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:18,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947362194] [2024-11-09 10:13:18,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947362194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:18,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:18,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616868363] [2024-11-09 10:13:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:18,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:13:18,983 INFO L87 Difference]: Start difference. First operand 1375 states and 1642 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:20,066 INFO L93 Difference]: Finished difference Result 1675 states and 2017 transitions. [2024-11-09 10:13:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-09 10:13:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:20,070 INFO L225 Difference]: With dead ends: 1675 [2024-11-09 10:13:20,070 INFO L226 Difference]: Without dead ends: 1667 [2024-11-09 10:13:20,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 10:13:20,071 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 246 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1420 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:20,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1683 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 639 Invalid, 0 Unknown, 1420 Unchecked, 1.1s Time] [2024-11-09 10:13:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-09 10:13:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1433. [2024-11-09 10:13:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 920 states have (on average 1.8478260869565217) internal successors, (1700), 1423 states have internal predecessors, (1700), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:13:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1714 transitions. [2024-11-09 10:13:20,088 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1714 transitions. Word has length 17 [2024-11-09 10:13:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:20,088 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1714 transitions. [2024-11-09 10:13:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1714 transitions. [2024-11-09 10:13:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:13:20,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:20,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:20,095 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:20,293 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:20,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-09 10:13:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:20,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178723128] [2024-11-09 10:13:20,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:20,296 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,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:20,299 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:20,300 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:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:20,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:13:20,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:20,484 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,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:20,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178723128] [2024-11-09 10:13:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178723128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:20,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:20,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202659536] [2024-11-09 10:13:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:20,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:20,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:20,487 INFO L87 Difference]: Start difference. First operand 1433 states and 1714 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:20,518 INFO L93 Difference]: Finished difference Result 1373 states and 1628 transitions. [2024-11-09 10:13:20,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:20,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 10:13:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:20,523 INFO L225 Difference]: With dead ends: 1373 [2024-11-09 10:13:20,523 INFO L226 Difference]: Without dead ends: 1373 [2024-11-09 10:13:20,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:20,524 INFO L432 NwaCegarLoop]: 1103 mSDtfsCounter, 71 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2143 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,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2143 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,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-09 10:13:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2024-11-09 10:13:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 884 states have (on average 1.8257918552036199) internal successors, (1614), 1363 states have internal predecessors, (1614), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:13:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1628 transitions. [2024-11-09 10:13:20,542 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1628 transitions. Word has length 19 [2024-11-09 10:13:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:20,542 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1628 transitions. [2024-11-09 10:13:20,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1628 transitions. [2024-11-09 10:13:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 10:13:20,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:20,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:20,551 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:20,749 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:20,750 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:20,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -774929132, now seen corresponding path program 1 times [2024-11-09 10:13:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:20,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178796298] [2024-11-09 10:13:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:20,751 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,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:20,752 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: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 (13)] Waiting until timeout for monitored process [2024-11-09 10:13:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:20,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:20,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:20,933 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,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:20,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:20,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178796298] [2024-11-09 10:13:20,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178796298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:20,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:20,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284229675] [2024-11-09 10:13:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:20,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:20,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:20,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:20,936 INFO L87 Difference]: Start difference. First operand 1373 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:20,986 INFO L93 Difference]: Finished difference Result 1343 states and 1570 transitions. [2024-11-09 10:13:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:13:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 10:13:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:20,989 INFO L225 Difference]: With dead ends: 1343 [2024-11-09 10:13:20,989 INFO L226 Difference]: Without dead ends: 1343 [2024-11-09 10:13:20,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:20,990 INFO L432 NwaCegarLoop]: 1058 mSDtfsCounter, 48 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:20,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3148 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:13:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2024-11-09 10:13:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2024-11-09 10:13:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 868 states have (on average 1.792626728110599) internal successors, (1556), 1333 states have internal predecessors, (1556), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:13:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1570 transitions. [2024-11-09 10:13:21,007 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1570 transitions. Word has length 21 [2024-11-09 10:13:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:21,007 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1570 transitions. [2024-11-09 10:13:21,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1570 transitions. [2024-11-09 10:13:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 10:13:21,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:21,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:21,014 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:21,209 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:21,209 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:21,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash 727437120, now seen corresponding path program 1 times [2024-11-09 10:13:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832061031] [2024-11-09 10:13:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:21,210 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:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:21,215 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:21,216 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:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:21,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:21,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:21,346 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:21,412 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:21,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:21,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:21,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832061031] [2024-11-09 10:13:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832061031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847207469] [2024-11-09 10:13:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:21,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:21,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:21,415 INFO L87 Difference]: Start difference. First operand 1343 states and 1570 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:22,839 INFO L93 Difference]: Finished difference Result 1538 states and 1766 transitions. [2024-11-09 10:13:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:22,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 10:13:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:22,844 INFO L225 Difference]: With dead ends: 1538 [2024-11-09 10:13:22,844 INFO L226 Difference]: Without dead ends: 1538 [2024-11-09 10:13:22,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:22,844 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 963 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:22,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1372 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:13:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-09 10:13:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1339. [2024-11-09 10:13:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 868 states have (on average 1.7788018433179724) internal successors, (1544), 1329 states have internal predecessors, (1544), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:13:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1558 transitions. [2024-11-09 10:13:22,860 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1558 transitions. Word has length 30 [2024-11-09 10:13:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:22,861 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1558 transitions. [2024-11-09 10:13:22,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1558 transitions. [2024-11-09 10:13:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 10:13:22,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:22,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:22,867 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:23,062 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:23,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:23,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash 727437121, now seen corresponding path program 1 times [2024-11-09 10:13:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280190879] [2024-11-09 10:13:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:23,065 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:23,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:23,069 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:23,070 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:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:23,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:13:23,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:23,210 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:23,368 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:23,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:23,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280190879] [2024-11-09 10:13:23,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280190879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:23,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:23,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749405204] [2024-11-09 10:13:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:23,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:23,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:23,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:23,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:23,371 INFO L87 Difference]: Start difference. First operand 1339 states and 1558 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:25,459 INFO L93 Difference]: Finished difference Result 2020 states and 2374 transitions. [2024-11-09 10:13:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:25,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 10:13:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:25,466 INFO L225 Difference]: With dead ends: 2020 [2024-11-09 10:13:25,466 INFO L226 Difference]: Without dead ends: 2020 [2024-11-09 10:13:25,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:25,467 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 573 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:25,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1951 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:13:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2024-11-09 10:13:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1653. [2024-11-09 10:13:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1180 states have (on average 1.790677966101695) internal successors, (2113), 1641 states have internal predecessors, (2113), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2131 transitions. [2024-11-09 10:13:25,486 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2131 transitions. Word has length 30 [2024-11-09 10:13:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:25,487 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2131 transitions. [2024-11-09 10:13:25,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2131 transitions. [2024-11-09 10:13:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:13:25,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:25,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:25,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:13:25,690 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:25,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064798, now seen corresponding path program 1 times [2024-11-09 10:13:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:25,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107144616] [2024-11-09 10:13:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:25,692 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,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:25,695 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:25,696 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:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:25,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:25,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:25,874 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:25,937 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,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:25,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:25,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107144616] [2024-11-09 10:13:25,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107144616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:25,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535114054] [2024-11-09 10:13:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:25,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:25,939 INFO L87 Difference]: Start difference. First operand 1653 states and 2131 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:27,533 INFO L93 Difference]: Finished difference Result 2103 states and 2705 transitions. [2024-11-09 10:13:27,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:27,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 10:13:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:27,540 INFO L225 Difference]: With dead ends: 2103 [2024-11-09 10:13:27,540 INFO L226 Difference]: Without dead ends: 2103 [2024-11-09 10:13:27,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:27,541 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 780 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:27,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 2000 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 10:13:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2024-11-09 10:13:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1649. [2024-11-09 10:13:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1180 states have (on average 1.7838983050847457) internal successors, (2105), 1637 states have internal predecessors, (2105), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2123 transitions. [2024-11-09 10:13:27,562 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2123 transitions. Word has length 35 [2024-11-09 10:13:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:27,563 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2123 transitions. [2024-11-09 10:13:27,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2123 transitions. [2024-11-09 10:13:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:13:27,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:27,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:27,571 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:27,764 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:27,765 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:27,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064797, now seen corresponding path program 1 times [2024-11-09 10:13:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858275706] [2024-11-09 10:13:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:27,766 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:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:27,767 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:27,769 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:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:27,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:13:27,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:27,952 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:28,126 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:28,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:28,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858275706] [2024-11-09 10:13:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858275706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:28,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:28,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638334272] [2024-11-09 10:13:28,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:28,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:28,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:28,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:28,130 INFO L87 Difference]: Start difference. First operand 1649 states and 2123 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:30,236 INFO L93 Difference]: Finished difference Result 2163 states and 2729 transitions. [2024-11-09 10:13:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 10:13:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:30,241 INFO L225 Difference]: With dead ends: 2163 [2024-11-09 10:13:30,241 INFO L226 Difference]: Without dead ends: 2163 [2024-11-09 10:13:30,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:30,242 INFO L432 NwaCegarLoop]: 1275 mSDtfsCounter, 538 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:30,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2537 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:13:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2024-11-09 10:13:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1645. [2024-11-09 10:13:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1180 states have (on average 1.7771186440677966) internal successors, (2097), 1633 states have internal predecessors, (2097), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2115 transitions. [2024-11-09 10:13:30,260 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2115 transitions. Word has length 35 [2024-11-09 10:13:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:30,260 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2115 transitions. [2024-11-09 10:13:30,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2115 transitions. [2024-11-09 10:13:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 10:13:30,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:30,261 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] [2024-11-09 10:13:30,268 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:30,462 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:30,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 188750135, now seen corresponding path program 1 times [2024-11-09 10:13:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387086004] [2024-11-09 10:13:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:30,463 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:30,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:30,465 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:30,466 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:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:30,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:30,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:30,663 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,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:30,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387086004] [2024-11-09 10:13:30,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387086004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338641439] [2024-11-09 10:13:30,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:30,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:30,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:30,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:30,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:30,665 INFO L87 Difference]: Start difference. First operand 1645 states and 2115 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:30,720 INFO L93 Difference]: Finished difference Result 1615 states and 2065 transitions. [2024-11-09 10:13:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:13:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-11-09 10:13:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:30,724 INFO L225 Difference]: With dead ends: 1615 [2024-11-09 10:13:30,725 INFO L226 Difference]: Without dead ends: 1615 [2024-11-09 10:13:30,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:30,725 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 27 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3107 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:30,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3107 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:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-09 10:13:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2024-11-09 10:13:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1150 states have (on average 1.78) internal successors, (2047), 1603 states have internal predecessors, (2047), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2065 transitions. [2024-11-09 10:13:30,742 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2065 transitions. Word has length 49 [2024-11-09 10:13:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:30,742 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2065 transitions. [2024-11-09 10:13:30,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2065 transitions. [2024-11-09 10:13:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 10:13:30,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:30,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:30,748 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:30,947 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:30,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:30,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash -848059422, now seen corresponding path program 1 times [2024-11-09 10:13:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260828381] [2024-11-09 10:13:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:30,949 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:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:30,950 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:30,951 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:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:31,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:31,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:31,180 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:31,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:31,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260828381] [2024-11-09 10:13:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260828381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:31,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:31,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402787134] [2024-11-09 10:13:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:31,183 INFO L87 Difference]: Start difference. First operand 1615 states and 2065 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:31,224 INFO L93 Difference]: Finished difference Result 1603 states and 2045 transitions. [2024-11-09 10:13:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:13:31,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 10:13:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:31,228 INFO L225 Difference]: With dead ends: 1603 [2024-11-09 10:13:31,228 INFO L226 Difference]: Without dead ends: 1603 [2024-11-09 10:13:31,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:31,229 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 21 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3101 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:31,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3101 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:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2024-11-09 10:13:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2024-11-09 10:13:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1138 states have (on average 1.781195079086116) internal successors, (2027), 1591 states have internal predecessors, (2027), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:13:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2045 transitions. [2024-11-09 10:13:31,247 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2045 transitions. Word has length 54 [2024-11-09 10:13:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2045 transitions. [2024-11-09 10:13:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2045 transitions. [2024-11-09 10:13:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 10:13:31,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:31,249 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] [2024-11-09 10:13:31,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:31,449 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:31,449 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1405455467, now seen corresponding path program 1 times [2024-11-09 10:13:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:31,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652561467] [2024-11-09 10:13:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:31,450 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:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:31,452 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:31,453 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:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:31,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:31,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:31,686 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:31,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:31,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652561467] [2024-11-09 10:13:31,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652561467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:31,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:31,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348677567] [2024-11-09 10:13:31,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:31,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:13:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:31,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:13:31,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:13:31,688 INFO L87 Difference]: Start difference. First operand 1603 states and 2045 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:31,766 INFO L93 Difference]: Finished difference Result 1597 states and 1708 transitions. [2024-11-09 10:13:31,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:13:31,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2024-11-09 10:13:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:31,770 INFO L225 Difference]: With dead ends: 1597 [2024-11-09 10:13:31,770 INFO L226 Difference]: Without dead ends: 1597 [2024-11-09 10:13:31,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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:31,771 INFO L432 NwaCegarLoop]: 1332 mSDtfsCounter, 313 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:31,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 2324 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:13:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2024-11-09 10:13:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1240. [2024-11-09 10:13:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 777 states have (on average 1.6975546975546976) internal successors, (1319), 1230 states have internal predecessors, (1319), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 10:13:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1333 transitions. [2024-11-09 10:13:31,787 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1333 transitions. Word has length 57 [2024-11-09 10:13:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1333 transitions. [2024-11-09 10:13:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1333 transitions. [2024-11-09 10:13:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 10:13:31,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:31,789 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:31,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:31,989 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:31,990 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2120436905, now seen corresponding path program 1 times [2024-11-09 10:13:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950563784] [2024-11-09 10:13:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:31,991 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:31,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:31,995 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:31,996 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:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:32,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:13:32,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:32,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:13:32,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:13:32,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:13:32,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 10:13:32,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:13:32,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 10:13:32,357 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,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:32,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950563784] [2024-11-09 10:13:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950563784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:32,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:13:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215603002] [2024-11-09 10:13:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:32,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:13:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:13:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:13:32,360 INFO L87 Difference]: Start difference. First operand 1240 states and 1333 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:32,772 INFO L93 Difference]: Finished difference Result 1908 states and 2037 transitions. [2024-11-09 10:13:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:13:32,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:32,776 INFO L225 Difference]: With dead ends: 1908 [2024-11-09 10:13:32,776 INFO L226 Difference]: Without dead ends: 1905 [2024-11-09 10:13:32,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:13:32,776 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 1577 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 5013 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:32,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 5013 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 10:13:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-11-09 10:13:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1187. [2024-11-09 10:13:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 725 states have (on average 1.7462068965517241) internal successors, (1266), 1178 states have internal predecessors, (1266), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1278 transitions. [2024-11-09 10:13:32,791 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1278 transitions. Word has length 60 [2024-11-09 10:13:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:32,791 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1278 transitions. [2024-11-09 10:13:32,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1278 transitions. [2024-11-09 10:13:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 10:13:32,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:32,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:32,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:32,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:32,992 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:32,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 887665558, now seen corresponding path program 1 times [2024-11-09 10:13:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:32,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575214151] [2024-11-09 10:13:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:32,994 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,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:32,995 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:32,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 10:13:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:33,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:13:33,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:33,307 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:33,315 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:33,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:13:33,761 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:33,776 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:13:33,776 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:33,788 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:33,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:33,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575214151] [2024-11-09 10:13:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575214151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:33,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:13:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021830777] [2024-11-09 10:13:33,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:33,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:33,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:33,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:33,790 INFO L87 Difference]: Start difference. First operand 1187 states and 1278 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:35,679 INFO L93 Difference]: Finished difference Result 1517 states and 1632 transitions. [2024-11-09 10:13:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:35,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-09 10:13:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:35,683 INFO L225 Difference]: With dead ends: 1517 [2024-11-09 10:13:35,683 INFO L226 Difference]: Without dead ends: 1517 [2024-11-09 10:13:35,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:35,684 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 1035 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:35,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 822 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:13:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-09 10:13:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1112. [2024-11-09 10:13:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 688 states have (on average 1.677325581395349) internal successors, (1154), 1103 states have internal predecessors, (1154), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1166 transitions. [2024-11-09 10:13:35,705 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1166 transitions. Word has length 62 [2024-11-09 10:13:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:35,709 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1166 transitions. [2024-11-09 10:13:35,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1166 transitions. [2024-11-09 10:13:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 10:13:35,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:35,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:35,722 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 (22)] Ended with exit code 0 [2024-11-09 10:13:35,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:35,911 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:35,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 512421051, now seen corresponding path program 1 times [2024-11-09 10:13:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:35,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464202163] [2024-11-09 10:13:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:35,912 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,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:35,913 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:35,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 10:13:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:36,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:13:36,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:36,157 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:36,172 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:36,192 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:36,201 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:36,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:36,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:36,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464202163] [2024-11-09 10:13:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464202163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:36,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005813818] [2024-11-09 10:13:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:36,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:13:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:13:36,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:36,203 INFO L87 Difference]: Start difference. First operand 1112 states and 1166 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:37,784 INFO L93 Difference]: Finished difference Result 1111 states and 1165 transitions. [2024-11-09 10:13:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:13:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 10:13:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:37,787 INFO L225 Difference]: With dead ends: 1111 [2024-11-09 10:13:37,787 INFO L226 Difference]: Without dead ends: 1111 [2024-11-09 10:13:37,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:13:37,787 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 2 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:37,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2611 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:13:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2024-11-09 10:13:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2024-11-09 10:13:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 688 states have (on average 1.6758720930232558) internal successors, (1153), 1102 states have internal predecessors, (1153), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1165 transitions. [2024-11-09 10:13:37,797 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1165 transitions. Word has length 67 [2024-11-09 10:13:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:37,797 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1165 transitions. [2024-11-09 10:13:37,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1165 transitions. [2024-11-09 10:13:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 10:13:37,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:37,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:37,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:37,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:37,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:37,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash 512421052, now seen corresponding path program 1 times [2024-11-09 10:13:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:37,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961768016] [2024-11-09 10:13:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:37,999 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:38,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:38,002 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:38,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 10:13:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:38,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:13:38,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:38,277 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:38,296 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:38,301 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:38,348 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:38,366 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:38,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:38,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961768016] [2024-11-09 10:13:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961768016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:38,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:38,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723178160] [2024-11-09 10:13:38,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:38,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:13:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:13:38,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:13:38,369 INFO L87 Difference]: Start difference. First operand 1111 states and 1165 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:40,443 INFO L93 Difference]: Finished difference Result 1110 states and 1164 transitions. [2024-11-09 10:13:40,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:13:40,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 10:13:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:40,446 INFO L225 Difference]: With dead ends: 1110 [2024-11-09 10:13:40,446 INFO L226 Difference]: Without dead ends: 1110 [2024-11-09 10:13:40,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:13:40,446 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:40,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2651 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:13:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-11-09 10:13:40,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2024-11-09 10:13:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 687 states have (on average 1.6768558951965065) internal successors, (1152), 1101 states have internal predecessors, (1152), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:13:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1164 transitions. [2024-11-09 10:13:40,457 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1164 transitions. Word has length 67 [2024-11-09 10:13:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:40,458 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1164 transitions. [2024-11-09 10:13:40,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:13:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1164 transitions. [2024-11-09 10:13:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 10:13:40,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:40,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:40,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-09 10:13:40,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:40,660 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:40,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash -307125982, now seen corresponding path program 1 times [2024-11-09 10:13:40,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156446157] [2024-11-09 10:13:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:40,661 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,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:40,662 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:40,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-09 10:13:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:40,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:13:40,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:40,926 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:40,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:13:40,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:40,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156446157] [2024-11-09 10:13:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156446157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:40,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:40,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:13:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554445855] [2024-11-09 10:13:40,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:40,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:13:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:13:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:40,929 INFO L87 Difference]: Start difference. First operand 1110 states and 1164 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:40,965 INFO L93 Difference]: Finished difference Result 1113 states and 1168 transitions. [2024-11-09 10:13:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:13:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-09 10:13:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:40,970 INFO L225 Difference]: With dead ends: 1113 [2024-11-09 10:13:40,970 INFO L226 Difference]: Without dead ends: 1113 [2024-11-09 10:13:40,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:13:40,971 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 0 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:40,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3046 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:13:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-09 10:13:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2024-11-09 10:13:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 689 states have (on average 1.676342525399129) internal successors, (1155), 1104 states have internal predecessors, (1155), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:13:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1168 transitions. [2024-11-09 10:13:40,984 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1168 transitions. Word has length 75 [2024-11-09 10:13:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:40,985 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1168 transitions. [2024-11-09 10:13:40,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1168 transitions. [2024-11-09 10:13:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:13:40,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:40,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:40,994 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 (25)] Ended with exit code 0 [2024-11-09 10:13:41,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:41,187 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:41,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash -215512109, now seen corresponding path program 1 times [2024-11-09 10:13:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912749714] [2024-11-09 10:13:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:41,188 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,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:41,189 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:41,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 10:13:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:41,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:13:41,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:41,476 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:41,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:41,551 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:41,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912749714] [2024-11-09 10:13:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912749714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:41,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 10:13:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248540779] [2024-11-09 10:13:41,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:41,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:13:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:41,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:13:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:13:41,558 INFO L87 Difference]: Start difference. First operand 1113 states and 1168 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:41,693 INFO L93 Difference]: Finished difference Result 1125 states and 1185 transitions. [2024-11-09 10:13:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:13:41,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2024-11-09 10:13:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:41,696 INFO L225 Difference]: With dead ends: 1125 [2024-11-09 10:13:41,696 INFO L226 Difference]: Without dead ends: 1125 [2024-11-09 10:13:41,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:13:41,697 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 5 mSDsluCounter, 5065 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6082 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:41,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6082 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:13:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-09 10:13:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2024-11-09 10:13:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 698 states have (on average 1.67621776504298) internal successors, (1170), 1113 states have internal predecessors, (1170), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:13:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1183 transitions. [2024-11-09 10:13:41,715 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1183 transitions. Word has length 76 [2024-11-09 10:13:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:41,716 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1183 transitions. [2024-11-09 10:13:41,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1183 transitions. [2024-11-09 10:13:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 10:13:41,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:41,717 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:41,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-09 10:13:41,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:41,918 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:41,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1859173022, now seen corresponding path program 2 times [2024-11-09 10:13:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035619781] [2024-11-09 10:13:41,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:13:41,919 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,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:41,920 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:41,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-09 10:13:42,347 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:13:42,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:42,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:13:42,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:42,395 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:42,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:42,547 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:42,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035619781] [2024-11-09 10:13:42,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035619781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:42,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:42,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 10:13:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593925969] [2024-11-09 10:13:42,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:42,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:13:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:42,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:13:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:13:42,550 INFO L87 Difference]: Start difference. First operand 1123 states and 1183 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:42,963 INFO L93 Difference]: Finished difference Result 1138 states and 1205 transitions. [2024-11-09 10:13:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:13:42,964 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2024-11-09 10:13:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:42,966 INFO L225 Difference]: With dead ends: 1138 [2024-11-09 10:13:42,966 INFO L226 Difference]: Without dead ends: 1134 [2024-11-09 10:13:42,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 10:13:42,967 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 13 mSDsluCounter, 5074 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:42,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6091 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:13:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-11-09 10:13:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1132. [2024-11-09 10:13:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 707 states have (on average 1.6718528995756718) internal successors, (1182), 1122 states have internal predecessors, (1182), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:13:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1195 transitions. [2024-11-09 10:13:42,983 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1195 transitions. Word has length 79 [2024-11-09 10:13:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:42,983 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1195 transitions. [2024-11-09 10:13:42,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1195 transitions. [2024-11-09 10:13:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:13:42,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:42,984 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:42,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-09 10:13:43,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:43,186 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:43,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1616248770, now seen corresponding path program 3 times [2024-11-09 10:13:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:43,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892250984] [2024-11-09 10:13:43,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:13:43,187 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:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:43,190 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:43,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-09 10:13:43,888 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:13:43,889 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:43,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:13:43,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:44,024 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:44,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:44,474 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:44,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:44,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892250984] [2024-11-09 10:13:44,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892250984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:44,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:44,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 10:13:44,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676372319] [2024-11-09 10:13:44,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:44,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:13:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:44,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:13:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:13:44,477 INFO L87 Difference]: Start difference. First operand 1132 states and 1195 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:45,898 INFO L93 Difference]: Finished difference Result 1156 states and 1234 transitions. [2024-11-09 10:13:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 10:13:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-09 10:13:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:45,902 INFO L225 Difference]: With dead ends: 1156 [2024-11-09 10:13:45,902 INFO L226 Difference]: Without dead ends: 1150 [2024-11-09 10:13:45,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 10:13:45,903 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 18 mSDsluCounter, 11166 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12184 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:45,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12184 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:13:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-09 10:13:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-09 10:13:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 725 states have (on average 1.6620689655172414) internal successors, (1205), 1140 states have internal predecessors, (1205), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:13:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1218 transitions. [2024-11-09 10:13:45,916 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1218 transitions. Word has length 85 [2024-11-09 10:13:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:45,916 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1218 transitions. [2024-11-09 10:13:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1218 transitions. [2024-11-09 10:13:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:13:45,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:45,918 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:45,930 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 (28)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:46,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:46,119 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1033790334, now seen corresponding path program 4 times [2024-11-09 10:13:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:46,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862465981] [2024-11-09 10:13:46,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:13:46,120 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:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:46,122 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:46,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-09 10:13:46,558 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:13:46,558 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:46,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:13:46,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:46,887 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,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:48,013 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:48,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:48,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862465981] [2024-11-09 10:13:48,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862465981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:13:48,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:48,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 10:13:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524911378] [2024-11-09 10:13:48,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:48,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 10:13:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:13:48,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 10:13:48,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 10:13:48,015 INFO L87 Difference]: Start difference. First operand 1150 states and 1218 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:52,424 INFO L93 Difference]: Finished difference Result 1190 states and 1290 transitions. [2024-11-09 10:13:52,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 10:13:52,425 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-11-09 10:13:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:52,427 INFO L225 Difference]: With dead ends: 1190 [2024-11-09 10:13:52,427 INFO L226 Difference]: Without dead ends: 1186 [2024-11-09 10:13:52,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 10:13:52,429 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 32 mSDsluCounter, 23325 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24342 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:52,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24342 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:13:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2024-11-09 10:13:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2024-11-09 10:13:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 759 states have (on average 1.6482213438735178) internal successors, (1251), 1174 states have internal predecessors, (1251), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 10:13:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1264 transitions. [2024-11-09 10:13:52,441 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1264 transitions. Word has length 97 [2024-11-09 10:13:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:52,442 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1264 transitions. [2024-11-09 10:13:52,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:13:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1264 transitions. [2024-11-09 10:13:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 10:13:52,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:52,443 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:52,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-11-09 10:13:52,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:13:52,644 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-09 10:13:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -844312606, now seen corresponding path program 5 times [2024-11-09 10:13:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:13:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671675054] [2024-11-09 10:13:52,645 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:13:52,646 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:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:13:52,647 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:13:52,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-09 10:13:53,868 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:13:53,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:13:53,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 10:13:53,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:53,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:13:54,028 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 10:13:54,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 10:13:54,086 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:54,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 10:13:55,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:55,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 10:13:55,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-09 10:13:55,098 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,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:55,380 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2197) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 10:13:55,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:13:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671675054] [2024-11-09 10:13:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671675054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [970902116] [2024-11-09 10:13:55,383 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:13:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:13:55,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:13:55,384 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:13:55,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process