./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.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 ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:44:22,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:44:22,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:44:22,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:44:22,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:44:22,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:44:22,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:44:22,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:44:22,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:44:22,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:44:22,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:44:22,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:44:22,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:44:22,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:44:22,161 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:44:22,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:44:22,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:44:22,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:44:22,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:44:22,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:44:22,165 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:44:22,166 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:44:22,166 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:44:22,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:44:22,166 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:44:22,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:44:22,167 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:44:22,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:44:22,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:44:22,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:44:22,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:44:22,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:44:22,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:44:22,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:44:22,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:44:22,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:44:22,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:44:22,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:44:22,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:44:22,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:44:22,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:44:22,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:44:22,172 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 -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2024-10-14 17:44:22,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:44:22,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:44:22,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:44:22,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:44:22,431 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:44:22,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-10-14 17:44:23,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:44:24,054 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:44:24,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-10-14 17:44:24,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9312c222c/15fabfb486d54e328dc4dde237d99249/FLAG34e5eaecf [2024-10-14 17:44:24,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9312c222c/15fabfb486d54e328dc4dde237d99249 [2024-10-14 17:44:24,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:44:24,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:44:24,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:24,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:44:24,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:44:24,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:24" (1/1) ... [2024-10-14 17:44:24,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eae507d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:24, skipping insertion in model container [2024-10-14 17:44:24,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:24" (1/1) ... [2024-10-14 17:44:24,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:44:24,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:24,401 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-10-14 17:44:24,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@46c97664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:24, skipping insertion in model container [2024-10-14 17:44:24,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:24,402 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:44:24,404 INFO L158 Benchmark]: Toolchain (without parser) took 322.94ms. Allocated memory is still 174.1MB. Free memory was 103.2MB in the beginning and 90.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:44:24,405 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:44:24,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.96ms. Allocated memory is still 174.1MB. Free memory was 103.0MB in the beginning and 90.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:44:24,406 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.96ms. Allocated memory is still 174.1MB. Free memory was 103.0MB in the beginning and 90.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 526]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.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 ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:44:26,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:44:26,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 17:44:26,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:44:26,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:44:26,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:44:26,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:44:26,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:44:26,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:44:26,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:44:26,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:44:26,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:44:26,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:44:26,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:44:26,574 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:44:26,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:44:26,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:44:26,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:44:26,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:44:26,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:44:26,575 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:44:26,577 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:44:26,577 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:44:26,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:44:26,578 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:44:26,578 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:44:26,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:44:26,578 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:44:26,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:44:26,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:44:26,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:44:26,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:44:26,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:44:26,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:44:26,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:44:26,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:44:26,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:44:26,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:44:26,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:44:26,590 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:44:26,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:44:26,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:44:26,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:44:26,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:44:26,591 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:44:26,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 -> ba885d2ca843c278430bc3d4272c307ea7df8f1fbcd0da84e81382a8c1939a93 [2024-10-14 17:44:26,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:44:26,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:44:26,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:44:26,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:44:26,951 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:44:26,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-10-14 17:44:28,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:44:28,711 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:44:28,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/java_BubbleSort-alloca-1.i [2024-10-14 17:44:28,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c226d4e/b18b20a87c68492f901d55bdc6ebf3c2/FLAG54a9e5a52 [2024-10-14 17:44:29,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c226d4e/b18b20a87c68492f901d55bdc6ebf3c2 [2024-10-14 17:44:29,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:44:29,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:44:29,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:29,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:44:29,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:44:29,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bacfed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29, skipping insertion in model container [2024-10-14 17:44:29,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:44:29,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:29,349 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:44:29,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:44:29,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:29,393 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:44:29,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:44:29,465 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:44:29,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29 WrapperNode [2024-10-14 17:44:29,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:44:29,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:44:29,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:44:29,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:44:29,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,524 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-10-14 17:44:29,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:44:29,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:44:29,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:44:29,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:44:29,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,555 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-14 17:44:29,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:44:29,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:44:29,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:44:29,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:44:29,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (1/1) ... [2024-10-14 17:44:29,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:44:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:44:29,633 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-10-14 17:44:29,635 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-10-14 17:44:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:44:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:44:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:44:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:44:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:44:29,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:44:29,810 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:44:29,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:44:30,135 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-10-14 17:44:30,135 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:44:30,197 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:44:30,197 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 17:44:30,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:44:30 BoogieIcfgContainer [2024-10-14 17:44:30,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:44:30,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:44:30,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:44:30,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:44:30,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:44:29" (1/3) ... [2024-10-14 17:44:30,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553fc0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:44:30, skipping insertion in model container [2024-10-14 17:44:30,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:44:29" (2/3) ... [2024-10-14 17:44:30,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553fc0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:44:30, skipping insertion in model container [2024-10-14 17:44:30,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:44:30" (3/3) ... [2024-10-14 17:44:30,209 INFO L112 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca-1.i [2024-10-14 17:44:30,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:44:30,225 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-14 17:44:30,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:44:30,278 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;@7e729ce6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:44:30,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-14 17:44:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 2.210526315789474) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 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-10-14 17:44:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:44:30,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:30,291 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:44:30,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:30,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash 107286586, now seen corresponding path program 1 times [2024-10-14 17:44:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130612317] [2024-10-14 17:44:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:30,307 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-10-14 17:44:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:30,311 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-10-14 17:44:30,312 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-10-14 17:44:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:30,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:44:30,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:30,446 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-10-14 17:44:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:30,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:30,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:30,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130612317] [2024-10-14 17:44:30,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130612317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:30,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:30,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:44:30,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521335920] [2024-10-14 17:44:30,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:30,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:44:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:44:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:44:30,508 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 2.210526315789474) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:30,605 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-10-14 17:44:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:44:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:44:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:30,616 INFO L225 Difference]: With dead ends: 34 [2024-10-14 17:44:30,616 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 17:44:30,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:44:30,620 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:30,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 17:44:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-14 17:44:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 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-10-14 17:44:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-14 17:44:30,656 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 5 [2024-10-14 17:44:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:30,656 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-14 17:44:30,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-14 17:44:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:44:30,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:30,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:44:30,661 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-10-14 17:44:30,860 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-10-14 17:44:30,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:30,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:30,862 INFO L85 PathProgramCache]: Analyzing trace with hash 107286587, now seen corresponding path program 1 times [2024-10-14 17:44:30,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:30,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677445145] [2024-10-14 17:44:30,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:30,862 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-10-14 17:44:30,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:30,865 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-10-14 17:44:30,866 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-10-14 17:44:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:30,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:44:30,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:30,976 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-10-14 17:44:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:31,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:31,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677445145] [2024-10-14 17:44:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677445145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127528544] [2024-10-14 17:44:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:31,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:31,019 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:31,159 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-10-14 17:44:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:31,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:44:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:31,161 INFO L225 Difference]: With dead ends: 40 [2024-10-14 17:44:31,161 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 17:44:31,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-14 17:44:31,163 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:31,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 17:44:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-10-14 17:44:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 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-10-14 17:44:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-14 17:44:31,168 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 5 [2024-10-14 17:44:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:31,169 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-14 17:44:31,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-14 17:44:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:44:31,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:31,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:44:31,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:44:31,370 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-10-14 17:44:31,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 107346169, now seen corresponding path program 1 times [2024-10-14 17:44:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606774283] [2024-10-14 17:44:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:31,377 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-10-14 17:44:31,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:31,380 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-10-14 17:44:31,384 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-10-14 17:44:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:31,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:44:31,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:31,484 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 8 treesize of output 7 [2024-10-14 17:44:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:31,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:31,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606774283] [2024-10-14 17:44:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606774283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:31,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:31,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380718045] [2024-10-14 17:44:31,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:31,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:31,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:31,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:31,574 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:31,732 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-14 17:44:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:31,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:44:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:31,733 INFO L225 Difference]: With dead ends: 38 [2024-10-14 17:44:31,733 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 17:44:31,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:44:31,734 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:31,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 17:44:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-10-14 17:44:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 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-10-14 17:44:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-14 17:44:31,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2024-10-14 17:44:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:31,739 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-14 17:44:31,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-14 17:44:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:44:31,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:31,740 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 17:44:31,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:31,941 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-10-14 17:44:31,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:31,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 23260898, now seen corresponding path program 1 times [2024-10-14 17:44:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:31,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025447495] [2024-10-14 17:44:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:31,944 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-10-14 17:44:31,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:31,947 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-10-14 17:44:31,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:44:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:31,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:44:31,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:32,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:32,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025447495] [2024-10-14 17:44:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025447495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:32,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:44:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064579279] [2024-10-14 17:44:32,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:32,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:44:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:44:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:44:32,066 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-10-14 17:44:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:32,139 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-10-14 17:44:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:44:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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 7 [2024-10-14 17:44:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:32,141 INFO L225 Difference]: With dead ends: 40 [2024-10-14 17:44:32,142 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 17:44:32,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:44:32,143 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:32,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 17:44:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-10-14 17:44:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-10-14 17:44:32,151 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 7 [2024-10-14 17:44:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:32,154 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-14 17:44:32,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-10-14 17:44:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-10-14 17:44:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:44:32,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:32,155 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 17:44:32,158 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-10-14 17:44:32,355 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-10-14 17:44:32,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:32,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash 80519200, now seen corresponding path program 1 times [2024-10-14 17:44:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:32,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987862380] [2024-10-14 17:44:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:32,357 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-10-14 17:44:32,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:32,360 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-10-14 17:44:32,361 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-10-14 17:44:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:32,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 17:44:32,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:32,440 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 8 treesize of output 7 [2024-10-14 17:44:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:32,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:32,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:32,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987862380] [2024-10-14 17:44:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987862380] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:32,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 17:44:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140546930] [2024-10-14 17:44:32,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:32,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:44:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:44:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:44:32,825 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:33,434 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-10-14 17:44:33,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:44:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:44:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:33,437 INFO L225 Difference]: With dead ends: 45 [2024-10-14 17:44:33,437 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 17:44:33,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:44:33,438 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:33,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:44:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 17:44:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 17:44:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 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-10-14 17:44:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-14 17:44:33,441 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 7 [2024-10-14 17:44:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:33,441 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-14 17:44:33,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-14 17:44:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:44:33,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:33,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:33,445 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-10-14 17:44:33,642 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-10-14 17:44:33,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:33,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1474073400, now seen corresponding path program 1 times [2024-10-14 17:44:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615861274] [2024-10-14 17:44:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:33,644 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-10-14 17:44:33,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:33,645 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-10-14 17:44:33,646 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-10-14 17:44:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:33,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:44:33,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:33,759 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc9#1.base_12| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc9#1.base_12| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc9#1.base_12|)))) is different from true [2024-10-14 17:44:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:33,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:33,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615861274] [2024-10-14 17:44:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615861274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:33,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:33,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:33,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813648013] [2024-10-14 17:44:33,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:33,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:44:33,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:33,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:44:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-14 17:44:33,762 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:33,859 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-14 17:44:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:44:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-14 17:44:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:33,861 INFO L225 Difference]: With dead ends: 44 [2024-10-14 17:44:33,861 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 17:44:33,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-14 17:44:33,862 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:33,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2024-10-14 17:44:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 17:44:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 17:44:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 41 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-10-14 17:44:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-14 17:44:33,869 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 10 [2024-10-14 17:44:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:33,870 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-14 17:44:33,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-14 17:44:33,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:44:33,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:33,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:33,877 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-10-14 17:44:34,074 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-10-14 17:44:34,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:34,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1474074170, now seen corresponding path program 1 times [2024-10-14 17:44:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473478277] [2024-10-14 17:44:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:34,076 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-10-14 17:44:34,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:34,077 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-10-14 17:44:34,078 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-10-14 17:44:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:34,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:44:34,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:34,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:34,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:34,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473478277] [2024-10-14 17:44:34,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473478277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:34,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:34,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:44:34,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021338469] [2024-10-14 17:44:34,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:34,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:34,145 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:34,201 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-14 17:44:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:34,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-14 17:44:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:34,205 INFO L225 Difference]: With dead ends: 44 [2024-10-14 17:44:34,205 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 17:44:34,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-14 17:44:34,206 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:34,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:44:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 17:44:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 17:44:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.76) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 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-10-14 17:44:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-14 17:44:34,210 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 10 [2024-10-14 17:44:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:34,210 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-14 17:44:34,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-14 17:44:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:44:34,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:34,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:34,214 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-10-14 17:44:34,411 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-10-14 17:44:34,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:34,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2140834756, now seen corresponding path program 1 times [2024-10-14 17:44:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:34,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644679038] [2024-10-14 17:44:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:34,413 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-10-14 17:44:34,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:34,416 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-10-14 17:44:34,417 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-10-14 17:44:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:34,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:44:34,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:34,474 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-10-14 17:44:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:34,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:34,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644679038] [2024-10-14 17:44:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644679038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:34,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:34,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:44:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121468576] [2024-10-14 17:44:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:44:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:44:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:44:34,501 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:34,587 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-10-14 17:44:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:44:34,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-14 17:44:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:34,589 INFO L225 Difference]: With dead ends: 32 [2024-10-14 17:44:34,589 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 17:44:34,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-14 17:44:34,590 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:34,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 22 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:44:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 17:44:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 17:44:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.52) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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-10-14 17:44:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-10-14 17:44:34,593 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 10 [2024-10-14 17:44:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:34,593 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-10-14 17:44:34,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-10-14 17:44:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:44:34,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:34,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:34,598 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-10-14 17:44:34,796 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-10-14 17:44:34,797 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:34,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:34,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2140834755, now seen corresponding path program 1 times [2024-10-14 17:44:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:34,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008534426] [2024-10-14 17:44:34,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:34,798 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-10-14 17:44:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:34,799 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-10-14 17:44:34,800 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-10-14 17:44:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:34,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:44:34,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:34,865 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 8 treesize of output 7 [2024-10-14 17:44:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:35,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:35,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008534426] [2024-10-14 17:44:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008534426] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 17:44:35,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:44:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-14 17:44:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785930143] [2024-10-14 17:44:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:35,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:44:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:35,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:44:35,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:44:35,306 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:35,575 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-14 17:44:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:44:35,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-14 17:44:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:35,576 INFO L225 Difference]: With dead ends: 32 [2024-10-14 17:44:35,576 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 17:44:35,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:44:35,577 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:35,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 20 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:44:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 17:44:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 17:44:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 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-10-14 17:44:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-14 17:44:35,582 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 10 [2024-10-14 17:44:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:35,582 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-14 17:44:35,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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-10-14 17:44:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-10-14 17:44:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:44:35,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:35,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:35,586 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 (10)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:35,783 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-10-14 17:44:35,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:35,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:35,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1941367978, now seen corresponding path program 1 times [2024-10-14 17:44:35,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:35,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323293718] [2024-10-14 17:44:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:35,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:35,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:35,787 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-10-14 17:44:35,788 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-10-14 17:44:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:35,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 17:44:35,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:35,851 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 8 treesize of output 7 [2024-10-14 17:44:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:36,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:44:36,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323293718] [2024-10-14 17:44:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323293718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:44:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:44:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:44:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131644968] [2024-10-14 17:44:36,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:44:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:44:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:44:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:44:36,029 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:36,268 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-10-14 17:44:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:44:36,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 17:44:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:36,269 INFO L225 Difference]: With dead ends: 52 [2024-10-14 17:44:36,269 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 17:44:36,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:44:36,270 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:36,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 14 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:44:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 17:44:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2024-10-14 17:44:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 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-10-14 17:44:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-14 17:44:36,274 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 11 [2024-10-14 17:44:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:36,274 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-14 17:44:36,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-14 17:44:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:44:36,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:36,275 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2024-10-14 17:44:36,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 17:44:36,475 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-10-14 17:44:36,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:36,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash -324582635, now seen corresponding path program 2 times [2024-10-14 17:44:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:36,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543768288] [2024-10-14 17:44:36,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:44:36,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:44:36,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:36,480 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-10-14 17:44:36,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 17:44:36,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:44:36,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:36,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:44:36,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:36,552 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 8 treesize of output 7 [2024-10-14 17:44:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:36,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:37,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:37,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543768288] [2024-10-14 17:44:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543768288] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:37,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-14 17:44:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733204642] [2024-10-14 17:44:37,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:37,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:44:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:44:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:44:37,467 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-14 17:44:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:39,586 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-10-14 17:44:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 17:44:39,587 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:44:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:39,588 INFO L225 Difference]: With dead ends: 53 [2024-10-14 17:44:39,588 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 17:44:39,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2024-10-14 17:44:39,589 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:39,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 95 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:44:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 17:44:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 17:44:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 52 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-10-14 17:44:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-10-14 17:44:39,593 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 13 [2024-10-14 17:44:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:39,593 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-10-14 17:44:39,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 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-10-14 17:44:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-10-14 17:44:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:44:39,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:39,594 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:39,598 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-10-14 17:44:39,797 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-10-14 17:44:39,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1346877145, now seen corresponding path program 1 times [2024-10-14 17:44:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017330561] [2024-10-14 17:44:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:39,798 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-10-14 17:44:39,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:39,800 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-10-14 17:44:39,800 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-10-14 17:44:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:39,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:44:39,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:39,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 8 treesize of output 7 [2024-10-14 17:44:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:40,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:44:40,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:40,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017330561] [2024-10-14 17:44:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017330561] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:40,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-10-14 17:44:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737678572] [2024-10-14 17:44:40,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:40,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:44:40,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:40,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:44:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:44:40,382 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-14 17:44:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:40,912 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-10-14 17:44:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:44:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:44:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:40,915 INFO L225 Difference]: With dead ends: 66 [2024-10-14 17:44:40,916 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 17:44:40,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:44:40,916 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 89 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:40,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 42 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:44:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 17:44:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2024-10-14 17:44:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:44:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-10-14 17:44:40,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 15 [2024-10-14 17:44:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:40,922 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-10-14 17:44:40,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-14 17:44:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-10-14 17:44:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:44:40,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:40,923 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:40,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 17:44:41,126 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-10-14 17:44:41,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:41,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1196481478, now seen corresponding path program 1 times [2024-10-14 17:44:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486559011] [2024-10-14 17:44:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:41,128 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-10-14 17:44:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:41,129 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-10-14 17:44:41,129 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-10-14 17:44:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:41,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 17:44:41,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:41,211 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 8 treesize of output 7 [2024-10-14 17:44:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:41,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:42,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486559011] [2024-10-14 17:44:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486559011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:42,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:42,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2024-10-14 17:44:42,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45744993] [2024-10-14 17:44:42,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:42,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:44:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:42,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:44:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:44:42,013 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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-10-14 17:44:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:42,473 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-10-14 17:44:42,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:44:42,474 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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-10-14 17:44:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:42,474 INFO L225 Difference]: With dead ends: 48 [2024-10-14 17:44:42,474 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 17:44:42,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-10-14 17:44:42,475 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:42,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:44:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 17:44:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-14 17:44:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 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-10-14 17:44:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2024-10-14 17:44:42,478 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 16 [2024-10-14 17:44:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:42,479 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2024-10-14 17:44:42,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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-10-14 17:44:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2024-10-14 17:44:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:44:42,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:42,480 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:42,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:42,683 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-10-14 17:44:42,683 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:42,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash -310751565, now seen corresponding path program 2 times [2024-10-14 17:44:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:42,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409408560] [2024-10-14 17:44:42,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:44:42,684 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-10-14 17:44:42,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:42,686 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-10-14 17:44:42,686 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-10-14 17:44:42,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:44:42,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:42,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 17:44:42,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:42,749 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 8 treesize of output 7 [2024-10-14 17:44:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:43,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:44,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409408560] [2024-10-14 17:44:44,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409408560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:44,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:44,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2024-10-14 17:44:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355833324] [2024-10-14 17:44:44,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:44,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:44:44,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:44,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:44:44,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:44:44,169 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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-10-14 17:44:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:46,211 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2024-10-14 17:44:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 17:44:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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 18 [2024-10-14 17:44:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:46,212 INFO L225 Difference]: With dead ends: 103 [2024-10-14 17:44:46,213 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 17:44:46,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:44:46,213 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:46,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 34 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 17:44:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 17:44:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-10-14 17:44:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.2857142857142858) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 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-10-14 17:44:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2024-10-14 17:44:46,221 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 18 [2024-10-14 17:44:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:46,222 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2024-10-14 17:44:46,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 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-10-14 17:44:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2024-10-14 17:44:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:44:46,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:46,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:44:46,228 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-10-14 17:44:46,423 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-10-14 17:44:46,424 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1974353524, now seen corresponding path program 1 times [2024-10-14 17:44:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:46,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389445771] [2024-10-14 17:44:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:44:46,424 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-10-14 17:44:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:46,427 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-10-14 17:44:46,428 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-10-14 17:44:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:44:46,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 17:44:46,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:46,495 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 8 treesize of output 7 [2024-10-14 17:44:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:46,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 17:44:47,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:47,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389445771] [2024-10-14 17:44:47,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389445771] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:47,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:47,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-10-14 17:44:47,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998104173] [2024-10-14 17:44:47,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:47,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:44:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:44:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:44:47,029 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-10-14 17:44:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:44:47,280 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2024-10-14 17:44:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:44:47,280 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-10-14 17:44:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:44:47,281 INFO L225 Difference]: With dead ends: 102 [2024-10-14 17:44:47,281 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 17:44:47,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:44:47,282 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:44:47,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:44:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 17:44:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2024-10-14 17:44:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 92 states have internal predecessors, (116), 0 states have call successors, (0), 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-10-14 17:44:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2024-10-14 17:44:47,287 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 21 [2024-10-14 17:44:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:44:47,288 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2024-10-14 17:44:47,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 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-10-14 17:44:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2024-10-14 17:44:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 17:44:47,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:44:47,289 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2024-10-14 17:44:47,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 17:44:47,489 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-10-14 17:44:47,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:44:47,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:44:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2033448383, now seen corresponding path program 3 times [2024-10-14 17:44:47,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:44:47,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594380376] [2024-10-14 17:44:47,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:44:47,491 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-10-14 17:44:47,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:44:47,492 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-10-14 17:44:47,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 17:44:47,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 17:44:47,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:44:47,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:44:47,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:44:47,653 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 8 treesize of output 7 [2024-10-14 17:44:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:48,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:44:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:44:49,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:44:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594380376] [2024-10-14 17:44:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594380376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:44:49,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:44:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-10-14 17:44:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751532421] [2024-10-14 17:44:49,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:44:49,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 17:44:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:44:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 17:44:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:44:49,406 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 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-10-14 17:45:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:01,194 INFO L93 Difference]: Finished difference Result 117 states and 152 transitions. [2024-10-14 17:45:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-14 17:45:01,195 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 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 25 [2024-10-14 17:45:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:01,196 INFO L225 Difference]: With dead ends: 117 [2024-10-14 17:45:01,196 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 17:45:01,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1158, Invalid=2502, Unknown=0, NotChecked=0, Total=3660 [2024-10-14 17:45:01,197 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 96 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:01,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 123 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 17:45:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 17:45:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-14 17:45:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 116 states have internal predecessors, (152), 0 states have call successors, (0), 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-10-14 17:45:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2024-10-14 17:45:01,209 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 25 [2024-10-14 17:45:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:01,209 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2024-10-14 17:45:01,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 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-10-14 17:45:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2024-10-14 17:45:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:45:01,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:01,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:01,220 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-10-14 17:45:01,414 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-10-14 17:45:01,414 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:01,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:01,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2075102819, now seen corresponding path program 2 times [2024-10-14 17:45:01,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:01,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759717061] [2024-10-14 17:45:01,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:45:01,415 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-10-14 17:45:01,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:01,416 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-10-14 17:45:01,418 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-10-14 17:45:01,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:45:01,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:01,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:45:01,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:01,494 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 8 treesize of output 7 [2024-10-14 17:45:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 17:45:01,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 17:45:02,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:02,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759717061] [2024-10-14 17:45:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759717061] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:02,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-10-14 17:45:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280948049] [2024-10-14 17:45:02,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:45:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:45:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:45:02,700 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 17:45:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:05,553 INFO L93 Difference]: Finished difference Result 220 states and 281 transitions. [2024-10-14 17:45:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 17:45:05,554 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 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 29 [2024-10-14 17:45:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:05,555 INFO L225 Difference]: With dead ends: 220 [2024-10-14 17:45:05,555 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 17:45:05,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 17:45:05,556 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 367 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:05,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 94 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 17:45:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 17:45:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2024-10-14 17:45:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 1.2903225806451613) internal successors, (280), 218 states have internal predecessors, (280), 0 states have call successors, (0), 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-10-14 17:45:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 280 transitions. [2024-10-14 17:45:05,561 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 280 transitions. Word has length 29 [2024-10-14 17:45:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:05,562 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 280 transitions. [2024-10-14 17:45:05,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-14 17:45:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 280 transitions. [2024-10-14 17:45:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 17:45:05,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:05,563 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:05,569 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 (18)] Forceful destruction successful, exit code 0 [2024-10-14 17:45:05,764 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-10-14 17:45:05,764 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:05,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 476636300, now seen corresponding path program 3 times [2024-10-14 17:45:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957598009] [2024-10-14 17:45:05,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:45:05,765 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-10-14 17:45:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:05,768 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-10-14 17:45:05,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 (19)] Waiting until timeout for monitored process [2024-10-14 17:45:05,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 17:45:05,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:05,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 17:45:05,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:05,909 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 8 treesize of output 7 [2024-10-14 17:45:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:45:06,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:45:07,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:07,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957598009] [2024-10-14 17:45:07,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957598009] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:07,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:07,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-10-14 17:45:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797987791] [2024-10-14 17:45:07,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:07,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 17:45:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 17:45:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:45:07,563 INFO L87 Difference]: Start difference. First operand 219 states and 280 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 17:45:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:08,323 INFO L93 Difference]: Finished difference Result 306 states and 379 transitions. [2024-10-14 17:45:08,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 17:45:08,325 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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 31 [2024-10-14 17:45:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:08,326 INFO L225 Difference]: With dead ends: 306 [2024-10-14 17:45:08,326 INFO L226 Difference]: Without dead ends: 296 [2024-10-14 17:45:08,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-10-14 17:45:08,327 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:08,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 59 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 17:45:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-14 17:45:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-10-14 17:45:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 294 states have (on average 1.2551020408163265) internal successors, (369), 295 states have internal predecessors, (369), 0 states have call successors, (0), 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-10-14 17:45:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 369 transitions. [2024-10-14 17:45:08,334 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 369 transitions. Word has length 31 [2024-10-14 17:45:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:08,334 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 369 transitions. [2024-10-14 17:45:08,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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-10-14 17:45:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 369 transitions. [2024-10-14 17:45:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 17:45:08,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:08,335 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:08,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-14 17:45:08,539 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-10-14 17:45:08,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:08,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash -459908877, now seen corresponding path program 4 times [2024-10-14 17:45:08,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:08,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180397819] [2024-10-14 17:45:08,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 17:45:08,541 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-10-14 17:45:08,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:08,542 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-10-14 17:45:08,543 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-10-14 17:45:08,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 17:45:08,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:08,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 17:45:08,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:08,643 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 8 treesize of output 7 [2024-10-14 17:45:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 17:45:09,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 17:45:10,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:10,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180397819] [2024-10-14 17:45:10,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180397819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:10,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:10,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2024-10-14 17:45:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658595674] [2024-10-14 17:45:10,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:10,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 17:45:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 17:45:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:45:10,669 INFO L87 Difference]: Start difference. First operand 296 states and 369 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-14 17:45:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:12,517 INFO L93 Difference]: Finished difference Result 541 states and 668 transitions. [2024-10-14 17:45:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 17:45:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 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 33 [2024-10-14 17:45:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:12,520 INFO L225 Difference]: With dead ends: 541 [2024-10-14 17:45:12,520 INFO L226 Difference]: Without dead ends: 533 [2024-10-14 17:45:12,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 17:45:12,521 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 253 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:12,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 79 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 17:45:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-10-14 17:45:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 468. [2024-10-14 17:45:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 466 states have (on average 1.2532188841201717) internal successors, (584), 467 states have internal predecessors, (584), 0 states have call successors, (0), 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-10-14 17:45:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 584 transitions. [2024-10-14 17:45:12,535 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 584 transitions. Word has length 33 [2024-10-14 17:45:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:12,535 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 584 transitions. [2024-10-14 17:45:12,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-14 17:45:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 584 transitions. [2024-10-14 17:45:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 17:45:12,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:12,537 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:12,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-14 17:45:12,737 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-10-14 17:45:12,737 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:12,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1943419748, now seen corresponding path program 3 times [2024-10-14 17:45:12,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:12,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618352994] [2024-10-14 17:45:12,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:45:12,738 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-10-14 17:45:12,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:12,741 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-10-14 17:45:12,742 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-10-14 17:45:12,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-14 17:45:12,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:12,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 17:45:12,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:12,924 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 8 treesize of output 7 [2024-10-14 17:45:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:13,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:15,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618352994] [2024-10-14 17:45:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618352994] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:15,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2024-10-14 17:45:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222814100] [2024-10-14 17:45:15,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:15,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 17:45:15,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 17:45:15,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2024-10-14 17:45:15,855 INFO L87 Difference]: Start difference. First operand 468 states and 584 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 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-10-14 17:45:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:22,314 INFO L93 Difference]: Finished difference Result 593 states and 736 transitions. [2024-10-14 17:45:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 17:45:22,316 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 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-10-14 17:45:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:22,317 INFO L225 Difference]: With dead ends: 593 [2024-10-14 17:45:22,318 INFO L226 Difference]: Without dead ends: 593 [2024-10-14 17:45:22,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 17:45:22,319 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 167 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:22,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 122 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 17:45:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-14 17:45:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 560. [2024-10-14 17:45:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 558 states have (on average 1.2455197132616487) internal successors, (695), 559 states have internal predecessors, (695), 0 states have call successors, (0), 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-10-14 17:45:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 695 transitions. [2024-10-14 17:45:22,329 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 695 transitions. Word has length 35 [2024-10-14 17:45:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:22,331 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 695 transitions. [2024-10-14 17:45:22,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 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-10-14 17:45:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 695 transitions. [2024-10-14 17:45:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 17:45:22,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:22,332 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:22,339 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-10-14 17:45:22,532 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-10-14 17:45:22,533 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:22,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1968720773, now seen corresponding path program 5 times [2024-10-14 17:45:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:22,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499513508] [2024-10-14 17:45:22,533 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 17:45:22,533 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-10-14 17:45:22,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:22,535 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-10-14 17:45:22,535 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-10-14 17:45:22,722 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-14 17:45:22,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:22,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:45:22,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 23 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:45:22,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 32 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:45:23,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499513508] [2024-10-14 17:45:23,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499513508] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:23,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:23,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-14 17:45:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474456664] [2024-10-14 17:45:23,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:23,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:45:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:45:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:45:23,372 INFO L87 Difference]: Start difference. First operand 560 states and 695 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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-10-14 17:45:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:24,097 INFO L93 Difference]: Finished difference Result 753 states and 913 transitions. [2024-10-14 17:45:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 17:45:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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 38 [2024-10-14 17:45:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:24,100 INFO L225 Difference]: With dead ends: 753 [2024-10-14 17:45:24,100 INFO L226 Difference]: Without dead ends: 753 [2024-10-14 17:45:24,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2024-10-14 17:45:24,101 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 179 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:24,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 123 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:45:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-10-14 17:45:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 655. [2024-10-14 17:45:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 653 states have (on average 1.2327718223583461) internal successors, (805), 654 states have internal predecessors, (805), 0 states have call successors, (0), 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-10-14 17:45:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 805 transitions. [2024-10-14 17:45:24,115 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 805 transitions. Word has length 38 [2024-10-14 17:45:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 805 transitions. [2024-10-14 17:45:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 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-10-14 17:45:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 805 transitions. [2024-10-14 17:45:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 17:45:24,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:24,117 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:24,126 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-10-14 17:45:24,317 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-10-14 17:45:24,318 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:24,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1816301710, now seen corresponding path program 4 times [2024-10-14 17:45:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241207949] [2024-10-14 17:45:24,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 17:45:24,319 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-10-14 17:45:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:24,320 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-10-14 17:45:24,322 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-10-14 17:45:24,417 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 17:45:24,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:24,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 17:45:24,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:24,430 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 8 treesize of output 7 [2024-10-14 17:45:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:25,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:27,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241207949] [2024-10-14 17:45:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241207949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:27,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:27,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2024-10-14 17:45:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898067559] [2024-10-14 17:45:27,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:27,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 17:45:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:27,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 17:45:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:45:27,914 INFO L87 Difference]: Start difference. First operand 655 states and 805 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-14 17:45:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:33,720 INFO L93 Difference]: Finished difference Result 757 states and 927 transitions. [2024-10-14 17:45:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-14 17:45:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 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 39 [2024-10-14 17:45:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:33,727 INFO L225 Difference]: With dead ends: 757 [2024-10-14 17:45:33,727 INFO L226 Difference]: Without dead ends: 757 [2024-10-14 17:45:33,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=302, Invalid=1590, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 17:45:33,728 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 137 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:33,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 170 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 17:45:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-14 17:45:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 705. [2024-10-14 17:45:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 703 states have (on average 1.229018492176387) internal successors, (864), 704 states have internal predecessors, (864), 0 states have call successors, (0), 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-10-14 17:45:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 864 transitions. [2024-10-14 17:45:33,743 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 864 transitions. Word has length 39 [2024-10-14 17:45:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:33,743 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 864 transitions. [2024-10-14 17:45:33,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 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-10-14 17:45:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 864 transitions. [2024-10-14 17:45:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 17:45:33,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:33,744 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:33,750 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 (23)] Ended with exit code 0 [2024-10-14 17:45:33,945 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-10-14 17:45:33,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2042600347, now seen corresponding path program 5 times [2024-10-14 17:45:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:33,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855332486] [2024-10-14 17:45:33,947 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 17:45:33,947 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-10-14 17:45:33,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:33,949 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-10-14 17:45:33,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 (24)] Waiting until timeout for monitored process [2024-10-14 17:45:34,155 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-14 17:45:34,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:34,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 17:45:34,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:34,168 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 8 treesize of output 7 [2024-10-14 17:45:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:34,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:45:36,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:36,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855332486] [2024-10-14 17:45:36,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855332486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:36,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:36,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2024-10-14 17:45:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050469656] [2024-10-14 17:45:36,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:36,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 17:45:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 17:45:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2024-10-14 17:45:36,951 INFO L87 Difference]: Start difference. First operand 705 states and 864 transitions. Second operand has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 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-10-14 17:45:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:45:43,264 INFO L93 Difference]: Finished difference Result 1932 states and 2369 transitions. [2024-10-14 17:45:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 17:45:43,266 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 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 42 [2024-10-14 17:45:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:45:43,271 INFO L225 Difference]: With dead ends: 1932 [2024-10-14 17:45:43,271 INFO L226 Difference]: Without dead ends: 1863 [2024-10-14 17:45:43,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2024-10-14 17:45:43,272 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 207 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:45:43,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 236 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 17:45:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-10-14 17:45:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1597. [2024-10-14 17:45:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1595 states have (on average 1.2363636363636363) internal successors, (1972), 1596 states have internal predecessors, (1972), 0 states have call successors, (0), 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-10-14 17:45:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 1972 transitions. [2024-10-14 17:45:43,298 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 1972 transitions. Word has length 42 [2024-10-14 17:45:43,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:45:43,298 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 1972 transitions. [2024-10-14 17:45:43,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 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-10-14 17:45:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1972 transitions. [2024-10-14 17:45:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 17:45:43,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:45:43,299 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:45:43,306 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-10-14 17:45:43,500 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-10-14 17:45:43,500 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:45:43,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:45:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1877419159, now seen corresponding path program 6 times [2024-10-14 17:45:43,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:45:43,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681738858] [2024-10-14 17:45:43,501 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 17:45:43,501 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-10-14 17:45:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:45:43,504 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-10-14 17:45:43,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-14 17:45:43,686 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-14 17:45:43,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:45:43,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:45:43,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:45:43,709 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 8 treesize of output 7 [2024-10-14 17:45:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 17:45:44,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:45:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 17:45:46,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:45:46,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681738858] [2024-10-14 17:45:46,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681738858] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:45:46,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:45:46,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2024-10-14 17:45:46,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088609510] [2024-10-14 17:45:46,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:45:46,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 17:45:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:45:46,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 17:45:46,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-10-14 17:45:46,650 INFO L87 Difference]: Start difference. First operand 1597 states and 1972 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)